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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 228K 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-06b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716328015308

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-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 21:46:56] [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 21:46:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:46:57] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-21 21:46:57] [INFO ] Transformed 289 places.
[2024-05-21 21:46:57] [INFO ] Transformed 644 transitions.
[2024-05-21 21:46:57] [INFO ] Found NUPN structural information;
[2024-05-21 21:46:57] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Support contains 118 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 269 transition count 624
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 269 transition count 624
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 267 transition count 622
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 267 transition count 622
Applied a total of 44 rules in 92 ms. Remains 267 /289 variables (removed 22) and now considering 622/644 (removed 22) transitions.
// Phase 1: matrix 622 rows 267 cols
[2024-05-21 21:46:57] [INFO ] Computed 11 invariants in 21 ms
[2024-05-21 21:46:58] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-21 21:46:58] [INFO ] Invariant cache hit.
[2024-05-21 21:46:58] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2024-05-21 21:46:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-21 21:47:11] [INFO ] Deduced a trap composed of 55 places in 459 ms of which 50 ms to minimize.
[2024-05-21 21:47:12] [INFO ] Deduced a trap composed of 20 places in 351 ms of which 5 ms to minimize.
[2024-05-21 21:47:12] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 5 ms to minimize.
[2024-05-21 21:47:12] [INFO ] Deduced a trap composed of 30 places in 332 ms of which 4 ms to minimize.
[2024-05-21 21:47:13] [INFO ] Deduced a trap composed of 44 places in 313 ms of which 4 ms to minimize.
[2024-05-21 21:47:13] [INFO ] Deduced a trap composed of 26 places in 298 ms of which 4 ms to minimize.
[2024-05-21 21:47:13] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:47:13] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 4 ms to minimize.
[2024-05-21 21:47:14] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 3 ms to minimize.
[2024-05-21 21:47:14] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 2 ms to minimize.
[2024-05-21 21:47:14] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:47:14] [INFO ] Deduced a trap composed of 26 places in 250 ms of which 3 ms to minimize.
[2024-05-21 21:47:15] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 3 ms to minimize.
[2024-05-21 21:47:15] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 3 ms to minimize.
[2024-05-21 21:47:15] [INFO ] Deduced a trap composed of 43 places in 315 ms of which 4 ms to minimize.
[2024-05-21 21:47:16] [INFO ] Deduced a trap composed of 53 places in 354 ms of which 4 ms to minimize.
[2024-05-21 21:47:16] [INFO ] Deduced a trap composed of 31 places in 334 ms of which 4 ms to minimize.
[2024-05-21 21:47:17] [INFO ] Deduced a trap composed of 63 places in 316 ms of which 4 ms to minimize.
[2024-05-21 21:47:17] [INFO ] Deduced a trap composed of 40 places in 392 ms of which 4 ms to minimize.
[2024-05-21 21:47:18] [INFO ] Deduced a trap composed of 43 places in 417 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-21 21:47:18] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 4 ms to minimize.
[2024-05-21 21:47:19] [INFO ] Deduced a trap composed of 27 places in 306 ms of which 4 ms to minimize.
[2024-05-21 21:47:19] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 4 ms to minimize.
[2024-05-21 21:47:20] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 3 ms to minimize.
[2024-05-21 21:47:20] [INFO ] Deduced a trap composed of 46 places in 311 ms of which 4 ms to minimize.
[2024-05-21 21:47:20] [INFO ] Deduced a trap composed of 43 places in 315 ms of which 3 ms to minimize.
[2024-05-21 21:47:21] [INFO ] Deduced a trap composed of 26 places in 315 ms of which 4 ms to minimize.
[2024-05-21 21:47:22] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 5 ms to minimize.
[2024-05-21 21:47:22] [INFO ] Deduced a trap composed of 54 places in 375 ms of which 4 ms to minimize.
[2024-05-21 21:47:22] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 3 ms to minimize.
[2024-05-21 21:47:23] [INFO ] Deduced a trap composed of 45 places in 336 ms of which 5 ms to minimize.
[2024-05-21 21:47:23] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 4 ms to minimize.
[2024-05-21 21:47:24] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 4 ms to minimize.
[2024-05-21 21:47:24] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 5 ms to minimize.
[2024-05-21 21:47:24] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 7 ms to minimize.
[2024-05-21 21:47:24] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 3 ms to minimize.
[2024-05-21 21:47:25] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 3 ms to minimize.
[2024-05-21 21:47:25] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2024-05-21 21:47:25] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:47:26] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)timeout

( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/889 variables, and 51 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-21 21:47:39] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 5 ms to minimize.
[2024-05-21 21:47:39] [INFO ] Deduced a trap composed of 16 places in 388 ms of which 4 ms to minimize.
[2024-05-21 21:47:39] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-21 21:47:40] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 4 ms to minimize.
[2024-05-21 21:47:41] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-05-21 21:47:41] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:47:41] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
[2024-05-21 21:47:42] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 4 ms to minimize.
[2024-05-21 21:47:42] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 3 ms to minimize.
[2024-05-21 21:47:42] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2024-05-21 21:47:42] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 5 ms to minimize.
[2024-05-21 21:47:43] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 2 ms to minimize.
[2024-05-21 21:47:44] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 3 ms to minimize.
[2024-05-21 21:47:44] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 3 ms to minimize.
[2024-05-21 21:47:45] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:47:45] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 5 ms to minimize.
[2024-05-21 21:47:45] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 2 ms to minimize.
[2024-05-21 21:47:46] [INFO ] Deduced a trap composed of 21 places in 388 ms of which 3 ms to minimize.
[2024-05-21 21:47:47] [INFO ] Deduced a trap composed of 29 places in 378 ms of which 3 ms to minimize.
[2024-05-21 21:47:47] [INFO ] Deduced a trap composed of 31 places in 372 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-21 21:47:51] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 4 ms to minimize.
[2024-05-21 21:47:52] [INFO ] Deduced a trap composed of 25 places in 361 ms of which 4 ms to minimize.
[2024-05-21 21:47:52] [INFO ] Deduced a trap composed of 29 places in 336 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-21 21:47:59] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-21 21:47:59] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-21 21:47:59] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 2 ms to minimize.
[2024-05-21 21:48:00] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
[2024-05-21 21:48:00] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:48:00] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-05-21 21:48:00] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-21 21:48:00] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/889 variables, and 82 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 0/621 constraints, Known Traps: 71/71 constraints]
After SMT, in 63179ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 63230ms
Starting structural reductions in LTL mode, iteration 1 : 267/289 places, 622/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64395 ms. Remains : 267/289 places, 622/644 transitions.
Support contains 118 out of 267 places after structural reductions.
[2024-05-21 21:48:02] [INFO ] Flatten gal took : 190 ms
[2024-05-21 21:48:02] [INFO ] Flatten gal took : 100 ms
[2024-05-21 21:48:02] [INFO ] Input system was already deterministic with 622 transitions.
Support contains 105 out of 267 places (down from 118) after GAL structural reductions.
FORMULA AutonomousCar-PT-06b-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (186 resets) in 2728 ms. (14 steps per ms) remains 6/71 properties
BEST_FIRST walk for 40003 steps (79 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (72 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (34 resets) in 128 ms. (310 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (56 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
[2024-05-21 21:48:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 208/221 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/267 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 622/889 variables, 267/278 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/889 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 889/889 variables, and 278 constraints, problems are : Problem set: 1 solved, 3 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 210/221 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 21:48:04] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2024-05-21 21:48:05] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-05-21 21:48:05] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
[2024-05-21 21:48:05] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 2 ms to minimize.
[2024-05-21 21:48:05] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-05-21 21:48:05] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:48:05] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-21 21:48:06] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-05-21 21:48:06] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:48:06] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:48:06] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 1 ms to minimize.
[2024-05-21 21:48:06] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:48:06] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 13/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 46/267 variables, 3/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 21:48:06] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 2 ms to minimize.
[2024-05-21 21:48:07] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 3 ms to minimize.
[2024-05-21 21:48:07] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-05-21 21:48:07] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 2 ms to minimize.
[2024-05-21 21:48:07] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 3 ms to minimize.
[2024-05-21 21:48:08] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:48:08] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 2 ms to minimize.
[2024-05-21 21:48:08] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 2 ms to minimize.
[2024-05-21 21:48:09] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 3 ms to minimize.
[2024-05-21 21:48:09] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 2 ms to minimize.
[2024-05-21 21:48:09] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 11/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SMT process timed out in 5492ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 240 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 936 edges and 265 vertex of which 260 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 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 102 rules applied. Total rules applied 104 place count 260 transition count 513
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 239 place count 159 transition count 479
Reduce places removed 20 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 24 rules applied. Total rules applied 263 place count 139 transition count 475
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 267 place count 135 transition count 475
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 267 place count 135 transition count 466
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 285 place count 126 transition count 466
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 298 place count 113 transition count 453
Iterating global reduction 4 with 13 rules applied. Total rules applied 311 place count 113 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 113 transition count 452
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 316 place count 109 transition count 415
Iterating global reduction 5 with 4 rules applied. Total rules applied 320 place count 109 transition count 415
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 326 place count 109 transition count 409
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 329 place count 106 transition count 409
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 399 place count 71 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 400 place count 71 transition count 373
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 408 place count 63 transition count 272
Iterating global reduction 8 with 8 rules applied. Total rules applied 416 place count 63 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 418 place count 63 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 420 place count 62 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 9 with 79 rules applied. Total rules applied 499 place count 62 transition count 190
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 506 place count 62 transition count 183
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 513 place count 55 transition count 183
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 514 place count 55 transition count 182
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 516 place count 55 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 517 place count 54 transition count 181
Applied a total of 517 rules in 213 ms. Remains 54 /267 variables (removed 213) and now considering 181/622 (removed 441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 54/267 places, 181/622 transitions.
RANDOM walk for 40000 steps (526 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (87 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (325 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1075693 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 2
Probabilistic random walk after 1075693 steps, saw 158955 distinct states, run finished after 3006 ms. (steps per millisecond=357 ) properties seen :0
// Phase 1: matrix 181 rows 54 cols
[2024-05-21 21:48:13] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:48:13] [INFO ] State equation strengthened by 1 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) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/213 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/229 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/235 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/235 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 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) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/213 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/229 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/230 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/235 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 736 ms.
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 181/181 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 54/54 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 181/181 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2024-05-21 21:48:14] [INFO ] Invariant cache hit.
[2024-05-21 21:48:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 21:48:14] [INFO ] Invariant cache hit.
[2024-05-21 21:48:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:48:14] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [47, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 240 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/54 places, 181/181 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 180
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 180
Applied a total of 3 rules in 18 ms. Remains 51 /52 variables (removed 1) and now considering 180/181 (removed 1) transitions.
// Phase 1: matrix 180 rows 51 cols
[2024-05-21 21:48:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 21:48:14] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 21:48:14] [INFO ] Invariant cache hit.
[2024-05-21 21:48:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:48:14] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 51/54 places, 180/181 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 573 ms. Remains : 51/54 places, 180/181 transitions.
RANDOM walk for 40000 steps (524 resets) in 1056 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (324 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1072749 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 2
Probabilistic random walk after 1072749 steps, saw 158608 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
[2024-05-21 21:48:18] [INFO ] Invariant cache hit.
[2024-05-21 21:48:18] [INFO ] State equation strengthened by 2 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) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/213 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/228 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/231 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 62 constraints, problems are : Problem set: 0 solved, 2 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 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) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/213 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/228 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:48:18] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:48:18] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:48:18] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/231 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/231 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 453 ms.
Support contains 9 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 180/180 transitions.
Applied a total of 0 rules in 13 ms. Remains 51 /51 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 51/51 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 180/180 transitions.
Applied a total of 0 rules in 10 ms. Remains 51 /51 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 21:48:19] [INFO ] Invariant cache hit.
[2024-05-21 21:48:19] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 21:48:19] [INFO ] Invariant cache hit.
[2024-05-21 21:48:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:48:19] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-21 21:48:19] [INFO ] Redundant transitions in 12 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 21:48:19] [INFO ] Invariant cache hit.
[2024-05-21 21:48:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 21:48:21] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-21 21:48:21] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-21 21:48:21] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:48:21] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 21:48:22] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:48:22] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
At refinement iteration 6 (OVERLAPS) 180/231 variables, 51/66 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 2/68 constraints. Problems are: Problem set: 2 solved, 177 unsolved
[2024-05-21 21:48:24] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 1/69 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 69 constraints, problems are : Problem set: 2 solved, 177 unsolved in 7279 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 6/13 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 180/231 variables, 51/67 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 2/69 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 177/246 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 246 constraints, problems are : Problem set: 2 solved, 177 unsolved in 9892 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 177/179 constraints, Known Traps: 7/7 constraints]
After SMT, in 17763ms problems are : Problem set: 2 solved, 177 unsolved
Search for dead transitions found 2 dead transitions in 17769ms
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 REACHABILITY mode, iteration 1 : 51/51 places, 178/180 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 51 transition count 177
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 49 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 49 transition count 176
Applied a total of 4 rules in 17 ms. Remains 49 /51 variables (removed 2) and now considering 176/178 (removed 2) transitions.
// Phase 1: matrix 176 rows 49 cols
[2024-05-21 21:48:37] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 21:48:37] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 21:48:37] [INFO ] Invariant cache hit.
[2024-05-21 21:48:37] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/51 places, 176/180 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18418 ms. Remains : 49/51 places, 176/180 transitions.
RANDOM walk for 40000 steps (511 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (67 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (320 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1098509 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :0 out of 2
Probabilistic random walk after 1098509 steps, saw 163623 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
[2024-05-21 21:48:41] [INFO ] Invariant cache hit.
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) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/213 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/225 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 58 constraints, problems are : Problem set: 0 solved, 2 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 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) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/213 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/225 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 60 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 576 ms.
Support contains 9 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 49/49 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 21:48:41] [INFO ] Invariant cache hit.
[2024-05-21 21:48:42] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 21:48:42] [INFO ] Invariant cache hit.
[2024-05-21 21:48:42] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-21 21:48:42] [INFO ] Redundant transitions in 11 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 21:48:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 21:48:44] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-21 21:48:44] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2024-05-21 21:48:44] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2024-05-21 21:48:45] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 2 ms to minimize.
[2024-05-21 21:48:45] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2024-05-21 21:48:45] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/225 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 21:48:47] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 65 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8288 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/225 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 240 constraints, problems are : Problem set: 0 solved, 175 unsolved in 12644 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 7/7 constraints]
After SMT, in 21642ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 21646ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22009 ms. Remains : 49/49 places, 176/176 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 21:49:03] [INFO ] Invariant cache hit.
[2024-05-21 21:49:03] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:49:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-21 21:49:04] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:49:04] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:49:04] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 249 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-21 21:49:04] [INFO ] Flatten gal took : 87 ms
[2024-05-21 21:49:04] [INFO ] Flatten gal took : 76 ms
[2024-05-21 21:49:04] [INFO ] Input system was already deterministic with 622 transitions.
Computed a total of 50 stabilizing places and 51 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 252 edges and 267 vertex of which 4 / 267 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 264 transition count 509
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 143 rules applied. Total rules applied 254 place count 154 transition count 476
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 274 place count 135 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 275 place count 134 transition count 475
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 275 place count 134 transition count 467
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 291 place count 126 transition count 467
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 306 place count 111 transition count 452
Iterating global reduction 4 with 15 rules applied. Total rules applied 321 place count 111 transition count 452
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 465 place count 111 transition count 308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 465 place count 111 transition count 307
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 467 place count 110 transition count 307
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 471 place count 106 transition count 288
Iterating global reduction 5 with 4 rules applied. Total rules applied 475 place count 106 transition count 288
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 481 place count 106 transition count 282
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 484 place count 103 transition count 282
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 7 with 68 rules applied. Total rules applied 552 place count 69 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 553 place count 69 transition count 247
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 562 place count 60 transition count 187
Iterating global reduction 8 with 9 rules applied. Total rules applied 571 place count 60 transition count 187
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 575 place count 60 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 577 place count 58 transition count 183
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 10 with 2 rules applied. Total rules applied 579 place count 57 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 581 place count 57 transition count 180
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 582 place count 57 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 583 place count 56 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 585 place count 54 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 586 place count 53 transition count 177
Applied a total of 586 rules in 216 ms. Remains 53 /267 variables (removed 214) and now considering 177/622 (removed 445) transitions.
// Phase 1: matrix 177 rows 53 cols
[2024-05-21 21:49:04] [INFO ] Computed 9 invariants in 6 ms
[2024-05-21 21:49:04] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 21:49:04] [INFO ] Invariant cache hit.
[2024-05-21 21:49:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:49:05] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [46, 52]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 289 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/267 places, 177/622 transitions.
Applied a total of 0 rules in 23 ms. Remains 51 /51 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 529 ms. Remains : 51/267 places, 177/622 transitions.
[2024-05-21 21:49:05] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:49:05] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:49:05] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-21 21:49:05] [INFO ] Flatten gal took : 27 ms
[2024-05-21 21:49:05] [INFO ] Flatten gal took : 26 ms
[2024-05-21 21:49:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality4489317050819707095.gal : 22 ms
[2024-05-21 21:49:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality12680528196274212390.ctl : 3 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/CTLCardinality4489317050819707095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12680528196274212390.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,2.46376e+06,0.86414,22636,2,1597,5,45498,6,0,379,58616,0


Converting to forward existential form...Done !
original formula: EG(((p43==0)||(p223==1)))
=> equivalent forward existential formula: [FwdG(Init,((p43==0)||(p223==1)))] != FALSE
Hit Full ! (commute/partial/dont) 173/0/4
(forward)formula 0,1,4.74373,96336,1,0,91,259765,19,4,3805,341602,90
FORMULA AutonomousCar-PT-06b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 240 transition count 595
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 240 transition count 595
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 198 place count 240 transition count 451
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 202 place count 236 transition count 447
Iterating global reduction 1 with 4 rules applied. Total rules applied 206 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 235 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 235 transition count 446
Applied a total of 208 rules in 20 ms. Remains 235 /267 variables (removed 32) and now considering 446/622 (removed 176) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 21:49:10] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:49:10] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 21:49:10] [INFO ] Invariant cache hit.
[2024-05-21 21:49:10] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 21:49:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:49:19] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 5 ms to minimize.
[2024-05-21 21:49:19] [INFO ] Deduced a trap composed of 55 places in 276 ms of which 4 ms to minimize.
[2024-05-21 21:49:19] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 3 ms to minimize.
[2024-05-21 21:49:20] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 3 ms to minimize.
[2024-05-21 21:49:20] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 3 ms to minimize.
[2024-05-21 21:49:20] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-21 21:49:21] [INFO ] Deduced a trap composed of 38 places in 321 ms of which 4 ms to minimize.
[2024-05-21 21:49:21] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 3 ms to minimize.
[2024-05-21 21:49:21] [INFO ] Deduced a trap composed of 30 places in 283 ms of which 4 ms to minimize.
[2024-05-21 21:49:21] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 3 ms to minimize.
[2024-05-21 21:49:22] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 4 ms to minimize.
[2024-05-21 21:49:22] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 4 ms to minimize.
[2024-05-21 21:49:22] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 4 ms to minimize.
[2024-05-21 21:49:23] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 4 ms to minimize.
[2024-05-21 21:49:23] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 3 ms to minimize.
[2024-05-21 21:49:23] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 4 ms to minimize.
[2024-05-21 21:49:24] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-05-21 21:49:24] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 3 ms to minimize.
[2024-05-21 21:49:24] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 4 ms to minimize.
[2024-05-21 21:49:24] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:49:25] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 4 ms to minimize.
[2024-05-21 21:49:26] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 3 ms to minimize.
[2024-05-21 21:49:26] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 4 ms to minimize.
[2024-05-21 21:49:26] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 4 ms to minimize.
[2024-05-21 21:49:27] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 4 ms to minimize.
[2024-05-21 21:49:27] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 3 ms to minimize.
[2024-05-21 21:49:27] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-05-21 21:49:27] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:49:28] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 4 ms to minimize.
[2024-05-21 21:49:28] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2024-05-21 21:49:28] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2024-05-21 21:49:29] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 4 ms to minimize.
[2024-05-21 21:49:29] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:49:29] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-05-21 21:49:29] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-05-21 21:49:30] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2024-05-21 21:49:30] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 3 ms to minimize.
[2024-05-21 21:49:30] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 4 ms to minimize.
[2024-05-21 21:49:30] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:49:31] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:49:35] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 4 ms to minimize.
[2024-05-21 21:49:36] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 4 ms to minimize.
[2024-05-21 21:49:36] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 4 ms to minimize.
[2024-05-21 21:49:37] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:49:37] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2024-05-21 21:49:37] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2024-05-21 21:49:37] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:49:38] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2024-05-21 21:49:38] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:49:38] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:49:38] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:49:38] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-21 21:49:39] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-05-21 21:49:39] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:49:45] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-05-21 21:49:45] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-05-21 21:49:45] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:49:46] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 2 ms to minimize.
[2024-05-21 21:49:46] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 2 ms to minimize.
[2024-05-21 21:49:46] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:49:46] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-05-21 21:49:46] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-05-21 21:49:47] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:49:47] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:49:47] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 21:49:47] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:49:47] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:49:48] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 2 ms to minimize.
[2024-05-21 21:49:48] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:49:50] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-05-21 21:49:50] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 3 ms to minimize.
[2024-05-21 21:49:50] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-05-21 21:49:50] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
[2024-05-21 21:49:51] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-05-21 21:49:51] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:49:52] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:49:55] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-05-21 21:49:55] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 2 ms to minimize.
[2024-05-21 21:49:55] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:49:55] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-05-21 21:49:56] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 2 ms to minimize.
[2024-05-21 21:49:56] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:49:59] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2024-05-21 21:49:59] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 1 ms to minimize.
[2024-05-21 21:50:00] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:50:00] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 8 (OVERLAPS) 446/681 variables, 235/332 constraints. Problems are: Problem set: 2 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 443/775 constraints. Problems are: Problem set: 2 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/681 variables, and 775 constraints, problems are : Problem set: 2 solved, 443 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 443/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61019ms problems are : Problem set: 2 solved, 443 unsolved
Search for dead transitions found 2 dead transitions in 61029ms
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 : 235/267 places, 444/622 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 444
Applied a total of 1 rules in 5 ms. Remains 234 /235 variables (removed 1) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 234 cols
[2024-05-21 21:50:11] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:50:11] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 21:50:11] [INFO ] Invariant cache hit.
[2024-05-21 21:50:12] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/267 places, 444/622 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62178 ms. Remains : 234/267 places, 444/622 transitions.
[2024-05-21 21:50:12] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:50:12] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:50:12] [INFO ] Input system was already deterministic with 444 transitions.
[2024-05-21 21:50:12] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:50:12] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:50:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality7203968892492400590.gal : 10 ms
[2024-05-21 21:50:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality16574347615588016366.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/CTLCardinality7203968892492400590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16574347615588016366.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:50:42] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:50:42] [INFO ] Applying decomposition
[2024-05-21 21:50:42] [INFO ] Flatten gal took : 23 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/graph4844463588092037037.txt' '-o' '/tmp/graph4844463588092037037.bin' '-w' '/tmp/graph4844463588092037037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4844463588092037037.bin' '-l' '-1' '-v' '-w' '/tmp/graph4844463588092037037.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:50:42] [INFO ] Decomposing Gal with order
[2024-05-21 21:50:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:50:43] [INFO ] Removed a total of 835 redundant transitions.
[2024-05-21 21:50:43] [INFO ] Flatten gal took : 126 ms
[2024-05-21 21:50:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 21 ms.
[2024-05-21 21:50:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality12213875377761045443.gal : 9 ms
[2024-05-21 21:50:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3660839545751971247.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/CTLCardinality12213875377761045443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3660839545751971247.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.03205e+12,0.343797,13540,1241,117,19691,2048,578,33024,91,8067,0


Converting to forward existential form...Done !
original formula: AX(AF(AX(A((((i1.i3.u9.p32==0)||(i16.u81.p280==0))||(i12.u62.p213==1)) U (i12.u53.p182==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(!((E(!((i12.u53.p182==1)) U (!((((i1.i3.u9.p32==0)||(i16.u81.p280==0))||(i12.u62.p213==1...226
Reverse transition relation is NOT exact ! Due to transitions t219, t221, t226, t250, t280, t304, t334, t441, i0.u70.t32, i0.u70.t35, i0.u70.t36, i0.u70.t3...786
Using 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 4
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 241 transition count 596
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 196 place count 241 transition count 452
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 200 place count 237 transition count 448
Iterating global reduction 1 with 4 rules applied. Total rules applied 204 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 236 transition count 447
Applied a total of 206 rules in 15 ms. Remains 236 /267 variables (removed 31) and now considering 447/622 (removed 175) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 21:51:13] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:51:13] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 21:51:13] [INFO ] Invariant cache hit.
[2024-05-21 21:51:13] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-05-21 21:51:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:51:19] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 9 ms to minimize.
[2024-05-21 21:51:19] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:51:20] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:51:20] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 2 ms to minimize.
[2024-05-21 21:51:20] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-05-21 21:51:20] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 2 ms to minimize.
[2024-05-21 21:51:20] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 2 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:51:22] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-21 21:51:22] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 2 ms to minimize.
[2024-05-21 21:51:22] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:51:22] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2024-05-21 21:51:22] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 2 ms to minimize.
[2024-05-21 21:51:23] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 3 ms to minimize.
[2024-05-21 21:51:23] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:51:24] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 2 ms to minimize.
[2024-05-21 21:51:24] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 2 ms to minimize.
[2024-05-21 21:51:24] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
[2024-05-21 21:51:24] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 4 ms to minimize.
[2024-05-21 21:51:25] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:51:25] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-05-21 21:51:25] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2024-05-21 21:51:25] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 2 ms to minimize.
[2024-05-21 21:51:26] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-05-21 21:51:26] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:51:26] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-05-21 21:51:26] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 4 ms to minimize.
[2024-05-21 21:51:27] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:51:27] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:51:27] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-21 21:51:27] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-21 21:51:28] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:51:28] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 3 ms to minimize.
[2024-05-21 21:51:29] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 3 ms to minimize.
[2024-05-21 21:51:29] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:51:33] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 4 ms to minimize.
[2024-05-21 21:51:33] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 4 ms to minimize.
[2024-05-21 21:51:34] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 4 ms to minimize.
[2024-05-21 21:51:34] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 4 ms to minimize.
[2024-05-21 21:51:34] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 4 ms to minimize.
[2024-05-21 21:51:35] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 4 ms to minimize.
[2024-05-21 21:51:35] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 4 ms to minimize.
[2024-05-21 21:51:35] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 3 ms to minimize.
[2024-05-21 21:51:36] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 5 ms to minimize.
[2024-05-21 21:51:36] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 4 ms to minimize.
[2024-05-21 21:51:36] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 4 ms to minimize.
[2024-05-21 21:51:36] [INFO ] Deduced a trap composed of 40 places in 282 ms of which 4 ms to minimize.
[2024-05-21 21:51:37] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 4 ms to minimize.
[2024-05-21 21:51:37] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 3 ms to minimize.
[2024-05-21 21:51:37] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 4 ms to minimize.
[2024-05-21 21:51:38] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 4 ms to minimize.
[2024-05-21 21:51:38] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 4 ms to minimize.
[2024-05-21 21:51:38] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 5 ms to minimize.
[2024-05-21 21:51:39] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 4 ms to minimize.
[2024-05-21 21:51:39] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:51:40] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-05-21 21:51:40] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 3 ms to minimize.
[2024-05-21 21:51:41] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 4 ms to minimize.
[2024-05-21 21:51:41] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 3 ms to minimize.
[2024-05-21 21:51:41] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 3 ms to minimize.
[2024-05-21 21:51:42] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 3 ms to minimize.
[2024-05-21 21:51:42] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
[2024-05-21 21:51:42] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-05-21 21:51:43] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-05-21 21:51:43] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-21 21:51:44] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 3 ms to minimize.
[2024-05-21 21:51:44] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 3 ms to minimize.
SMT process timed out in 31002ms, After SMT, problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 31008ms
Starting structural reductions in LTL mode, iteration 1 : 236/267 places, 447/622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31623 ms. Remains : 236/267 places, 447/622 transitions.
[2024-05-21 21:51:44] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:51:44] [INFO ] Flatten gal took : 31 ms
[2024-05-21 21:51:45] [INFO ] Input system was already deterministic with 447 transitions.
[2024-05-21 21:51:45] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:51:45] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:51:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17330721783520572528.gal : 7 ms
[2024-05-21 21:51:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality2231017323710637072.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/CTLCardinality17330721783520572528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2231017323710637072.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:52:15] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:52:15] [INFO ] Applying decomposition
[2024-05-21 21:52:15] [INFO ] Flatten gal took : 19 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/graph16219125931768694352.txt' '-o' '/tmp/graph16219125931768694352.bin' '-w' '/tmp/graph16219125931768694352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16219125931768694352.bin' '-l' '-1' '-v' '-w' '/tmp/graph16219125931768694352.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:52:15] [INFO ] Decomposing Gal with order
[2024-05-21 21:52:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:52:15] [INFO ] Removed a total of 850 redundant transitions.
[2024-05-21 21:52:15] [INFO ] Flatten gal took : 46 ms
[2024-05-21 21:52:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 12 ms.
[2024-05-21 21:52:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8129701074133866384.gal : 5 ms
[2024-05-21 21:52:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality4080760641927157882.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/CTLCardinality8129701074133866384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4080760641927157882.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,1.04989e+12,0.318748,12412,766,114,17956,1523,538,26103,90,7801,0


Converting to forward existential form...Done !
original formula: AX(((i15.i1.u79.p257==0) * AF((EG((i15.i1.u78.p260==0)) * EG(AG((i0.u4.p19==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !((i15.i1.u79.p257==0)))] = FALSE * [FwdG(EY(Init),!((EG((i15.i1.u78.p260==0)) * EG(!(E(TRUE U !((...185
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t230, t254, t278, t302, t344, t368, t370, t444, i0.u74.t34, i0.u74.t37, i0.u74.t3...838
Using 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 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
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,17.921,417916,1,0,1.07662e+06,4101,4409,713487,504,32143,1130779
FORMULA AutonomousCar-PT-06b-CTLCardinality-2024-02 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 : 267/267 places, 622/622 transitions.
Graph (trivial) has 250 edges and 267 vertex of which 4 / 267 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 264 transition count 510
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 142 rules applied. Total rules applied 252 place count 155 transition count 477
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 274 place count 136 transition count 474
Reduce places removed 3 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 5 rules applied. Total rules applied 279 place count 133 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 280 place count 132 transition count 472
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 280 place count 132 transition count 466
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 292 place count 126 transition count 466
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 307 place count 111 transition count 451
Iterating global reduction 5 with 15 rules applied. Total rules applied 322 place count 111 transition count 451
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 466 place count 111 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 466 place count 111 transition count 306
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 468 place count 110 transition count 306
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 472 place count 106 transition count 287
Iterating global reduction 6 with 4 rules applied. Total rules applied 476 place count 106 transition count 287
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 6 with 4 rules applied. Total rules applied 480 place count 106 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 482 place count 104 transition count 283
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 8 with 68 rules applied. Total rules applied 550 place count 70 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 551 place count 70 transition count 248
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 560 place count 61 transition count 188
Iterating global reduction 9 with 9 rules applied. Total rules applied 569 place count 61 transition count 188
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 9 with 6 rules applied. Total rules applied 575 place count 61 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 578 place count 58 transition count 182
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 11 with 2 rules applied. Total rules applied 580 place count 57 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 581 place count 57 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 583 place count 55 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 584 place count 54 transition count 178
Applied a total of 584 rules in 65 ms. Remains 54 /267 variables (removed 213) and now considering 178/622 (removed 444) transitions.
// Phase 1: matrix 178 rows 54 cols
[2024-05-21 21:52:33] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 21:52:33] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 21:52:33] [INFO ] Invariant cache hit.
[2024-05-21 21:52:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:52:33] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [45, 51]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 353 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/267 places, 178/622 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 52 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 177
Applied a total of 2 rules in 12 ms. Remains 51 /52 variables (removed 1) and now considering 177/178 (removed 1) transitions.
// Phase 1: matrix 177 rows 51 cols
[2024-05-21 21:52:33] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 21:52:33] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 21:52:33] [INFO ] Invariant cache hit.
[2024-05-21 21:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:52:34] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/267 places, 177/622 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 741 ms. Remains : 51/267 places, 177/622 transitions.
[2024-05-21 21:52:34] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:52:34] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:52:34] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-21 21:52:34] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:52:34] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:52:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality15797426192392103123.gal : 6 ms
[2024-05-21 21:52:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality18364829986577791599.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/CTLCardinality15797426192392103123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18364829986577791599.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.04627e+06,0.931684,20624,2,1523,5,43094,6,0,379,55599,0


Converting to forward existential form...Done !
original formula: AG(AF(((p288==0)||(p76==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p288==0)||(p76==1))))] = FALSE
Hit Full ! (commute/partial/dont) 173/4/4
(forward)formula 0,1,3.64603,76672,1,0,92,209987,20,2,4022,248945,92
FORMULA AutonomousCar-PT-06b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 248 transition count 603
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 248 transition count 603
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 245 transition count 600
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 245 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 244 transition count 599
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 244 transition count 599
Applied a total of 46 rules in 13 ms. Remains 244 /267 variables (removed 23) and now considering 599/622 (removed 23) transitions.
// Phase 1: matrix 599 rows 244 cols
[2024-05-21 21:52:37] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:52:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 21:52:38] [INFO ] Invariant cache hit.
[2024-05-21 21:52:38] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2024-05-21 21:52:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-05-21 21:52:50] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 4 ms to minimize.
[2024-05-21 21:52:50] [INFO ] Deduced a trap composed of 61 places in 357 ms of which 4 ms to minimize.
[2024-05-21 21:52:50] [INFO ] Deduced a trap composed of 63 places in 201 ms of which 2 ms to minimize.
[2024-05-21 21:52:51] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:52:51] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:52:51] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 2 ms to minimize.
[2024-05-21 21:52:52] [INFO ] Deduced a trap composed of 38 places in 424 ms of which 4 ms to minimize.
[2024-05-21 21:52:52] [INFO ] Deduced a trap composed of 40 places in 310 ms of which 4 ms to minimize.
[2024-05-21 21:52:52] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 3 ms to minimize.
[2024-05-21 21:52:53] [INFO ] Deduced a trap composed of 38 places in 339 ms of which 4 ms to minimize.
[2024-05-21 21:52:53] [INFO ] Deduced a trap composed of 43 places in 355 ms of which 4 ms to minimize.
[2024-05-21 21:52:53] [INFO ] Deduced a trap composed of 42 places in 382 ms of which 4 ms to minimize.
[2024-05-21 21:52:54] [INFO ] Deduced a trap composed of 45 places in 383 ms of which 4 ms to minimize.
[2024-05-21 21:52:54] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 4 ms to minimize.
[2024-05-21 21:52:54] [INFO ] Deduced a trap composed of 34 places in 358 ms of which 4 ms to minimize.
[2024-05-21 21:52:55] [INFO ] Deduced a trap composed of 56 places in 361 ms of which 4 ms to minimize.
[2024-05-21 21:52:55] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 3 ms to minimize.
[2024-05-21 21:52:56] [INFO ] Deduced a trap composed of 35 places in 333 ms of which 4 ms to minimize.
[2024-05-21 21:52:56] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 3 ms to minimize.
[2024-05-21 21:52:57] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-05-21 21:52:57] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 4 ms to minimize.
[2024-05-21 21:52:58] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
[2024-05-21 21:52:58] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 3 ms to minimize.
[2024-05-21 21:52:58] [INFO ] Deduced a trap composed of 40 places in 336 ms of which 4 ms to minimize.
[2024-05-21 21:52:59] [INFO ] Deduced a trap composed of 38 places in 335 ms of which 4 ms to minimize.
[2024-05-21 21:52:59] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 2 ms to minimize.
[2024-05-21 21:53:00] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 3 ms to minimize.
[2024-05-21 21:53:00] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 2 ms to minimize.
[2024-05-21 21:53:00] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 3 ms to minimize.
[2024-05-21 21:53:01] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2024-05-21 21:53:01] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-21 21:53:01] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 3 ms to minimize.
[2024-05-21 21:53:02] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 2 ms to minimize.
[2024-05-21 21:53:02] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2024-05-21 21:53:02] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-21 21:53:02] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 1 ms to minimize.
[2024-05-21 21:53:02] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 2 ms to minimize.
[2024-05-21 21:53:03] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 2 ms to minimize.
[2024-05-21 21:53:03] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 3 ms to minimize.
[2024-05-21 21:53:03] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-05-21 21:53:07] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 3 ms to minimize.
[2024-05-21 21:53:07] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 3 ms to minimize.
[2024-05-21 21:53:08] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 2 ms to minimize.
[2024-05-21 21:53:08] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 2 ms to minimize.
[2024-05-21 21:53:08] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-21 21:53:09] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 4 ms to minimize.
[2024-05-21 21:53:09] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 3 ms to minimize.
[2024-05-21 21:53:09] [INFO ] Deduced a trap composed of 38 places in 236 ms of which 3 ms to minimize.
[2024-05-21 21:53:10] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 3 ms to minimize.
[2024-05-21 21:53:10] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 3 ms to minimize.
[2024-05-21 21:53:10] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 3 ms to minimize.
[2024-05-21 21:53:10] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 3 ms to minimize.
[2024-05-21 21:53:11] [INFO ] Deduced a trap composed of 60 places in 353 ms of which 4 ms to minimize.
SMT process timed out in 32769ms, After SMT, problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 32776ms
Starting structural reductions in LTL mode, iteration 1 : 244/267 places, 599/622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33342 ms. Remains : 244/267 places, 599/622 transitions.
[2024-05-21 21:53:11] [INFO ] Flatten gal took : 33 ms
[2024-05-21 21:53:11] [INFO ] Flatten gal took : 36 ms
[2024-05-21 21:53:11] [INFO ] Input system was already deterministic with 599 transitions.
[2024-05-21 21:53:11] [INFO ] Flatten gal took : 35 ms
[2024-05-21 21:53:11] [INFO ] Flatten gal took : 36 ms
[2024-05-21 21:53:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality6654894389764552001.gal : 8 ms
[2024-05-21 21:53:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4827221503376168329.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/CTLCardinality6654894389764552001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4827221503376168329.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:53:41] [INFO ] Flatten gal took : 20 ms
[2024-05-21 21:53:41] [INFO ] Applying decomposition
[2024-05-21 21:53:41] [INFO ] Flatten gal took : 20 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/graph2758787022852921089.txt' '-o' '/tmp/graph2758787022852921089.bin' '-w' '/tmp/graph2758787022852921089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2758787022852921089.bin' '-l' '-1' '-v' '-w' '/tmp/graph2758787022852921089.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:53:41] [INFO ] Decomposing Gal with order
[2024-05-21 21:53:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:53:41] [INFO ] Removed a total of 1246 redundant transitions.
[2024-05-21 21:53:41] [INFO ] Flatten gal took : 58 ms
[2024-05-21 21:53:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 11 ms.
[2024-05-21 21:53:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality10888117278426827779.gal : 5 ms
[2024-05-21 21:53:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality8725642431394661126.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/CTLCardinality10888117278426827779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8725642431394661126.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.73205e+12,0.169963,8256,1277,138,8753,1157,606,7917,108,3199,0


Converting to forward existential form...Done !
original formula: AG(((((i1.i1.u19.p38==0) + EX(AF((i0.i0.u7.p21==1)))) + (A(A((i13.i0.u61.p199==1) U ((i5.i0.u31.p105==0)||(i13.i0.u60.p198==1))) U (((((i...545
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,TRUE) * !((((i1.i1.u19.p38==0) + EX(!(EG(!((i0.i0.u7.p21==1)))))) + (!((E(!((((((i1.i0.u14....2516
Reverse transition relation is NOT exact ! Due to transitions t227, t230, t243, t291, t339, t387, t471, t519, t522, t596, u76.t231, u76.t232, i1.i1.t220, i...909
Using 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 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 244 transition count 599
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 244 transition count 599
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 190 place count 244 transition count 455
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 194 place count 240 transition count 451
Iterating global reduction 1 with 4 rules applied. Total rules applied 198 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 239 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 239 transition count 450
Applied a total of 200 rules in 20 ms. Remains 239 /267 variables (removed 28) and now considering 450/622 (removed 172) transitions.
// Phase 1: matrix 450 rows 239 cols
[2024-05-21 21:54:11] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 21:54:12] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 21:54:12] [INFO ] Invariant cache hit.
[2024-05-21 21:54:12] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-05-21 21:54:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 21:54:19] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 4 ms to minimize.
[2024-05-21 21:54:20] [INFO ] Deduced a trap composed of 54 places in 337 ms of which 4 ms to minimize.
[2024-05-21 21:54:20] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 3 ms to minimize.
[2024-05-21 21:54:20] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-05-21 21:54:20] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 4 ms to minimize.
[2024-05-21 21:54:21] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 3 ms to minimize.
[2024-05-21 21:54:21] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:54:21] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 3 ms to minimize.
[2024-05-21 21:54:22] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:54:22] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 4 ms to minimize.
[2024-05-21 21:54:22] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 2 ms to minimize.
[2024-05-21 21:54:22] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:54:22] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:54:23] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 3 ms to minimize.
[2024-05-21 21:54:23] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 4 ms to minimize.
[2024-05-21 21:54:23] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
[2024-05-21 21:54:24] [INFO ] Deduced a trap composed of 45 places in 299 ms of which 3 ms to minimize.
[2024-05-21 21:54:24] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 3 ms to minimize.
[2024-05-21 21:54:24] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 3 ms to minimize.
[2024-05-21 21:54:24] [INFO ] Deduced a trap composed of 34 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 21:54:25] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 4 ms to minimize.
[2024-05-21 21:54:25] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 4 ms to minimize.
[2024-05-21 21:54:25] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 3 ms to minimize.
[2024-05-21 21:54:26] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 4 ms to minimize.
[2024-05-21 21:54:26] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 4 ms to minimize.
[2024-05-21 21:54:26] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 4 ms to minimize.
[2024-05-21 21:54:27] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 3 ms to minimize.
[2024-05-21 21:54:27] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 4 ms to minimize.
[2024-05-21 21:54:27] [INFO ] Deduced a trap composed of 41 places in 269 ms of which 4 ms to minimize.
[2024-05-21 21:54:28] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 3 ms to minimize.
[2024-05-21 21:54:28] [INFO ] Deduced a trap composed of 36 places in 274 ms of which 4 ms to minimize.
[2024-05-21 21:54:28] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 2 ms to minimize.
[2024-05-21 21:54:28] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 2 ms to minimize.
[2024-05-21 21:54:29] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2024-05-21 21:54:29] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
[2024-05-21 21:54:29] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
[2024-05-21 21:54:30] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 3 ms to minimize.
[2024-05-21 21:54:30] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 2 ms to minimize.
[2024-05-21 21:54:31] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-05-21 21:54:31] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 21:54:35] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 3 ms to minimize.
[2024-05-21 21:54:36] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 3 ms to minimize.
[2024-05-21 21:54:36] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2024-05-21 21:54:36] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-21 21:54:36] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-21 21:54:36] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:54:37] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 4 ms to minimize.
[2024-05-21 21:54:37] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 3 ms to minimize.
[2024-05-21 21:54:38] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 3 ms to minimize.
[2024-05-21 21:54:38] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:54:38] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-21 21:54:38] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 2 ms to minimize.
[2024-05-21 21:54:38] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2024-05-21 21:54:39] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:54:39] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-21 21:54:39] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-21 21:54:40] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:54:40] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 3 ms to minimize.
[2024-05-21 21:54:40] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 3 ms to minimize.
[2024-05-21 21:54:40] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 239/689 variables, and 71 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 21:54:48] [INFO ] Deduced a trap composed of 52 places in 231 ms of which 3 ms to minimize.
[2024-05-21 21:54:48] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
[2024-05-21 21:54:49] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-05-21 21:54:49] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 3 ms to minimize.
[2024-05-21 21:54:49] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 3 ms to minimize.
[2024-05-21 21:54:50] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 3 ms to minimize.
[2024-05-21 21:54:50] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 3 ms to minimize.
[2024-05-21 21:54:50] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-21 21:54:50] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-05-21 21:54:50] [INFO ] Deduced a trap composed of 45 places in 295 ms of which 4 ms to minimize.
[2024-05-21 21:54:51] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 3 ms to minimize.
[2024-05-21 21:54:51] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2024-05-21 21:54:52] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 2 ms to minimize.
[2024-05-21 21:54:52] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:54:52] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
[2024-05-21 21:54:52] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 21:54:57] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 4 ms to minimize.
[2024-05-21 21:54:57] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 4 ms to minimize.
[2024-05-21 21:54:58] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 4 ms to minimize.
[2024-05-21 21:54:59] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 6 (OVERLAPS) 450/689 variables, 239/330 constraints. Problems are: Problem set: 2 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 447/777 constraints. Problems are: Problem set: 2 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 777 constraints, problems are : Problem set: 2 solved, 447 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 447/449 constraints, Known Traps: 80/80 constraints]
After SMT, in 60804ms problems are : Problem set: 2 solved, 447 unsolved
Search for dead transitions found 2 dead transitions in 60813ms
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 : 239/267 places, 448/622 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 448
Applied a total of 1 rules in 6 ms. Remains 238 /239 variables (removed 1) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 238 cols
[2024-05-21 21:55:13] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 21:55:13] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 21:55:13] [INFO ] Invariant cache hit.
[2024-05-21 21:55:13] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 238/267 places, 448/622 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61884 ms. Remains : 238/267 places, 448/622 transitions.
[2024-05-21 21:55:13] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:55:13] [INFO ] Flatten gal took : 20 ms
[2024-05-21 21:55:13] [INFO ] Input system was already deterministic with 448 transitions.
[2024-05-21 21:55:13] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:55:14] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:55:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4440291630123207224.gal : 4 ms
[2024-05-21 21:55:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14473666860022415300.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/CTLCardinality4440291630123207224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14473666860022415300.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:55:44] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:55:44] [INFO ] Applying decomposition
[2024-05-21 21:55:44] [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/graph3856787986747045020.txt' '-o' '/tmp/graph3856787986747045020.bin' '-w' '/tmp/graph3856787986747045020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3856787986747045020.bin' '-l' '-1' '-v' '-w' '/tmp/graph3856787986747045020.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:55:44] [INFO ] Decomposing Gal with order
[2024-05-21 21:55:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:55:44] [INFO ] Removed a total of 847 redundant transitions.
[2024-05-21 21:55:44] [INFO ] Flatten gal took : 55 ms
[2024-05-21 21:55:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 12 ms.
[2024-05-21 21:55:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality14878447256548465371.gal : 4 ms
[2024-05-21 21:55:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality8916491686289907521.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/CTLCardinality14878447256548465371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8916491686289907521.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.14449e+12,0.305897,12868,949,112,19618,1240,581,22478,90,4408,0


Converting to forward existential form...Done !
original formula: (EG(E(EF((((i3.u26.p88==0)||(u1.p13==1))||(i11.i0.u66.p207==0))) U AX(EG((u1.p246==0))))) + AG(((EX(AF((i17.u86.p277==1))) * AF((((i14.u7...311
=> equivalent forward existential formula: (([(FwdU((Init * !(EG(E(E(TRUE U (((i3.u26.p88==0)||(u1.p13==1))||(i11.i0.u66.p207==0))) U !(EX(!(EG((u1.p246==0...807
Reverse transition relation is NOT exact ! Due to transitions t223, t225, t233, t251, t299, t341, t365, t372, t445, i1.u16.t200, i1.u16.t203, i1.u17.t201, ...853
Using 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 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 244 transition count 599
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 244 transition count 599
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 190 place count 244 transition count 455
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 241 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 241 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 240 transition count 451
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 240 transition count 451
Applied a total of 198 rules in 13 ms. Remains 240 /267 variables (removed 27) and now considering 451/622 (removed 171) transitions.
// Phase 1: matrix 451 rows 240 cols
[2024-05-21 21:56:14] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:56:14] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 21:56:14] [INFO ] Invariant cache hit.
[2024-05-21 21:56:14] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2024-05-21 21:56:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:56:23] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 5 ms to minimize.
[2024-05-21 21:56:23] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 3 ms to minimize.
[2024-05-21 21:56:23] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:56:23] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 3 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 4 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 4 ms to minimize.
[2024-05-21 21:56:25] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 4 ms to minimize.
[2024-05-21 21:56:25] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 4 ms to minimize.
[2024-05-21 21:56:25] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 3 ms to minimize.
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 4 ms to minimize.
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 4 ms to minimize.
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 4 ms to minimize.
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 4 ms to minimize.
[2024-05-21 21:56:27] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 3 ms to minimize.
[2024-05-21 21:56:27] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 4 ms to minimize.
[2024-05-21 21:56:27] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 3 ms to minimize.
[2024-05-21 21:56:28] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 4 ms to minimize.
[2024-05-21 21:56:28] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 4 ms to minimize.
[2024-05-21 21:56:28] [INFO ] Deduced a trap composed of 34 places in 313 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:56:29] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 4 ms to minimize.
[2024-05-21 21:56:30] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 3 ms to minimize.
[2024-05-21 21:56:30] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 4 ms to minimize.
[2024-05-21 21:56:30] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 4 ms to minimize.
[2024-05-21 21:56:30] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 3 ms to minimize.
[2024-05-21 21:56:31] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 3 ms to minimize.
[2024-05-21 21:56:31] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 3 ms to minimize.
[2024-05-21 21:56:31] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 4 ms to minimize.
[2024-05-21 21:56:32] [INFO ] Deduced a trap composed of 38 places in 402 ms of which 3 ms to minimize.
[2024-05-21 21:56:32] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 4 ms to minimize.
[2024-05-21 21:56:32] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 3 ms to minimize.
[2024-05-21 21:56:33] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-05-21 21:56:33] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 4 ms to minimize.
[2024-05-21 21:56:33] [INFO ] Deduced a trap composed of 56 places in 238 ms of which 3 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 3 ms to minimize.
[2024-05-21 21:56:35] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:56:35] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 4 ms to minimize.
[2024-05-21 21:56:35] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 2 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-05-21 21:56:40] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-21 21:56:41] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 2 ms to minimize.
[2024-05-21 21:56:42] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/691 variables, and 56 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:56:50] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 4 ms to minimize.
[2024-05-21 21:56:50] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 4 ms to minimize.
[2024-05-21 21:56:50] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 4 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-21 21:56:51] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:56:55] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 2 ms to minimize.
[2024-05-21 21:56:56] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-21 21:56:56] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 2 ms to minimize.
[2024-05-21 21:56:56] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-05-21 21:56:56] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:56:56] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD377 is UNSAT
At refinement iteration 6 (OVERLAPS) 451/691 variables, 240/307 constraints. Problems are: Problem set: 2 solved, 448 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 448/755 constraints. Problems are: Problem set: 2 solved, 448 unsolved
[2024-05-21 21:57:08] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-21 21:57:09] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-21 21:57:10] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:57:11] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/691 variables, and 759 constraints, problems are : Problem set: 2 solved, 448 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 448/450 constraints, Known Traps: 60/60 constraints]
After SMT, in 61172ms problems are : Problem set: 2 solved, 448 unsolved
Search for dead transitions found 2 dead transitions in 61181ms
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 : 240/267 places, 449/622 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 449
Applied a total of 1 rules in 5 ms. Remains 239 /240 variables (removed 1) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 239 cols
[2024-05-21 21:57:16] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:57:16] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-21 21:57:16] [INFO ] Invariant cache hit.
[2024-05-21 21:57:16] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/267 places, 449/622 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62262 ms. Remains : 239/267 places, 449/622 transitions.
[2024-05-21 21:57:16] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:57:16] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:57:16] [INFO ] Input system was already deterministic with 449 transitions.
[2024-05-21 21:57:16] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:57:16] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:57:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6480879594359143395.gal : 5 ms
[2024-05-21 21:57:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5928645759808636814.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/CTLCardinality6480879594359143395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5928645759808636814.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:57:46] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:57:46] [INFO ] Applying decomposition
[2024-05-21 21:57:46] [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/graph9161936635153440341.txt' '-o' '/tmp/graph9161936635153440341.bin' '-w' '/tmp/graph9161936635153440341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9161936635153440341.bin' '-l' '-1' '-v' '-w' '/tmp/graph9161936635153440341.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:57:46] [INFO ] Decomposing Gal with order
[2024-05-21 21:57:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:57:46] [INFO ] Removed a total of 849 redundant transitions.
[2024-05-21 21:57:46] [INFO ] Flatten gal took : 36 ms
[2024-05-21 21:57:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2024-05-21 21:57:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality9601389532846691757.gal : 4 ms
[2024-05-21 21:57:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality13889412757530106484.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/CTLCardinality9601389532846691757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13889412757530106484.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.14633e+12,0.16939,8412,695,116,8601,830,598,11697,91,3420,0


Converting to forward existential form...Done !
original formula: AX(EG(((AG((i11.i1.u57.p172==0)) + AF(((i5.i0.u23.p72==0)&&(i8.i1.u40.p125==1)))) + ((i16.i2.u91.p284==0)&&(i6.u27.p85==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((!(E(TRUE U !((i11.i1.u57.p172==0)))) + !(EG(!(((i5.i0.u23.p72==0)&&(i8.i1.u40.p125==1)))))) ...209
Reverse transition relation is NOT exact ! Due to transitions t224, t226, t231, t255, t309, t345, t369, t446, i1.u78.t32, i1.u78.t35, i1.u78.t36, i1.u78.t3...804
Using 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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 245 edges and 267 vertex of which 4 / 267 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 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 264 transition count 515
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 132 rules applied. Total rules applied 237 place count 160 transition count 487
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 254 place count 144 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 143 transition count 486
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 255 place count 143 transition count 475
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 277 place count 132 transition count 475
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 291 place count 118 transition count 461
Iterating global reduction 4 with 14 rules applied. Total rules applied 305 place count 118 transition count 461
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 449 place count 118 transition count 317
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 452 place count 115 transition count 299
Iterating global reduction 5 with 3 rules applied. Total rules applied 455 place count 115 transition count 299
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 5 with 2 rules applied. Total rules applied 457 place count 115 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 458 place count 114 transition count 297
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 528 place count 79 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 529 place count 79 transition count 261
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 537 place count 71 transition count 207
Iterating global reduction 8 with 8 rules applied. Total rules applied 545 place count 71 transition count 207
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 549 place count 71 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 551 place count 69 transition count 203
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 10 with 2 rules applied. Total rules applied 553 place count 68 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 556 place count 68 transition count 199
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 557 place count 68 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 558 place count 67 transition count 198
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 559 place count 67 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 561 place count 65 transition count 196
Applied a total of 561 rules in 95 ms. Remains 65 /267 variables (removed 202) and now considering 196/622 (removed 426) transitions.
// Phase 1: matrix 196 rows 65 cols
[2024-05-21 21:58:17] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:58:17] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 21:58:17] [INFO ] Invariant cache hit.
[2024-05-21 21:58:17] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 21:58:17] [INFO ] Implicit Places using invariants and state equation in 267 ms returned [56, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 413 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/267 places, 196/622 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 63 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 195
Applied a total of 2 rules in 12 ms. Remains 62 /63 variables (removed 1) and now considering 195/196 (removed 1) transitions.
// Phase 1: matrix 195 rows 62 cols
[2024-05-21 21:58:17] [INFO ] Computed 8 invariants in 9 ms
[2024-05-21 21:58:17] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 21:58:17] [INFO ] Invariant cache hit.
[2024-05-21 21:58:17] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 21:58:17] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 62/267 places, 195/622 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 803 ms. Remains : 62/267 places, 195/622 transitions.
[2024-05-21 21:58:17] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:58:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:58:17] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-21 21:58:17] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:58:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:58:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality18284015611540832779.gal : 2 ms
[2024-05-21 21:58:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality14218334910904272098.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/CTLCardinality18284015611540832779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14218334910904272098.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.9801e+06,9.66149,171688,2,10138,5,455357,6,0,438,420205,0


Converting to forward existential form...Done !
original formula: AG((!(E(!(AF((p39==1))) U (((p7==1)&&((p103==0)||(p275==1)))&&(p142!=0)))) + (p135==0)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((p135==0))),!(!(EG(!((p39==1)))))) * (((p7==1)&&((p103==0)||(p275==1)))&&(p142!=0)))...164
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t8, t10, t12, t14, t16, t21, t23, t29, t31, t33, t35, t40, t41, t42, t43,...561
Detected timeout of ITS tools.
[2024-05-21 21:58:47] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:58:47] [INFO ] Applying decomposition
[2024-05-21 21:58:47] [INFO ] Flatten gal took : 17 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/graph8012308377268406079.txt' '-o' '/tmp/graph8012308377268406079.bin' '-w' '/tmp/graph8012308377268406079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8012308377268406079.bin' '-l' '-1' '-v' '-w' '/tmp/graph8012308377268406079.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:58:48] [INFO ] Decomposing Gal with order
[2024-05-21 21:58:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:58:48] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-21 21:58:48] [INFO ] Flatten gal took : 31 ms
[2024-05-21 21:58:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 4 ms.
[2024-05-21 21:58:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality7672515479966305841.gal : 2 ms
[2024-05-21 21:58:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality7734148355466405301.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/CTLCardinality7672515479966305841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7734148355466405301.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.9801e+06,0.040941,4232,120,71,797,468,211,1079,63,1508,0


Converting to forward existential form...Done !
original formula: AG((!(E(!(AF((i1.u1.p39==1))) U (((u0.p7==1)&&((i3.u8.p103==0)||(i9.u24.p275==1)))&&(i4.u13.p142!=0)))) + (i4.u11.p135==0)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((i4.u11.p135==0))),!(!(EG(!((i1.u1.p39==1)))))) * (((u0.p7==1)&&((i3.u8.p103==0)||(i...200
Reverse transition relation is NOT exact ! Due to transitions t5, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t73,...495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 9
(forward)formula 0,1,0.778763,21916,1,0,40034,1220,1491,49167,324,6570,57259
FORMULA AutonomousCar-PT-06b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 241 transition count 596
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 196 place count 241 transition count 452
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 200 place count 237 transition count 448
Iterating global reduction 1 with 4 rules applied. Total rules applied 204 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 236 transition count 447
Applied a total of 206 rules in 19 ms. Remains 236 /267 variables (removed 31) and now considering 447/622 (removed 175) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 21:58:48] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 21:58:49] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 21:58:49] [INFO ] Invariant cache hit.
[2024-05-21 21:58:49] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-05-21 21:58:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:58:57] [INFO ] Deduced a trap composed of 24 places in 335 ms of which 5 ms to minimize.
[2024-05-21 21:58:57] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 4 ms to minimize.
[2024-05-21 21:58:57] [INFO ] Deduced a trap composed of 53 places in 312 ms of which 4 ms to minimize.
[2024-05-21 21:58:58] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 3 ms to minimize.
[2024-05-21 21:58:58] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 3 ms to minimize.
[2024-05-21 21:58:58] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 4 ms to minimize.
[2024-05-21 21:58:59] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 4 ms to minimize.
[2024-05-21 21:58:59] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 2 ms to minimize.
[2024-05-21 21:58:59] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:59:00] [INFO ] Deduced a trap composed of 45 places in 298 ms of which 4 ms to minimize.
[2024-05-21 21:59:00] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 3 ms to minimize.
[2024-05-21 21:59:00] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 2 ms to minimize.
[2024-05-21 21:59:00] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 3 ms to minimize.
[2024-05-21 21:59:01] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 4 ms to minimize.
[2024-05-21 21:59:01] [INFO ] Deduced a trap composed of 34 places in 301 ms of which 4 ms to minimize.
[2024-05-21 21:59:01] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 4 ms to minimize.
[2024-05-21 21:59:02] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 3 ms to minimize.
[2024-05-21 21:59:02] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2024-05-21 21:59:02] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 2 ms to minimize.
[2024-05-21 21:59:03] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:59:03] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 3 ms to minimize.
[2024-05-21 21:59:03] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 2 ms to minimize.
[2024-05-21 21:59:04] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 4 ms to minimize.
[2024-05-21 21:59:04] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:59:04] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-05-21 21:59:04] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-21 21:59:05] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 3 ms to minimize.
[2024-05-21 21:59:05] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 3 ms to minimize.
[2024-05-21 21:59:05] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 3 ms to minimize.
[2024-05-21 21:59:05] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 3 ms to minimize.
[2024-05-21 21:59:06] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-21 21:59:06] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 3 ms to minimize.
[2024-05-21 21:59:06] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-05-21 21:59:06] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2024-05-21 21:59:07] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 2 ms to minimize.
[2024-05-21 21:59:07] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2024-05-21 21:59:07] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-21 21:59:08] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-21 21:59:08] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-05-21 21:59:09] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:59:12] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:59:13] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:59:13] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 3 ms to minimize.
[2024-05-21 21:59:13] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 2 ms to minimize.
[2024-05-21 21:59:13] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:59:14] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:59:14] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 3 ms to minimize.
[2024-05-21 21:59:16] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 4 ms to minimize.
[2024-05-21 21:59:16] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 4 ms to minimize.
[2024-05-21 21:59:16] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 2 ms to minimize.
[2024-05-21 21:59:16] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:59:20] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 (/ 1.0 2.0))
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 (/ 1.0 2.0))
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 (/ 1.0 2.0))
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 (/ 1.0 2.0))
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/683 variables, and 63 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:59:24] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-05-21 21:59:25] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 4 ms to minimize.
[2024-05-21 21:59:25] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:59:25] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:59:25] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:59:26] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2024-05-21 21:59:26] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-21 21:59:27] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-21 21:59:27] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-05-21 21:59:27] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2024-05-21 21:59:28] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:59:30] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:59:31] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-05-21 21:59:31] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-21 21:59:32] [INFO ] Deduced a trap composed of 41 places in 255 ms of which 3 ms to minimize.
[2024-05-21 21:59:32] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 3 ms to minimize.
[2024-05-21 21:59:33] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-05-21 21:59:33] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 4 ms to minimize.
[2024-05-21 21:59:33] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 3 ms to minimize.
[2024-05-21 21:59:34] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 4 ms to minimize.
[2024-05-21 21:59:34] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 4 ms to minimize.
[2024-05-21 21:59:34] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:59:39] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 4 ms to minimize.
[2024-05-21 21:59:39] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:59:43] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 4 ms to minimize.
[2024-05-21 21:59:43] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 4 ms to minimize.
[2024-05-21 21:59:44] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-05-21 21:59:44] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 21:59:49] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 3 ms to minimize.
[2024-05-21 21:59:50] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/683 variables, and 93 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 0/446 constraints, Known Traps: 82/82 constraints]
After SMT, in 60923ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 60928ms
Starting structural reductions in LTL mode, iteration 1 : 236/267 places, 447/622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61709 ms. Remains : 236/267 places, 447/622 transitions.
[2024-05-21 21:59:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:59:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:59:50] [INFO ] Input system was already deterministic with 447 transitions.
[2024-05-21 21:59:50] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:59:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:59:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16372994124329083028.gal : 6 ms
[2024-05-21 21:59:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality17988418332020174099.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/CTLCardinality16372994124329083028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17988418332020174099.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 22:00:20] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:00:20] [INFO ] Applying decomposition
[2024-05-21 22:00:20] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4953471096259473630.txt' '-o' '/tmp/graph4953471096259473630.bin' '-w' '/tmp/graph4953471096259473630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4953471096259473630.bin' '-l' '-1' '-v' '-w' '/tmp/graph4953471096259473630.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:00:20] [INFO ] Decomposing Gal with order
[2024-05-21 22:00:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:00:20] [INFO ] Removed a total of 841 redundant transitions.
[2024-05-21 22:00:20] [INFO ] Flatten gal took : 37 ms
[2024-05-21 22:00:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2024-05-21 22:00:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality11733780815930772520.gal : 4 ms
[2024-05-21 22:00:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1929066446063435165.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/CTLCardinality11733780815930772520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1929066446063435165.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.05504e+12,0.951633,24280,1318,128,47556,2176,564,57017,96,7973,0


Converting to forward existential form...Done !
original formula: AF((AX(AF((i5.u26.p85==1))) * AG((i2.i1.u4.p23==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(EG(!((i5.u26.p85==1))))))) * !(E(TRUE U !((i2.i1.u4.p23==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t230, t254, t302, t344, t362, t444, i0.i1.u78.t25, i3.i1.t214, i3.i1.u11.t194, i3...824
Using 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 an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,16.7715,385168,1,0,999416,4841,4546,831005,531,22675,1301272
FORMULA AutonomousCar-PT-06b-CTLCardinality-2024-09 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 : 267/267 places, 622/622 transitions.
Graph (trivial) has 253 edges and 267 vertex of which 4 / 267 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 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 264 transition count 506
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 146 rules applied. Total rules applied 260 place count 151 transition count 473
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 279 place count 132 transition count 473
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 279 place count 132 transition count 465
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 295 place count 124 transition count 465
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 310 place count 109 transition count 450
Iterating global reduction 3 with 15 rules applied. Total rules applied 325 place count 109 transition count 450
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 469 place count 109 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 469 place count 109 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 471 place count 108 transition count 305
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 475 place count 104 transition count 286
Iterating global reduction 4 with 4 rules applied. Total rules applied 479 place count 104 transition count 286
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 4 with 6 rules applied. Total rules applied 485 place count 104 transition count 280
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 488 place count 101 transition count 280
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 556 place count 67 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 557 place count 67 transition count 245
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 566 place count 58 transition count 185
Iterating global reduction 7 with 9 rules applied. Total rules applied 575 place count 58 transition count 185
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 7 with 6 rules applied. Total rules applied 581 place count 58 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 584 place count 55 transition count 179
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 9 with 2 rules applied. Total rules applied 586 place count 54 transition count 178
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 587 place count 54 transition count 177
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 588 place count 54 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 590 place count 52 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 591 place count 51 transition count 175
Applied a total of 591 rules in 63 ms. Remains 51 /267 variables (removed 216) and now considering 175/622 (removed 447) transitions.
// Phase 1: matrix 175 rows 51 cols
[2024-05-21 22:00:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 22:00:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 22:00:37] [INFO ] Invariant cache hit.
[2024-05-21 22:00:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:00:38] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [44, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 272 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/267 places, 175/622 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 174
Applied a total of 2 rules in 9 ms. Remains 48 /49 variables (removed 1) and now considering 174/175 (removed 1) transitions.
// Phase 1: matrix 174 rows 48 cols
[2024-05-21 22:00:38] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 22:00:38] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 22:00:38] [INFO ] Invariant cache hit.
[2024-05-21 22:00:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:00:38] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/267 places, 174/622 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 687 ms. Remains : 48/267 places, 174/622 transitions.
[2024-05-21 22:00:38] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:00:38] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:00:38] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-21 22:00:38] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:00:38] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:00:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality10845564612931610287.gal : 3 ms
[2024-05-21 22:00:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality6931597775864747463.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/CTLCardinality10845564612931610287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6931597775864747463.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.54751e+06,0.609972,17972,2,1309,5,36224,6,0,364,49232,0


Converting to forward existential form...Done !
original formula: EG(AF((p221==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p221==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t32, t33, t34, t35...563
(forward)formula 0,1,2.61336,51084,1,0,534,137115,371,197,6190,184995,495
FORMULA AutonomousCar-PT-06b-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 246 transition count 601
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 246 transition count 601
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 186 place count 246 transition count 457
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 243 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 243 transition count 454
Applied a total of 192 rules in 17 ms. Remains 243 /267 variables (removed 24) and now considering 454/622 (removed 168) transitions.
// Phase 1: matrix 454 rows 243 cols
[2024-05-21 22:00:41] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 22:00:41] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 22:00:41] [INFO ] Invariant cache hit.
[2024-05-21 22:00:41] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-05-21 22:00:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 22:00:51] [INFO ] Deduced a trap composed of 27 places in 356 ms of which 5 ms to minimize.
[2024-05-21 22:00:51] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 4 ms to minimize.
[2024-05-21 22:00:51] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 4 ms to minimize.
[2024-05-21 22:00:51] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 3 ms to minimize.
[2024-05-21 22:00:52] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 4 ms to minimize.
[2024-05-21 22:00:52] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 3 ms to minimize.
[2024-05-21 22:00:52] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 4 ms to minimize.
[2024-05-21 22:00:53] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 3 ms to minimize.
[2024-05-21 22:00:53] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 4 ms to minimize.
[2024-05-21 22:00:53] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 4 ms to minimize.
[2024-05-21 22:00:54] [INFO ] Deduced a trap composed of 21 places in 319 ms of which 4 ms to minimize.
[2024-05-21 22:00:54] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 3 ms to minimize.
[2024-05-21 22:00:54] [INFO ] Deduced a trap composed of 62 places in 285 ms of which 3 ms to minimize.
[2024-05-21 22:00:55] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 4 ms to minimize.
[2024-05-21 22:00:55] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 3 ms to minimize.
[2024-05-21 22:00:55] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 4 ms to minimize.
[2024-05-21 22:00:56] [INFO ] Deduced a trap composed of 32 places in 324 ms of which 4 ms to minimize.
[2024-05-21 22:00:56] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 4 ms to minimize.
[2024-05-21 22:00:56] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 4 ms to minimize.
[2024-05-21 22:00:57] [INFO ] Deduced a trap composed of 37 places in 341 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 22:00:57] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 3 ms to minimize.
[2024-05-21 22:00:58] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 3 ms to minimize.
[2024-05-21 22:00:58] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2024-05-21 22:00:58] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:00:59] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 3 ms to minimize.
[2024-05-21 22:00:59] [INFO ] Deduced a trap composed of 39 places in 329 ms of which 4 ms to minimize.
[2024-05-21 22:01:00] [INFO ] Deduced a trap composed of 43 places in 315 ms of which 3 ms to minimize.
[2024-05-21 22:01:00] [INFO ] Deduced a trap composed of 39 places in 310 ms of which 4 ms to minimize.
[2024-05-21 22:01:00] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 4 ms to minimize.
[2024-05-21 22:01:01] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-05-21 22:01:01] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 2 ms to minimize.
[2024-05-21 22:01:01] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-05-21 22:01:02] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 4 ms to minimize.
[2024-05-21 22:01:02] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 4 ms to minimize.
[2024-05-21 22:01:02] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 4 ms to minimize.
[2024-05-21 22:01:03] [INFO ] Deduced a trap composed of 32 places in 339 ms of which 4 ms to minimize.
[2024-05-21 22:01:03] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 4 ms to minimize.
[2024-05-21 22:01:03] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 3 ms to minimize.
[2024-05-21 22:01:04] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 3 ms to minimize.
[2024-05-21 22:01:04] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 22:01:08] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 3 ms to minimize.
[2024-05-21 22:01:08] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 4 ms to minimize.
[2024-05-21 22:01:09] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 4 ms to minimize.
[2024-05-21 22:01:10] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 4 ms to minimize.
[2024-05-21 22:01:10] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-05-21 22:01:10] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 3 ms to minimize.
[2024-05-21 22:01:10] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-05-21 22:01:11] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-05-21 22:01:11] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-21 22:01:12] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 4 ms to minimize.
[2024-05-21 22:01:12] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 3 ms to minimize.
[2024-05-21 22:01:12] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/697 variables, and 63 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/243 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 22:01:17] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 4 ms to minimize.
[2024-05-21 22:01:18] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 5 ms to minimize.
[2024-05-21 22:01:19] [INFO ] Deduced a trap composed of 58 places in 318 ms of which 4 ms to minimize.
[2024-05-21 22:01:19] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 4 ms to minimize.
[2024-05-21 22:01:20] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 3 ms to minimize.
[2024-05-21 22:01:20] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-05-21 22:01:20] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 4 ms to minimize.
[2024-05-21 22:01:20] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 3 ms to minimize.
[2024-05-21 22:01:21] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:01:21] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 2 ms to minimize.
[2024-05-21 22:01:22] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 3 ms to minimize.
[2024-05-21 22:01:22] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-05-21 22:01:22] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 3 ms to minimize.
[2024-05-21 22:01:23] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 2 ms to minimize.
[2024-05-21 22:01:23] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 2 ms to minimize.
[2024-05-21 22:01:23] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-21 22:01:24] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 3 ms to minimize.
[2024-05-21 22:01:24] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-21 22:01:24] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 2 ms to minimize.
[2024-05-21 22:01:24] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 22:01:25] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:01:25] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 3 ms to minimize.
[2024-05-21 22:01:26] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 2 ms to minimize.
[2024-05-21 22:01:26] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-05-21 22:01:26] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-21 22:01:27] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2024-05-21 22:01:27] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-05-21 22:01:27] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-21 22:01:27] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-05-21 22:01:28] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 3 ms to minimize.
[2024-05-21 22:01:28] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 3 ms to minimize.
[2024-05-21 22:01:29] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 2 ms to minimize.
[2024-05-21 22:01:29] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 22:01:33] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/697 variables, and 97 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/243 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 86/86 constraints]
After SMT, in 61102ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 61112ms
Starting structural reductions in LTL mode, iteration 1 : 243/267 places, 454/622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61750 ms. Remains : 243/267 places, 454/622 transitions.
[2024-05-21 22:01:43] [INFO ] Flatten gal took : 26 ms
[2024-05-21 22:01:43] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:01:43] [INFO ] Input system was already deterministic with 454 transitions.
[2024-05-21 22:01:43] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:01:43] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:01:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15618704213145796059.gal : 6 ms
[2024-05-21 22:01:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality2397574145767976477.ctl : 56 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/CTLCardinality15618704213145796059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2397574145767976477.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 22:02:13] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:02:13] [INFO ] Applying decomposition
[2024-05-21 22:02:13] [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/graph17653626719100985996.txt' '-o' '/tmp/graph17653626719100985996.bin' '-w' '/tmp/graph17653626719100985996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17653626719100985996.bin' '-l' '-1' '-v' '-w' '/tmp/graph17653626719100985996.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:02:13] [INFO ] Decomposing Gal with order
[2024-05-21 22:02:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:02:13] [INFO ] Removed a total of 855 redundant transitions.
[2024-05-21 22:02:13] [INFO ] Flatten gal took : 33 ms
[2024-05-21 22:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2024-05-21 22:02:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality13668625532054957778.gal : 4 ms
[2024-05-21 22:02:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13723821254240238480.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/CTLCardinality13668625532054957778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13723821254240238480.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.32819e+12,0.869048,28868,1442,126,53090,2840,578,70464,88,12906,0


Converting to forward existential form...Done !
original formula: ((EG(EX(EF(((i4.i1.u31.p81==0)||(i17.i2.u89.p276==1))))) * EX(((i10.u58.p179==0) + EX(AF((i3.u28.p84==0)))))) * ((EG(((EF(((i16.i2.u84.p2...654
=> equivalent forward existential formula: (([(Init * !(EG(EX(E(TRUE U ((i4.i1.u31.p81==0)||(i17.i2.u89.p276==1)))))))] = FALSE * [(Init * !(EX(((i10.u58.p...2364
Reverse transition relation is NOT exact ! Due to transitions t227, t229, t233, t257, t281, t305, t347, t371, t451, i1.i2.t199, i1.i2.t220, i1.i2.u12.t219,...859
Using 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 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 243 transition count 598
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 243 transition count 598
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 192 place count 243 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 240 transition count 451
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 239 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 239 transition count 450
Applied a total of 200 rules in 11 ms. Remains 239 /267 variables (removed 28) and now considering 450/622 (removed 172) transitions.
// Phase 1: matrix 450 rows 239 cols
[2024-05-21 22:02:43] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 22:02:43] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 22:02:43] [INFO ] Invariant cache hit.
[2024-05-21 22:02:44] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-05-21 22:02:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:02:52] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 4 ms to minimize.
[2024-05-21 22:02:53] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 3 ms to minimize.
[2024-05-21 22:02:53] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 4 ms to minimize.
[2024-05-21 22:02:53] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-05-21 22:02:53] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-05-21 22:02:53] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 4 ms to minimize.
[2024-05-21 22:02:54] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 4 ms to minimize.
[2024-05-21 22:02:54] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 3 ms to minimize.
[2024-05-21 22:02:55] [INFO ] Deduced a trap composed of 58 places in 265 ms of which 3 ms to minimize.
[2024-05-21 22:02:55] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 3 ms to minimize.
[2024-05-21 22:02:55] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 3 ms to minimize.
[2024-05-21 22:02:55] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 3 ms to minimize.
[2024-05-21 22:02:56] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 4 ms to minimize.
[2024-05-21 22:02:56] [INFO ] Deduced a trap composed of 41 places in 284 ms of which 4 ms to minimize.
[2024-05-21 22:02:56] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 3 ms to minimize.
[2024-05-21 22:02:57] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 3 ms to minimize.
[2024-05-21 22:02:57] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:02:57] [INFO ] Deduced a trap composed of 58 places in 255 ms of which 4 ms to minimize.
[2024-05-21 22:02:58] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 3 ms to minimize.
[2024-05-21 22:02:58] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:02:58] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 2 ms to minimize.
[2024-05-21 22:02:59] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2024-05-21 22:02:59] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 3 ms to minimize.
[2024-05-21 22:02:59] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 4 ms to minimize.
[2024-05-21 22:03:00] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:03:00] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 4 ms to minimize.
[2024-05-21 22:03:00] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:03:01] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:03:01] [INFO ] Deduced a trap composed of 40 places in 317 ms of which 4 ms to minimize.
[2024-05-21 22:03:01] [INFO ] Deduced a trap composed of 42 places in 258 ms of which 3 ms to minimize.
[2024-05-21 22:03:02] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2024-05-21 22:03:02] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2024-05-21 22:03:02] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
[2024-05-21 22:03:03] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2024-05-21 22:03:03] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 2 ms to minimize.
[2024-05-21 22:03:03] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-21 22:03:03] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 2 ms to minimize.
[2024-05-21 22:03:04] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
[2024-05-21 22:03:04] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-21 22:03:04] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:03:09] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 4 ms to minimize.
[2024-05-21 22:03:09] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 3 ms to minimize.
[2024-05-21 22:03:10] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 4 ms to minimize.
[2024-05-21 22:03:10] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 3 ms to minimize.
[2024-05-21 22:03:10] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-21 22:03:10] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 3 ms to minimize.
[2024-05-21 22:03:11] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 2 ms to minimize.
[2024-05-21 22:03:11] [INFO ] Deduced a trap composed of 41 places in 289 ms of which 3 ms to minimize.
[2024-05-21 22:03:11] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 4 ms to minimize.
[2024-05-21 22:03:12] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 4 ms to minimize.
[2024-05-21 22:03:12] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-05-21 22:03:12] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-05-21 22:03:12] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
[2024-05-21 22:03:13] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 4 ms to minimize.
[2024-05-21 22:03:13] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:03:13] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 3 ms to minimize.
[2024-05-21 22:03:14] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:03:14] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:03:14] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 4 ms to minimize.
[2024-05-21 22:03:14] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 239/689 variables, and 71 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:03:19] [INFO ] Deduced a trap composed of 43 places in 320 ms of which 3 ms to minimize.
[2024-05-21 22:03:20] [INFO ] Deduced a trap composed of 15 places in 328 ms of which 3 ms to minimize.
[2024-05-21 22:03:20] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 4 ms to minimize.
[2024-05-21 22:03:21] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 4 ms to minimize.
[2024-05-21 22:03:22] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 4 ms to minimize.
[2024-05-21 22:03:22] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 4 ms to minimize.
[2024-05-21 22:03:22] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 3 ms to minimize.
[2024-05-21 22:03:23] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 2 ms to minimize.
[2024-05-21 22:03:23] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 4 ms to minimize.
[2024-05-21 22:03:23] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 2 ms to minimize.
[2024-05-21 22:03:23] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-21 22:03:24] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 3 ms to minimize.
[2024-05-21 22:03:24] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 3 ms to minimize.
[2024-05-21 22:03:25] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 4 ms to minimize.
[2024-05-21 22:03:25] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 3 ms to minimize.
[2024-05-21 22:03:25] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 3 ms to minimize.
[2024-05-21 22:03:26] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 3 ms to minimize.
[2024-05-21 22:03:26] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 3 ms to minimize.
[2024-05-21 22:03:26] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:03:31] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-21 22:03:32] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-05-21 22:03:32] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-21 22:03:32] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-05-21 22:03:32] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 4 ms to minimize.
[2024-05-21 22:03:33] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 3 ms to minimize.
[2024-05-21 22:03:33] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 3 ms to minimize.
[2024-05-21 22:03:33] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 6 (OVERLAPS) 450/689 variables, 239/337 constraints. Problems are: Problem set: 2 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 447/784 constraints. Problems are: Problem set: 2 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 784 constraints, problems are : Problem set: 2 solved, 447 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 447/449 constraints, Known Traps: 87/87 constraints]
After SMT, in 61071ms problems are : Problem set: 2 solved, 447 unsolved
Search for dead transitions found 2 dead transitions in 61080ms
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 : 239/267 places, 448/622 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 448
Applied a total of 1 rules in 3 ms. Remains 238 /239 variables (removed 1) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 238 cols
[2024-05-21 22:03:45] [INFO ] Computed 11 invariants in 9 ms
[2024-05-21 22:03:45] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 22:03:45] [INFO ] Invariant cache hit.
[2024-05-21 22:03:45] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 238/267 places, 448/622 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62163 ms. Remains : 238/267 places, 448/622 transitions.
[2024-05-21 22:03:45] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:03:45] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:03:45] [INFO ] Input system was already deterministic with 448 transitions.
[2024-05-21 22:03:45] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:03:45] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:03:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality3264162525871166545.gal : 5 ms
[2024-05-21 22:03:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality10157028912817498486.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/CTLCardinality3264162525871166545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10157028912817498486.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 22:04:15] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:04:15] [INFO ] Applying decomposition
[2024-05-21 22:04:15] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8359279468819516528.txt' '-o' '/tmp/graph8359279468819516528.bin' '-w' '/tmp/graph8359279468819516528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8359279468819516528.bin' '-l' '-1' '-v' '-w' '/tmp/graph8359279468819516528.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:04:15] [INFO ] Decomposing Gal with order
[2024-05-21 22:04:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:04:15] [INFO ] Removed a total of 860 redundant transitions.
[2024-05-21 22:04:15] [INFO ] Flatten gal took : 31 ms
[2024-05-21 22:04:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2024-05-21 22:04:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality9161068035390359838.gal : 3 ms
[2024-05-21 22:04:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality13434857308788478252.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/CTLCardinality9161068035390359838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13434857308788478252.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.18715e+12,0.507998,15552,836,111,24987,1763,599,32549,88,5593,0


Converting to forward existential form...Done !
original formula: A(((!(EG(A((i4.i1.u26.p82==1) U ((i3.i0.u14.p42==0)||(i0.u78.p249==1))))) * (!((EX((i12.u56.p182==1)) * EF(((i17.i0.u79.p250==0)||(i2.i0....430
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((E(!(E(TRUE U !(((i14.i1.u69.p217==0)||(i0.u77.p243==1))))) U !(E(TRUE U !((i9.i1.u39.p1...918
Reverse transition relation is NOT exact ! Due to transitions t223, t225, t227, t251, t275, t299, t341, t365, t445, i0.t33, i0.u76.t38, i0.u76.t39, i2.t216...806
Using 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 16
Fast SCC detection found an SCC at level 17
Using 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 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 248 edges and 267 vertex of which 4 / 267 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 264 transition count 508
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 144 rules applied. Total rules applied 256 place count 153 transition count 475
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 276 place count 134 transition count 474
Reduce places removed 1 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 3 rules applied. Total rules applied 279 place count 133 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 280 place count 132 transition count 472
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 280 place count 132 transition count 465
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 294 place count 125 transition count 465
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 309 place count 110 transition count 450
Iterating global reduction 5 with 15 rules applied. Total rules applied 324 place count 110 transition count 450
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 468 place count 110 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 468 place count 110 transition count 305
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 470 place count 109 transition count 305
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 474 place count 105 transition count 286
Iterating global reduction 6 with 4 rules applied. Total rules applied 478 place count 105 transition count 286
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 6 with 6 rules applied. Total rules applied 484 place count 105 transition count 280
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 487 place count 102 transition count 280
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 553 place count 69 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 554 place count 69 transition count 246
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 561 place count 62 transition count 200
Iterating global reduction 9 with 7 rules applied. Total rules applied 568 place count 62 transition count 200
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 9 with 4 rules applied. Total rules applied 572 place count 62 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 574 place count 60 transition count 196
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 11 with 2 rules applied. Total rules applied 576 place count 59 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 577 place count 59 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 579 place count 57 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 580 place count 56 transition count 192
Applied a total of 580 rules in 42 ms. Remains 56 /267 variables (removed 211) and now considering 192/622 (removed 430) transitions.
// Phase 1: matrix 192 rows 56 cols
[2024-05-21 22:04:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 22:04:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 22:04:46] [INFO ] Invariant cache hit.
[2024-05-21 22:04:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:04:46] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [49, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 233 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/267 places, 192/622 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 54 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 191
Applied a total of 2 rules in 6 ms. Remains 53 /54 variables (removed 1) and now considering 191/192 (removed 1) transitions.
// Phase 1: matrix 191 rows 53 cols
[2024-05-21 22:04:46] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 22:04:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 22:04:46] [INFO ] Invariant cache hit.
[2024-05-21 22:04:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:04:46] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/267 places, 191/622 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 502 ms. Remains : 53/267 places, 191/622 transitions.
[2024-05-21 22:04:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:04:46] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:04:46] [INFO ] Input system was already deterministic with 191 transitions.
[2024-05-21 22:04:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:04:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:04:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11677723203279380219.gal : 2 ms
[2024-05-21 22:04:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17153875629751963492.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/CTLCardinality11677723203279380219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17153875629751963492.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20328e+06,1.24954,35556,2,2302,5,85716,6,0,401,107687,0


Converting to forward existential form...Done !
original formula: EG(AF(E(((p58==0)||(p45==1)) U !(AF(((p118==0)||(p45==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(((p58==0)||(p45==1)) U !(!(EG(!(((p118==0)||(p45==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t8, t10, t12, t14, t16, t18, t20, t21, t24, t26, t28, t30, t39, t41, t47,...340
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-21 22:05:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:05:16] [INFO ] Applying decomposition
[2024-05-21 22:05:16] [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/graph13940220145880214720.txt' '-o' '/tmp/graph13940220145880214720.bin' '-w' '/tmp/graph13940220145880214720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13940220145880214720.bin' '-l' '-1' '-v' '-w' '/tmp/graph13940220145880214720.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:05:16] [INFO ] Decomposing Gal with order
[2024-05-21 22:05:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:05:16] [INFO ] Removed a total of 594 redundant transitions.
[2024-05-21 22:05:16] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 2 ms.
[2024-05-21 22:05:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality3014592711104472347.gal : 1 ms
[2024-05-21 22:05:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality8020602190206827309.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/CTLCardinality3014592711104472347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8020602190206827309.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.20328e+06,0.020294,3976,87,67,497,330,144,683,61,1189,0


Converting to forward existential form...Done !
original formula: EG(AF(E(((u2.p58==0)||(i0.u0.p45==1)) U !(AF(((i4.u7.p118==0)||(i0.u0.p45==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(((u2.p58==0)||(i0.u0.p45==1)) U !(!(EG(!(((i4.u7.p118==0)||(i0.u0.p45==1)))))))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t5, t65, t109, t127, u2.t30, u2.t104, i0.u3.t28, i2.u4.t26, i2.u5.t24, i4.u6.t20, i4.u7.t21, ...375
Using 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 an SCC at level 2
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 8
(forward)formula 0,1,0.90347,30636,1,0,58565,956,856,86516,298,4771,64453
FORMULA AutonomousCar-PT-06b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 250 edges and 267 vertex of which 4 / 267 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 264 transition count 510
Reduce places removed 109 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 143 rules applied. Total rules applied 253 place count 155 transition count 476
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 22 rules applied. Total rules applied 275 place count 135 transition count 474
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 277 place count 133 transition count 474
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 277 place count 133 transition count 467
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 291 place count 126 transition count 467
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 306 place count 111 transition count 452
Iterating global reduction 4 with 15 rules applied. Total rules applied 321 place count 111 transition count 452
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 4 with 145 rules applied. Total rules applied 466 place count 111 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 466 place count 111 transition count 306
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 468 place count 110 transition count 306
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 472 place count 106 transition count 287
Iterating global reduction 5 with 4 rules applied. Total rules applied 476 place count 106 transition count 287
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 482 place count 106 transition count 281
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 485 place count 103 transition count 281
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 7 with 68 rules applied. Total rules applied 553 place count 69 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 554 place count 69 transition count 246
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 563 place count 60 transition count 186
Iterating global reduction 8 with 9 rules applied. Total rules applied 572 place count 60 transition count 186
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 576 place count 60 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 578 place count 58 transition count 182
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 10 with 2 rules applied. Total rules applied 580 place count 57 transition count 181
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 581 place count 57 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 583 place count 55 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 584 place count 54 transition count 178
Applied a total of 584 rules in 37 ms. Remains 54 /267 variables (removed 213) and now considering 178/622 (removed 444) transitions.
// Phase 1: matrix 178 rows 54 cols
[2024-05-21 22:05:17] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 22:05:17] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 22:05:17] [INFO ] Invariant cache hit.
[2024-05-21 22:05:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:05:17] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [47, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 228 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/267 places, 178/622 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 52 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 177
Applied a total of 2 rules in 5 ms. Remains 51 /52 variables (removed 1) and now considering 177/178 (removed 1) transitions.
// Phase 1: matrix 177 rows 51 cols
[2024-05-21 22:05:17] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 22:05:17] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 22:05:17] [INFO ] Invariant cache hit.
[2024-05-21 22:05:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:05:18] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/267 places, 177/622 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 466 ms. Remains : 51/267 places, 177/622 transitions.
[2024-05-21 22:05:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:05:18] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:05:18] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-21 22:05:18] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:05:18] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:05:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality545401363957215444.gal : 2 ms
[2024-05-21 22:05:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13027772819843320290.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/CTLCardinality545401363957215444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13027772819843320290.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,2.41377e+06,0.968955,20628,2,1527,5,41223,6,0,378,55510,0


Converting to forward existential form...Done !
original formula: EF(EG(((p157==1) + EF((p202==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p157==1) + E(TRUE U (p202==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t8, t13, t15, t18, t20, t22, t24, t26, t28, t30, t32, t34, t35, t36, ...565
(forward)formula 0,1,2.66271,49968,1,0,517,137812,378,176,6544,200369,452
FORMULA AutonomousCar-PT-06b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 229 edges and 267 vertex of which 4 / 267 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 265 transition count 523
Reduce places removed 97 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 123 rules applied. Total rules applied 221 place count 168 transition count 497
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 19 rules applied. Total rules applied 240 place count 154 transition count 492
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 245 place count 149 transition count 492
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 245 place count 149 transition count 480
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 269 place count 137 transition count 480
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 285 place count 121 transition count 464
Iterating global reduction 4 with 16 rules applied. Total rules applied 301 place count 121 transition count 464
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 445 place count 121 transition count 320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 445 place count 121 transition count 319
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 447 place count 120 transition count 319
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 451 place count 116 transition count 300
Iterating global reduction 5 with 4 rules applied. Total rules applied 455 place count 116 transition count 300
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 5 with 2 rules applied. Total rules applied 457 place count 116 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 458 place count 115 transition count 298
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 522 place count 83 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 523 place count 83 transition count 265
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 532 place count 74 transition count 205
Iterating global reduction 8 with 9 rules applied. Total rules applied 541 place count 74 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 8 with 3 rules applied. Total rules applied 544 place count 74 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 545 place count 73 transition count 202
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 10 with 2 rules applied. Total rules applied 547 place count 72 transition count 201
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 548 place count 72 transition count 200
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 551 place count 72 transition count 200
Applied a total of 551 rules in 41 ms. Remains 72 /267 variables (removed 195) and now considering 200/622 (removed 422) transitions.
// Phase 1: matrix 200 rows 72 cols
[2024-05-21 22:05:20] [INFO ] Computed 10 invariants in 0 ms
[2024-05-21 22:05:21] [INFO ] Implicit Places using invariants in 127 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/267 places, 200/622 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 175 ms. Remains : 71/267 places, 200/622 transitions.
[2024-05-21 22:05:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:05:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:05:21] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-21 22:05:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:05:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:05:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality3683884190295921098.gal : 2 ms
[2024-05-21 22:05:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13272238691893217441.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/CTLCardinality3683884190295921098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13272238691893217441.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.34122e+07,2.04692,51740,2,3515,5,182934,6,0,483,191340,0


Converting to forward existential form...Done !
original formula: E(E(((A((p171!=1) U ((p77!=0)&&(!((p108==0)||(p127==1))))) + E((p217==1) U ((p173==0)||(p286==1)))) + (p190!=1)) U EG(AF(((p155==0)||(p12...188
=> equivalent forward existential formula: [(FwdU(Init,E(((!((E(!(((p77!=0)&&(!((p108==0)||(p127==1))))) U (!((p171!=1)) * !(((p77!=0)&&(!((p108==0)||(p127...343
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t10, t12, t14, t17, t19, t24, t26, t28, t30, t35, t37, t42, t44, t46, t47...920
Detected timeout of ITS tools.
[2024-05-21 22:05:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:05:51] [INFO ] Applying decomposition
[2024-05-21 22:05:51] [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/graph2703643273861988850.txt' '-o' '/tmp/graph2703643273861988850.bin' '-w' '/tmp/graph2703643273861988850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2703643273861988850.bin' '-l' '-1' '-v' '-w' '/tmp/graph2703643273861988850.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:05:51] [INFO ] Decomposing Gal with order
[2024-05-21 22:05:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:05:51] [INFO ] Removed a total of 579 redundant transitions.
[2024-05-21 22:05:51] [INFO ] Flatten gal took : 18 ms
[2024-05-21 22:05:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-21 22:05:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11108445358859955896.gal : 2 ms
[2024-05-21 22:05:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality10950160724393869724.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/CTLCardinality11108445358859955896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10950160724393869724.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.34122e+07,0.033375,4544,202,67,1466,424,259,1678,76,1607,0


Converting to forward existential form...Done !
original formula: E(E(((A((i6.u12.p171!=1) U ((i1.u2.p77!=0)&&(!((i3.u6.p108==0)||(i5.u11.p127==1))))) + E((i9.u18.p217==1) U ((i6.u13.p173==0)||(i10.u24.p...272
=> equivalent forward existential formula: [(FwdU(Init,E(((!((E(!(((i1.u2.p77!=0)&&(!((i3.u6.p108==0)||(i5.u11.p127==1))))) U (!((i6.u12.p171!=1)) * !(((i1...465
Reverse transition relation is NOT exact ! Due to transitions t54, t55, t56, t57, t58, t59, t60, t61, t70, t71, t72, t73, t74, t75, t76, t77, t86, t87, t88...615
Using 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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 11
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 11
(forward)formula 0,1,2.87284,113312,1,0,245520,1014,1932,365215,385,4058,309736
FORMULA AutonomousCar-PT-06b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 22:05:54] [INFO ] Flatten gal took : 20 ms
[2024-05-21 22:05:54] [INFO ] Flatten gal took : 19 ms
[2024-05-21 22:05:54] [INFO ] Applying decomposition
[2024-05-21 22:05:54] [INFO ] Flatten gal took : 20 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/graph16196097114031935170.txt' '-o' '/tmp/graph16196097114031935170.bin' '-w' '/tmp/graph16196097114031935170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16196097114031935170.bin' '-l' '-1' '-v' '-w' '/tmp/graph16196097114031935170.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:05:54] [INFO ] Decomposing Gal with order
[2024-05-21 22:05:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:05:54] [INFO ] Removed a total of 1218 redundant transitions.
[2024-05-21 22:05:54] [INFO ] Flatten gal took : 40 ms
[2024-05-21 22:05:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 5 ms.
[2024-05-21 22:05:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality8627148442240074938.gal : 3 ms
[2024-05-21 22:05:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality3569489056751886807.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/CTLCardinality8627148442240074938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3569489056751886807.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 6 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.34802e+12,8.89351,287624,5887,139,316255,4779,686,2.76202e+06,109,24679,0


Converting to forward existential form...Done !
original formula: AX(AF(AX(A((((i1.i2.u10.p32==0)||(i13.i1.u96.p280==0))||(i10.u76.p213==1)) U (i10.u66.p182==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(!((E(!((i10.u66.p182==1)) U (!((((i1.i2.u10.p32==0)||(i13.i1.u96.p280==0))||(i10.u76.p21...230
Reverse transition relation is NOT exact ! Due to transitions t45, t46, t94, t123, t131, t153, t161, t184, t214, t241, t248, t251, t310, t358, t406, t619, ...869
ITS-tools command line returned an error code 139
[2024-05-21 22:14:45] [INFO ] Applying decomposition
[2024-05-21 22:14:45] [INFO ] Flatten gal took : 21 ms
[2024-05-21 22:14:45] [INFO ] Decomposing Gal with order
[2024-05-21 22:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:14:45] [INFO ] Removed a total of 1558 redundant transitions.
[2024-05-21 22:14:45] [INFO ] Flatten gal took : 62 ms
[2024-05-21 22:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 11 ms.
[2024-05-21 22:14:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality10869703097890750800.gal : 2 ms
[2024-05-21 22:14:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality8774787072611761119.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/CTLCardinality10869703097890750800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8774787072611761119.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 6 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.34802e+12,0.099836,6572,511,1026,2959,2971,245,8240,313,15099,0


Converting to forward existential form...Done !
original formula: AX(AF(AX(A((((i1.i0.i0.i0.i0.i0.u25.p32==0)||(i1.i1.u20.p280==0))||(i1.i0.i0.u16.p213==1)) U (i1.i0.i0.i0.u15.p182==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(!((E(!((i1.i0.i0.i0.u15.p182==1)) U (!((((i1.i0.i0.i0.i0.i0.u25.p32==0)||(i1.i1.u20.p280...270
Reverse transition relation is NOT exact ! Due to transitions t306, i0.u2.t251, i0.u2.t252, i0.u2.t253, i0.u2.t254, i0.u3.t248, i1.t619, i1.i0.u17.t39, i1....1486
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-21 22:18:50] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:18:50] [INFO ] Input system was already deterministic with 622 transitions.
[2024-05-21 22:18:50] [INFO ] Transformed 267 places.
[2024-05-21 22:18:50] [INFO ] Transformed 622 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 22:18:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality13432736230479476832.gal : 4 ms
[2024-05-21 22:18:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality3662468730522790481.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/CTLCardinality13432736230479476832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3662468730522790481.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 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.34802e+12,16.4213,351936,2,111295,5,1.62358e+06,6,0,1692,1.05806e+06,0


Converting to forward existential form...Done !
original formula: AX(AF(AX(A((((p32==0)||(p280==0))||(p213==1)) U (p182==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(!((E(!((p182==1)) U (!((((p32==0)||(p280==0))||(p213==1))) * !((p182==1)))) + EG(!((p182...177
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t20, t30, t34, t39, t45, t46, t73, t74, t77, t78, t80, t94, t101, t102, t105, t106,...851
Detected timeout of ITS tools.
Total runtime 3492985 ms.

BK_STOP 1716331509994

--------------------
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-06b"
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-06b, 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-171620167400305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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