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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 75K 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-03b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716321078849

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 19:51:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:51:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:51:21] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-05-21 19:51:21] [INFO ] Transformed 190 places.
[2024-05-21 19:51:21] [INFO ] Transformed 273 transitions.
[2024-05-21 19:51:21] [INFO ] Found NUPN structural information;
[2024-05-21 19:51:21] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 97 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 179 transition count 262
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 179 transition count 262
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 58 place count 179 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 176 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 176 transition count 223
Applied a total of 64 rules in 89 ms. Remains 176 /190 variables (removed 14) and now considering 223/273 (removed 50) transitions.
// Phase 1: matrix 223 rows 176 cols
[2024-05-21 19:51:22] [INFO ] Computed 8 invariants in 33 ms
[2024-05-21 19:51:22] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-21 19:51:22] [INFO ] Invariant cache hit.
[2024-05-21 19:51:22] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-21 19:51:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 19:51:26] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 39 ms to minimize.
[2024-05-21 19:51:27] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 4 ms to minimize.
[2024-05-21 19:51:27] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 4 ms to minimize.
[2024-05-21 19:51:27] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-05-21 19:51:27] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 3 ms to minimize.
[2024-05-21 19:51:27] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 3 ms to minimize.
[2024-05-21 19:51:27] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 4 ms to minimize.
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:51:29] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:51:29] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:51:29] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-21 19:51:29] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-05-21 19:51:29] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 19:51:30] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:51:30] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:51:30] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:51:30] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:51:30] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:51:30] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:51:30] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-21 19:51:31] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2024-05-21 19:51:31] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 3 ms to minimize.
[2024-05-21 19:51:31] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:51:31] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:51:31] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:51:32] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 3 ms to minimize.
[2024-05-21 19:51:32] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
[2024-05-21 19:51:32] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 12 ms to minimize.
[2024-05-21 19:51:32] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 3 ms to minimize.
[2024-05-21 19:51:32] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2024-05-21 19:51:32] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 3 ms to minimize.
[2024-05-21 19:51:33] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 3 ms to minimize.
[2024-05-21 19:51:33] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 19:51:35] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 3 ms to minimize.
[2024-05-21 19:51:35] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-05-21 19:51:36] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-05-21 19:51:36] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:51:36] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:51:36] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:51:36] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:51:37] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 19:51:38] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 19:51:39] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:51:39] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 8 (OVERLAPS) 223/399 variables, 176/235 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-05-21 19:51:44] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 3 ms to minimize.
[2024-05-21 19:51:44] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 3 ms to minimize.
[2024-05-21 19:51:44] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:51:44] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 4/239 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-05-21 19:51:50] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/240 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 240 constraints, problems are : Problem set: 2 solved, 220 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 2 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 2/176 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 56/64 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-05-21 19:51:55] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 3 ms to minimize.
[2024-05-21 19:51:55] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:51:56] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/67 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 223/399 variables, 176/243 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 220/463 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/463 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/399 variables, 0/463 constraints. Problems are: Problem set: 2 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 463 constraints, problems are : Problem set: 2 solved, 220 unsolved in 19271 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 220/222 constraints, Known Traps: 59/59 constraints]
After SMT, in 49630ms problems are : Problem set: 2 solved, 220 unsolved
Search for dead transitions found 2 dead transitions in 49678ms
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 : 176/190 places, 221/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 175 transition count 221
Applied a total of 1 rules in 10 ms. Remains 175 /176 variables (removed 1) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 175 cols
[2024-05-21 19:52:12] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 19:52:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:52:12] [INFO ] Invariant cache hit.
[2024-05-21 19:52:12] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 175/190 places, 221/273 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50911 ms. Remains : 175/190 places, 221/273 transitions.
Support contains 97 out of 175 places after structural reductions.
[2024-05-21 19:52:13] [INFO ] Flatten gal took : 60 ms
[2024-05-21 19:52:13] [INFO ] Flatten gal took : 29 ms
[2024-05-21 19:52:13] [INFO ] Input system was already deterministic with 221 transitions.
RANDOM walk for 40000 steps (57 resets) in 2816 ms. (14 steps per ms) remains 19/98 properties
BEST_FIRST walk for 4003 steps (10 resets) in 75 ms. (52 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 43 ms. (90 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 30 ms. (129 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (10 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (12 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
[2024-05-21 19:52:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 136/175 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 3 (OVERLAPS) 221/396 variables, 175/183 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-21 19:52:15] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 1/184 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 184 constraints, problems are : Problem set: 4 solved, 12 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 143/175 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/9 constraints. Problems are: Problem set: 5 solved, 11 unsolved
[2024-05-21 19:52:15] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:52:15] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/11 constraints. Problems are: Problem set: 5 solved, 11 unsolved
[2024-05-21 19:52:16] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/12 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 221/396 variables, 175/187 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 11/198 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/198 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/198 constraints. Problems are: Problem set: 5 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 198 constraints, problems are : Problem set: 5 solved, 11 unsolved in 1536 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 11/16 constraints, Known Traps: 4/4 constraints]
After SMT, in 2462ms problems are : Problem set: 5 solved, 11 unsolved
Parikh walk visited 4 properties in 7954 ms.
Support contains 22 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 133 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 3 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 399 edges and 173 vertex of which 169 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 169 transition count 155
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 130 place count 110 transition count 146
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 141 place count 106 transition count 139
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 151 place count 99 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 98 transition count 136
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 152 place count 98 transition count 128
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 168 place count 90 transition count 128
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 175 place count 83 transition count 121
Iterating global reduction 5 with 7 rules applied. Total rules applied 182 place count 83 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 182 place count 83 transition count 120
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 82 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 185 place count 81 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 81 transition count 117
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 228 place count 60 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 229 place count 60 transition count 94
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 6 with 2 rules applied. Total rules applied 231 place count 59 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 235 place count 57 transition count 118
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 239 place count 57 transition count 114
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 243 place count 53 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 53 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 52 transition count 112
Applied a total of 245 rules in 82 ms. Remains 52 /175 variables (removed 123) and now considering 112/221 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 52/175 places, 112/221 transitions.
RANDOM walk for 40000 steps (2168 resets) in 298 ms. (133 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (565 resets) in 68 ms. (579 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (439 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
// Phase 1: matrix 112 rows 52 cols
[2024-05-21 19:52:25] [INFO ] Computed 7 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 107/148 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/163 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/164 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/164 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 59 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 107/148 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/163 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/164 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/164 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 60 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 112/112 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 52 transition count 105
Reduce places removed 7 places and 0 transitions.
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 1 with 9 rules applied. Total rules applied 16 place count 45 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 44 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 44 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 42 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 24 place count 39 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 39 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 35 place count 39 transition count 82
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 45 place count 34 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 33 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 33 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 33 transition count 75
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 50 place count 33 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 52 place count 31 transition count 73
Applied a total of 52 rules in 23 ms. Remains 31 /52 variables (removed 21) and now considering 73/112 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 31/52 places, 73/112 transitions.
RANDOM walk for 40000 steps (2583 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (614 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 30109 steps, run visited all 1 properties in 74 ms. (steps per millisecond=406 )
Probabilistic random walk after 30109 steps, saw 7390 distinct states, run finished after 79 ms. (steps per millisecond=381 ) properties seen :1
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-21 19:52:25] [INFO ] Flatten gal took : 17 ms
[2024-05-21 19:52:25] [INFO ] Flatten gal took : 18 ms
[2024-05-21 19:52:25] [INFO ] Input system was already deterministic with 221 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 157 transition count 203
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 157 transition count 203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 154 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 154 transition count 200
Applied a total of 42 rules in 33 ms. Remains 154 /175 variables (removed 21) and now considering 200/221 (removed 21) transitions.
// Phase 1: matrix 200 rows 154 cols
[2024-05-21 19:52:25] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 19:52:25] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 19:52:25] [INFO ] Invariant cache hit.
[2024-05-21 19:52:26] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-21 19:52:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:52:28] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 3 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:52:29] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:52:30] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:52:30] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:52:30] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:52:30] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:52:30] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 3 ms to minimize.
[2024-05-21 19:52:31] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:52:31] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-21 19:52:31] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:52:31] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:52:31] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 3 ms to minimize.
[2024-05-21 19:52:31] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:52:31] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 3 ms to minimize.
[2024-05-21 19:52:32] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:52:32] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:52:32] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:52:34] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-21 19:52:34] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2024-05-21 19:52:34] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:52:34] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-05-21 19:52:35] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:52:36] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:52:36] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:52:38] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 200/354 variables, 154/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 201 constraints, problems are : Problem set: 0 solved, 199 unsolved in 20832 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/354 variables, 154/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 199/400 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:52:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/354 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:52:58] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 402 constraints, problems are : Problem set: 0 solved, 199 unsolved in 28225 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 41/41 constraints]
After SMT, in 49169ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 49174ms
Starting structural reductions in LTL mode, iteration 1 : 154/175 places, 200/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49505 ms. Remains : 154/175 places, 200/221 transitions.
[2024-05-21 19:53:15] [INFO ] Flatten gal took : 17 ms
[2024-05-21 19:53:15] [INFO ] Flatten gal took : 27 ms
[2024-05-21 19:53:15] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-21 19:53:15] [INFO ] Flatten gal took : 25 ms
[2024-05-21 19:53:15] [INFO ] Flatten gal took : 24 ms
[2024-05-21 19:53:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12661321041474145038.gal : 10 ms
[2024-05-21 19:53:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5928637701089227994.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12661321041474145038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5928637701089227994.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.11971e+07,2.51316,62220,2,6758,5,223526,6,0,818,301323,0


Converting to forward existential form...Done !
original formula: EF(((AX((A((p181==1) U (((p6==1)&&(p15==1))&&((p76==1)&&(p147==1)))) + (p35==1))) * E((((p6==1)&&(p15==1))&&((p49==1)&&(p147==1))) U AF((...333
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!(EX(!((!((E(!((((p6==1)&&(p15==1))&&((p76==1)&&(p147==1)))) U (!((p181==1)) * !((((p6==...1039
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
Detected timeout of ITS tools.
[2024-05-21 19:53:45] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:53:45] [INFO ] Applying decomposition
[2024-05-21 19:53:45] [INFO ] Flatten gal took : 12 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/graph10455000001939543422.txt' '-o' '/tmp/graph10455000001939543422.bin' '-w' '/tmp/graph10455000001939543422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10455000001939543422.bin' '-l' '-1' '-v' '-w' '/tmp/graph10455000001939543422.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:53:45] [INFO ] Decomposing Gal with order
[2024-05-21 19:53:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:53:45] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-21 19:53:45] [INFO ] Flatten gal took : 71 ms
[2024-05-21 19:53:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2024-05-21 19:53:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3667098823261551840.gal : 7 ms
[2024-05-21 19:53:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13701493652303854362.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/CTLFireability3667098823261551840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13701493652303854362.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.11971e+07,0.084512,5948,382,75,4250,512,379,5917,66,1492,0


Converting to forward existential form...Done !
original formula: EF(((AX((A((i14.u58.p181==1) U (((i0.u1.p6==1)&&(i0.u1.p15==1))&&((i8.i0.u25.p76==1)&&(i0.u1.p147==1)))) + (i3.u12.p35==1))) * E((((i0.u1...496
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!(EX(!((!((E(!((((i0.u1.p6==1)&&(i0.u1.p15==1))&&((i8.i0.u25.p76==1)&&(i0.u1.p147==1))))...1465
Reverse transition relation is NOT exact ! Due to transitions t148, t169, t181, t197, u47.t32, u47.t35, u47.t36, u47.t37, i0.t144, i0.t142, i4.u16.t118, i4...527
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,8.75053,294236,1,0,594380,2282,2641,832298,357,17038,779182
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 152 edges and 175 vertex of which 4 / 175 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 173 transition count 146
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 90 rules applied. Total rules applied 164 place count 100 transition count 129
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 175 place count 91 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 177 place count 89 transition count 127
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 177 place count 89 transition count 119
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 193 place count 81 transition count 119
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 200 place count 74 transition count 112
Iterating global reduction 4 with 7 rules applied. Total rules applied 207 place count 74 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 207 place count 74 transition count 111
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 209 place count 73 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 241 place count 57 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 242 place count 57 transition count 94
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 245 place count 54 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 248 place count 54 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 53 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 53 transition count 83
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 53 transition count 83
Applied a total of 253 rules in 46 ms. Remains 53 /175 variables (removed 122) and now considering 83/221 (removed 138) transitions.
// Phase 1: matrix 83 rows 53 cols
[2024-05-21 19:53:54] [INFO ] Computed 7 invariants in 6 ms
[2024-05-21 19:53:54] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 19:53:54] [INFO ] Invariant cache hit.
[2024-05-21 19:53:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:53:54] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 151 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/175 places, 83/221 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 202 ms. Remains : 52/175 places, 83/221 transitions.
[2024-05-21 19:53:54] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:53:54] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:53:54] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-21 19:53:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:53:54] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:53:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14760599791838167982.gal : 2 ms
[2024-05-21 19:53:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1878640024030046206.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/CTLFireability14760599791838167982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1878640024030046206.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,120470,0.18252,8972,2,1611,5,22718,6,0,289,23393,0


Converting to forward existential form...Done !
original formula: EG(A(!((((E((p158==1) U (p18==1)) + (p75==1)) + (((((p6==1)&&(p9==1))&&((p45==1)&&(p147==1)))&&(((p6==1)&&(p15==1))&&((p107==1)&&(p147==1...267
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG(!((E(!((p151==1)) U (!((((p6==1)&&(p14==1))&&((p83==1)&&(p147==1)))) * !((p151==1)))) + E...612
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t7, t13, t15, t18, t20, t23, t25, t27, t30, t31, t35, t37, t40, t41, t44, t46...385
Using saturation style SCC detection
(forward)formula 0,1,6.69541,146804,1,0,759,872049,205,349,2650,779741,790
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 153 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 153 transition count 199
Applied a total of 44 rules in 10 ms. Remains 153 /175 variables (removed 22) and now considering 199/221 (removed 22) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-05-21 19:54:01] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:54:01] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 19:54:01] [INFO ] Invariant cache hit.
[2024-05-21 19:54:02] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 19:54:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:54:03] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 4 ms to minimize.
[2024-05-21 19:54:03] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-21 19:54:04] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-21 19:54:04] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-21 19:54:04] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-05-21 19:54:04] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:54:04] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-05-21 19:54:04] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:54:05] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:54:05] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-21 19:54:05] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 3 ms to minimize.
[2024-05-21 19:54:05] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-21 19:54:05] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2024-05-21 19:54:05] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 3 ms to minimize.
[2024-05-21 19:54:05] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 3 ms to minimize.
[2024-05-21 19:54:06] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:54:06] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 3 ms to minimize.
[2024-05-21 19:54:06] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2024-05-21 19:54:06] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:54:06] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:54:07] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:54:07] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:54:07] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:54:07] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:54:07] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-21 19:54:07] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-21 19:54:07] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:54:07] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:54:08] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:54:08] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:54:08] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:54:08] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:54:09] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:54:10] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:54:10] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-21 19:54:10] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 6 ms to minimize.
[2024-05-21 19:54:11] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:54:14] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 199 constraints, problems are : Problem set: 0 solved, 198 unsolved in 19511 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:54:23] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:54:25] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:54:28] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 19009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 38633ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 38639ms
Starting structural reductions in LTL mode, iteration 1 : 153/175 places, 199/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38950 ms. Remains : 153/175 places, 199/221 transitions.
[2024-05-21 19:54:40] [INFO ] Flatten gal took : 20 ms
[2024-05-21 19:54:40] [INFO ] Flatten gal took : 16 ms
[2024-05-21 19:54:40] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-21 19:54:40] [INFO ] Flatten gal took : 18 ms
[2024-05-21 19:54:40] [INFO ] Flatten gal took : 16 ms
[2024-05-21 19:54:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14835649212898052268.gal : 5 ms
[2024-05-21 19:54:40] [INFO ] Time to serialize properties into /tmp/CTLFireability18423595446851998469.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/CTLFireability14835649212898052268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18423595446851998469.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.9176e+07,1.61501,42148,2,6282,5,151031,6,0,813,196128,0


Converting to forward existential form...Done !
original formula: (EF(EX((((p6==1)&&(p9==1))&&((p114==1)&&(p147==1))))) * AF((((p6==1)&&(p9==1))&&((p33==1)&&(p147==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX((((p6==1)&&(p9==1))&&((p114==1)&&(p147==1)))))))] = FALSE * [FwdG(Init,!((((p6==1)&&(p9=...195
Hit Full ! (commute/partial/dont) 149/0/50
(forward)formula 0,0,18.6604,465332,1,0,179,2.28545e+06,20,4,4449,2.52334e+06,176
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 153 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 153 transition count 199
Applied a total of 44 rules in 10 ms. Remains 153 /175 variables (removed 22) and now considering 199/221 (removed 22) transitions.
[2024-05-21 19:54:59] [INFO ] Invariant cache hit.
[2024-05-21 19:54:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 19:54:59] [INFO ] Invariant cache hit.
[2024-05-21 19:54:59] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 19:54:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:02] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-21 19:55:02] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-05-21 19:55:02] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-05-21 19:55:02] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-05-21 19:55:02] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:55:02] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:55:03] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2024-05-21 19:55:03] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:55:03] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:55:03] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:55:03] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:55:04] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-05-21 19:55:04] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-05-21 19:55:04] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-05-21 19:55:04] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 3 ms to minimize.
[2024-05-21 19:55:04] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:55:04] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:55:05] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:55:05] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-05-21 19:55:05] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:05] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:55:06] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 3 ms to minimize.
[2024-05-21 19:55:06] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-05-21 19:55:06] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-21 19:55:06] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:55:06] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 3 ms to minimize.
[2024-05-21 19:55:06] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:55:06] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:55:06] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:55:07] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:55:07] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 3 ms to minimize.
[2024-05-21 19:55:07] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:09] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:55:09] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:55:09] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:55:10] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:55:10] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:14] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 199 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22696 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:24] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:26] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:29] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 20867 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 43625ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 43628ms
Starting structural reductions in LTL mode, iteration 1 : 153/175 places, 199/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43863 ms. Remains : 153/175 places, 199/221 transitions.
[2024-05-21 19:55:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:55:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:55:43] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-21 19:55:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:55:43] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:55:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15882115182150563009.gal : 8 ms
[2024-05-21 19:55:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10289289366885642906.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/CTLFireability15882115182150563009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10289289366885642906.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.9176e+07,1.81702,42164,2,6282,5,151031,6,0,813,196128,0


Converting to forward existential form...Done !
original formula: AF((!(E(!(E((p16==1) U (((p6==1)&&(p9==1))&&((p83==1)&&(p147==1))))) U !(E((((p6==1)&&(p15==1))&&((p95==1)&&(p147==1))) U (p37==1))))) * ...287
=> equivalent forward existential formula: [FwdG(Init,!((!(E(!(E((p16==1) U (((p6==1)&&(p9==1))&&((p83==1)&&(p147==1))))) U !(E((((p6==1)&&(p15==1))&&((p95...362
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-21 19:56:13] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:56:13] [INFO ] Applying decomposition
[2024-05-21 19:56:13] [INFO ] Flatten gal took : 7 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/graph16256831644012576616.txt' '-o' '/tmp/graph16256831644012576616.bin' '-w' '/tmp/graph16256831644012576616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16256831644012576616.bin' '-l' '-1' '-v' '-w' '/tmp/graph16256831644012576616.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:56:13] [INFO ] Decomposing Gal with order
[2024-05-21 19:56:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:56:13] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-21 19:56:13] [INFO ] Flatten gal took : 22 ms
[2024-05-21 19:56:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2024-05-21 19:56:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4260921641815465640.gal : 4 ms
[2024-05-21 19:56:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7378884956223234643.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/CTLFireability4260921641815465640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7378884956223234643.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.9176e+07,0.056219,5100,368,80,2491,493,359,2979,73,1148,0


Converting to forward existential form...Done !
original formula: AF((!(E(!(E((i12.u4.p16==1) U (((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i5.u24.p83==1)&&(i11.u1.p147==1))))) U !(E((((i11.u1.p6==1)&&(i11.u1.p...425
=> equivalent forward existential formula: [FwdG(Init,!((!(E(!(E((i12.u4.p16==1) U (((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i5.u24.p83==1)&&(i11.u1.p147==1))))...500
Reverse transition relation is NOT exact ! Due to transitions t147, t168, t180, t196, i1.t134, i1.u10.t114, i1.u17.t115, i3.u15.t118, i3.u15.t119, i3.u15.t...513
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
(forward)formula 0,0,3.07068,108060,1,0,247295,1758,2564,281486,405,8280,306290
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 164 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 172 transition count 140
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 97 rules applied. Total rules applied 176 place count 94 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 187 place count 83 transition count 121
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 187 place count 83 transition count 116
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 197 place count 78 transition count 116
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 207 place count 68 transition count 106
Iterating global reduction 3 with 10 rules applied. Total rules applied 217 place count 68 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 217 place count 68 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 221 place count 66 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 224 place count 63 transition count 95
Iterating global reduction 3 with 3 rules applied. Total rules applied 227 place count 63 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 233 place count 63 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 236 place count 60 transition count 89
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 274 place count 41 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 41 transition count 69
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 279 place count 37 transition count 56
Iterating global reduction 6 with 4 rules applied. Total rules applied 283 place count 37 transition count 56
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 6 with 2 rules applied. Total rules applied 285 place count 36 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 36 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 34 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 289 place count 33 transition count 52
Applied a total of 289 rules in 30 ms. Remains 33 /175 variables (removed 142) and now considering 52/221 (removed 169) transitions.
// Phase 1: matrix 52 rows 33 cols
[2024-05-21 19:56:16] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:56:16] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:56:16] [INFO ] Invariant cache hit.
[2024-05-21 19:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:56:16] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [27, 32]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 108 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/175 places, 52/221 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 31 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 29 transition count 50
Applied a total of 4 rules in 3 ms. Remains 29 /31 variables (removed 2) and now considering 50/52 (removed 2) transitions.
// Phase 1: matrix 50 rows 29 cols
[2024-05-21 19:56:16] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:56:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 19:56:16] [INFO ] Invariant cache hit.
[2024-05-21 19:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:56:17] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 29/175 places, 50/221 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 245 ms. Remains : 29/175 places, 50/221 transitions.
[2024-05-21 19:56:17] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:56:17] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:56:17] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 48 steps (2 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 19:56:17] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:56:17] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:56:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13075885392006638103.gal : 1 ms
[2024-05-21 19:56:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5690616767012693161.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13075885392006638103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5690616767012693161.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 205
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 205
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 156 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 156 transition count 202
Applied a total of 38 rules in 9 ms. Remains 156 /175 variables (removed 19) and now considering 202/221 (removed 19) transitions.
// Phase 1: matrix 202 rows 156 cols
[2024-05-21 19:56:17] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 19:56:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 19:56:17] [INFO ] Invariant cache hit.
[2024-05-21 19:56:17] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 19:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:56:19] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-21 19:56:19] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-05-21 19:56:19] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2024-05-21 19:56:19] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-05-21 19:56:19] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:56:20] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-21 19:56:20] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 3 ms to minimize.
[2024-05-21 19:56:20] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2024-05-21 19:56:20] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 3 ms to minimize.
[2024-05-21 19:56:20] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:56:20] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-05-21 19:56:20] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 3 ms to minimize.
[2024-05-21 19:56:21] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:56:21] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-21 19:56:21] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:56:21] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-21 19:56:21] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-21 19:56:21] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:56:22] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 3 ms to minimize.
[2024-05-21 19:56:22] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:56:22] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:56:22] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
[2024-05-21 19:56:22] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 3 ms to minimize.
[2024-05-21 19:56:22] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:56:22] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:56:23] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
[2024-05-21 19:56:23] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 3 ms to minimize.
[2024-05-21 19:56:23] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:56:23] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2024-05-21 19:56:24] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 3 ms to minimize.
[2024-05-21 19:56:24] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:56:25] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:56:25] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:56:26] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:56:26] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:56:27] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:56:28] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:56:28] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:56:29] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:56:29] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 202/358 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 204 constraints, problems are : Problem set: 0 solved, 201 unsolved in 21645 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/358 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 201/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:56:48] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/358 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:56:51] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 407 constraints, problems are : Problem set: 0 solved, 201 unsolved in 26428 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 42/42 constraints]
After SMT, in 48180ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 48184ms
Starting structural reductions in LTL mode, iteration 1 : 156/175 places, 202/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48424 ms. Remains : 156/175 places, 202/221 transitions.
[2024-05-21 19:57:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:57:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:57:05] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-21 19:57:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:57:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:57:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3005365480389306159.gal : 2 ms
[2024-05-21 19:57:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17414765586448930978.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/CTLFireability3005365480389306159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17414765586448930978.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.23454e+07,1.36638,35972,2,6221,5,125849,6,0,828,157643,0


Converting to forward existential form...Done !
original formula: A(EF((p59==1)) U AF(((!(EF((((p6==1)&&(p9==1))&&((p80==1)&&(p147==1))))) + EG(A((p11==1) U (p166==1)))) + ((!(A((p121==1) U (p92==1))) * ...315
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((!(E(TRUE U (((p6==1)&&(p9==1))&&((p80==1)&&(p147==1))))) + EG(!((E(!((p166==1)) U (!((...1409
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t37, t38, t52, t64, t65, t68, t70, t71, t72, t86, t92, t93, t96...357
Detected timeout of ITS tools.
[2024-05-21 19:57:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:57:35] [INFO ] Applying decomposition
[2024-05-21 19:57:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2061774675415157830.txt' '-o' '/tmp/graph2061774675415157830.bin' '-w' '/tmp/graph2061774675415157830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2061774675415157830.bin' '-l' '-1' '-v' '-w' '/tmp/graph2061774675415157830.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:57:35] [INFO ] Decomposing Gal with order
[2024-05-21 19:57:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:57:35] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-21 19:57:35] [INFO ] Flatten gal took : 17 ms
[2024-05-21 19:57:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2024-05-21 19:57:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13186768006440557274.gal : 3 ms
[2024-05-21 19:57:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14490702261239491163.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/CTLFireability13186768006440557274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14490702261239491163.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.23454e+07,0.097719,5444,466,75,3108,366,443,4399,73,1078,0


Converting to forward existential form...Done !
original formula: A(EF((i5.u19.p59==1)) U AF(((!(EF((((i0.u2.p6==1)&&(i0.u2.p9==1))&&((i5.u24.p80==1)&&(i0.u2.p147==1))))) + EG(A((i0.u3.p11==1) U (i13.u49...474
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((!(E(TRUE U (((i0.u2.p6==1)&&(i0.u2.p9==1))&&((i5.u24.p80==1)&&(i0.u2.p147==1))))) + EG...2004
Reverse transition relation is NOT exact ! Due to transitions t146, t171, t183, i0.t144, i3.i0.u15.t121, i3.i0.u15.t124, i3.i0.u16.t122, i3.i1.t137, i3.i1....568
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
Using saturation style SCC detection
Using 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 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 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,5.05052,158036,1,0,356419,1580,2892,420460,396,7748,497234
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 155 edges and 175 vertex of which 4 / 175 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 172 transition count 144
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 92 rules applied. Total rules applied 167 place count 98 transition count 126
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 179 place count 88 transition count 124
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 183 place count 86 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 184 place count 85 transition count 122
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 184 place count 85 transition count 114
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 200 place count 77 transition count 114
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 209 place count 68 transition count 105
Iterating global reduction 5 with 9 rules applied. Total rules applied 218 place count 68 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 218 place count 68 transition count 104
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 220 place count 67 transition count 104
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 223 place count 64 transition count 95
Iterating global reduction 5 with 3 rules applied. Total rules applied 226 place count 64 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 231 place count 64 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 233 place count 62 transition count 90
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 271 place count 43 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 272 place count 43 transition count 70
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 274 place count 41 transition count 65
Iterating global reduction 8 with 2 rules applied. Total rules applied 276 place count 41 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 278 place count 40 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 279 place count 40 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 281 place count 38 transition count 61
Applied a total of 281 rules in 29 ms. Remains 38 /175 variables (removed 137) and now considering 61/221 (removed 160) transitions.
// Phase 1: matrix 61 rows 38 cols
[2024-05-21 19:57:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:57:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:57:40] [INFO ] Invariant cache hit.
[2024-05-21 19:57:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:57:40] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [32, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 153 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 36/175 places, 61/221 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 36 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 35 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 35 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 34 transition count 59
Applied a total of 4 rules in 7 ms. Remains 34 /36 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 34 cols
[2024-05-21 19:57:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:57:41] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:57:41] [INFO ] Invariant cache hit.
[2024-05-21 19:57:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:57:41] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/175 places, 59/221 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 333 ms. Remains : 34/175 places, 59/221 transitions.
[2024-05-21 19:57:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:57:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:57:41] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-21 19:57:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:57:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:57:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3943390003376797069.gal : 2 ms
[2024-05-21 19:57:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16142992445867801837.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/CTLFireability3943390003376797069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16142992445867801837.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,18334,0.184568,6656,2,557,5,11902,6,0,193,13970,0


Converting to forward existential form...Done !
original formula: AG((EF((((p6==0)||(p14==0))||((p114==0)||(p147==0)))) * ((p77==0) + AF(!(E((p57==1) U (((p6==1)&&(p14==1))&&((p80==1)&&(p147==1)))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((p6==0)||(p14==0))||((p114==0)||(p147==0))))))] = FALSE * [FwdG((FwdU(Init,TRU...248
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t8, t10, t12, t13, t15, t30, t31, t57, Intersection with reachable a...223
(forward)formula 0,1,0.453299,9824,1,0,138,28915,151,65,1866,27853,142
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 204
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 155 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 155 transition count 201
Applied a total of 40 rules in 11 ms. Remains 155 /175 variables (removed 20) and now considering 201/221 (removed 20) transitions.
// Phase 1: matrix 201 rows 155 cols
[2024-05-21 19:57:41] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:57:41] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 19:57:41] [INFO ] Invariant cache hit.
[2024-05-21 19:57:41] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-21 19:57:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 19:57:44] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-05-21 19:57:44] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-05-21 19:57:44] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-21 19:57:44] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2024-05-21 19:57:44] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-21 19:57:44] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-21 19:57:45] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-21 19:57:45] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:57:45] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:57:45] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:57:45] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
[2024-05-21 19:57:45] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:57:46] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:57:46] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:57:46] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:57:46] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:57:46] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:57:46] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:57:46] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 3 ms to minimize.
[2024-05-21 19:57:46] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 19:57:47] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:57:47] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-21 19:57:47] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:57:47] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 3 ms to minimize.
[2024-05-21 19:57:47] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:57:47] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:57:48] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 3 ms to minimize.
[2024-05-21 19:57:48] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:57:48] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:57:48] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 3 ms to minimize.
[2024-05-21 19:57:48] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:57:48] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:57:49] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:57:49] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:57:49] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:57:49] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:57:49] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 3 ms to minimize.
[2024-05-21 19:57:49] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 19:57:51] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:57:52] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:57:52] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:57:52] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 19:57:53] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 3 ms to minimize.
[2024-05-21 19:57:53] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 3 ms to minimize.
[2024-05-21 19:57:53] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-21 19:57:53] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-05-21 19:57:53] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:57:54] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 201/356 variables, 155/211 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/356 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 211 constraints, problems are : Problem set: 0 solved, 200 unsolved in 21839 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 19:58:05] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/356 variables, 155/212 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 200/412 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 412 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12507 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 49/49 constraints]
After SMT, in 34431ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 34436ms
Starting structural reductions in LTL mode, iteration 1 : 155/175 places, 201/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34750 ms. Remains : 155/175 places, 201/221 transitions.
[2024-05-21 19:58:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:58:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:58:16] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-21 19:58:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:58:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:58:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5286653485503655049.gal : 1 ms
[2024-05-21 19:58:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11241450211909468977.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/CTLFireability5286653485503655049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11241450211909468977.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.23454e+07,2.41905,47704,2,6432,5,169301,6,0,823,223615,0


Converting to forward existential form...Done !
original formula: (AF(((((A(AG((p143==1)) U EX((p59==1))) + EG((p43==1))) + ((p182==0)||(p97==0))) + (((p113==1)&&(p138==1))&&((p39==1)||(((p6==1)&&(p14==1...215
=> equivalent forward existential formula: ([FwdG(Init,!(((((!((E(!(EX((p59==1))) U (!(!(E(TRUE U !((p143==1))))) * !(EX((p59==1))))) + EG(!(EX((p59==1))))...347
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t69, t70, t71, t85, t91, t92, t95, t96...358
Detected timeout of ITS tools.
[2024-05-21 19:58:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:58:46] [INFO ] Applying decomposition
[2024-05-21 19:58:46] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7075390127246877331.txt' '-o' '/tmp/graph7075390127246877331.bin' '-w' '/tmp/graph7075390127246877331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7075390127246877331.bin' '-l' '-1' '-v' '-w' '/tmp/graph7075390127246877331.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:58:46] [INFO ] Decomposing Gal with order
[2024-05-21 19:58:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:58:46] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-21 19:58:46] [INFO ] Flatten gal took : 17 ms
[2024-05-21 19:58:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-21 19:58:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8874254584217093729.gal : 3 ms
[2024-05-21 19:58:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3791491959949867171.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/CTLFireability8874254584217093729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3791491959949867171.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,5.23454e+07,0.065607,5444,390,73,3060,586,382,3915,69,1148,0


Converting to forward existential form...Done !
original formula: (AF(((((A(AG((i12.u47.p143==1)) U EX((i7.i1.u19.p59==1))) + EG((i4.i0.u9.p43==1))) + ((i14.i1.u59.p182==0)||(i8.u33.p97==0))) + (((i10.u3...330
=> equivalent forward existential formula: ([FwdG(Init,!(((((!((E(!(EX((i7.i1.u19.p59==1))) U (!(!(E(TRUE U !((i12.u47.p143==1))))) * !(EX((i7.i1.u19.p59==...482
Reverse transition relation is NOT exact ! Due to transitions t169, t181, t198, i0.t145, i0.t143, i3.u15.t120, i3.u15.t123, i3.u16.t121, i4.i1.t136, i4.i1....557
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,4.63425,157244,1,0,334839,1901,2603,444446,369,10789,419513
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 157 transition count 203
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 157 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 156 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 156 transition count 202
Applied a total of 38 rules in 9 ms. Remains 156 /175 variables (removed 19) and now considering 202/221 (removed 19) transitions.
// Phase 1: matrix 202 rows 156 cols
[2024-05-21 19:58:51] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 19:58:51] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 19:58:51] [INFO ] Invariant cache hit.
[2024-05-21 19:58:51] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 19:58:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:53] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:58:54] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:58:55] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-21 19:58:55] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-05-21 19:58:55] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-21 19:58:55] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2024-05-21 19:58:55] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:58:55] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2024-05-21 19:58:55] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:58:56] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:58:56] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:58:56] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:56] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:58:56] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:58:56] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:58:56] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:58:57] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:58:57] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-21 19:58:57] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:58:57] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:58:57] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-05-21 19:58:58] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:58:58] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:58:58] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:59:00] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-05-21 19:59:00] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:59:00] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:59:01] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:59:01] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:59:01] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-05-21 19:59:01] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:59:01] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:59:02] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:59:02] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:59:03] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:59:04] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:59:04] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 202/358 variables, 156/209 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:59:12] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:59:12] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/358 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:59:17] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/358 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/358 variables, and 212 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:59:23] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/358 variables, 156/213 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 201/414 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/358 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 414 constraints, problems are : Problem set: 0 solved, 201 unsolved in 17303 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 49/49 constraints]
After SMT, in 47387ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 47390ms
Starting structural reductions in LTL mode, iteration 1 : 156/175 places, 202/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47622 ms. Remains : 156/175 places, 202/221 transitions.
[2024-05-21 19:59:38] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:59:38] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:59:38] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-21 19:59:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:59:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:59:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12560675227617393695.gal : 3 ms
[2024-05-21 19:59:38] [INFO ] Time to serialize properties into /tmp/CTLFireability5275838225706254115.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/CTLFireability12560675227617393695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5275838225706254115.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.27073e+07,1.5348,41612,2,6205,5,148895,6,0,828,194963,0


Converting to forward existential form...Done !
original formula: E(((p170==1) + AF(((p154!=1)&&(p58!=1)))) U (AX((p80==1)) * !(AG((p155==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,((p170==1) + !(EG(!(((p154!=1)&&(p58!=1))))))) * !(EX(!((p80==1))))),TRUE) * !((p155==1)))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95, t97...377
Detected timeout of ITS tools.
[2024-05-21 20:00:08] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:00:08] [INFO ] Applying decomposition
[2024-05-21 20:00:08] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8901645227152590634.txt' '-o' '/tmp/graph8901645227152590634.bin' '-w' '/tmp/graph8901645227152590634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8901645227152590634.bin' '-l' '-1' '-v' '-w' '/tmp/graph8901645227152590634.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:00:09] [INFO ] Decomposing Gal with order
[2024-05-21 20:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:00:09] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-21 20:00:09] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-21 20:00:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7202166006447203128.gal : 15 ms
[2024-05-21 20:00:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15039076972794881205.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/CTLFireability7202166006447203128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15039076972794881205.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.27073e+07,0.065056,5372,404,78,3125,476,364,4389,71,1324,0


Converting to forward existential form...Done !
original formula: E(((i14.i0.u52.p170==1) + AF(((i12.u47.p154!=1)&&(i4.u18.p58!=1)))) U (AX((i6.u26.p80==1)) * !(AG((i12.u47.p155==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,((i14.i0.u52.p170==1) + !(EG(!(((i12.u47.p154!=1)&&(i4.u18.p58!=1))))))) * !(EX(!((i6.u26.p80=...202
Reverse transition relation is NOT exact ! Due to transitions t151, t169, t181, t199, i0.t145, i0.t143, i3.u14.t120, i3.u14.t123, i3.u15.t121, i4.t136, i4....531
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 5
Fast SCC detection found a local 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
(forward)formula 0,1,1.75086,62396,1,0,137581,1336,2345,153910,375,5192,202705
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 161 transition count 207
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 161 transition count 207
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 159 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 159 transition count 205
Applied a total of 32 rules in 4 ms. Remains 159 /175 variables (removed 16) and now considering 205/221 (removed 16) transitions.
// Phase 1: matrix 205 rows 159 cols
[2024-05-21 20:00:10] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 20:00:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 20:00:10] [INFO ] Invariant cache hit.
[2024-05-21 20:00:11] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-21 20:00:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 20:00:13] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:00:13] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:00:13] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 2 ms to minimize.
[2024-05-21 20:00:13] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 2 ms to minimize.
[2024-05-21 20:00:13] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:00:14] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:00:14] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:00:14] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:00:14] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 3 ms to minimize.
[2024-05-21 20:00:14] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-05-21 20:00:14] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:00:15] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:00:15] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 3 ms to minimize.
[2024-05-21 20:00:15] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:00:15] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:00:15] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-21 20:00:16] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:00:16] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:00:16] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 20:00:16] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:00:17] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:00:17] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-21 20:00:17] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 3 ms to minimize.
[2024-05-21 20:00:17] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-21 20:00:17] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:00:17] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-21 20:00:18] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:00:18] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 4 ms to minimize.
[2024-05-21 20:00:18] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:00:18] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:00:18] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-05-21 20:00:19] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:00:19] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:00:19] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/364 variables, 159/201 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 20:00:24] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 20:00:27] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 20:00:32] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/364 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (OVERLAPS) 0/364 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 204 constraints, problems are : Problem set: 0 solved, 204 unsolved in 28448 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 20:00:41] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:00:41] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/364 variables, 159/206 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 204/410 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 20:00:45] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 20:00:50] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/364 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 412 constraints, problems are : Problem set: 0 solved, 204 unsolved in 25936 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 41/41 constraints]
After SMT, in 54436ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 54438ms
Starting structural reductions in LTL mode, iteration 1 : 159/175 places, 205/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54682 ms. Remains : 159/175 places, 205/221 transitions.
[2024-05-21 20:01:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:01:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:01:05] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-21 20:01:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:01:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7728439223759634543.gal : 2 ms
[2024-05-21 20:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8162220841889926859.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/CTLFireability7728439223759634543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8162220841889926859.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.60568e+07,1.75121,49764,2,6587,5,171718,6,0,843,231991,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * E((EF(AX(((p70==1)&&(p7==1)))) + (((p106!=1) * !(AX((p120==1)))) * ((p65==1)&&(p182==1)))) U AF(((((!((((p6==1)&&(p15==1))&&(...285
=> equivalent forward existential formula: [(FwdU((Init * EX(TRUE)),(E(TRUE U !(EX(!(((p70==1)&&(p7==1)))))) + (((p106!=1) * !(!(EX(!((p120==1)))))) * ((p6...355
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t64, t65, t68, t69, t71, t74, t85, t86, t92, t93, t96...393
Detected timeout of ITS tools.
[2024-05-21 20:01:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:01:35] [INFO ] Applying decomposition
[2024-05-21 20:01:35] [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/graph7740348942532394254.txt' '-o' '/tmp/graph7740348942532394254.bin' '-w' '/tmp/graph7740348942532394254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7740348942532394254.bin' '-l' '-1' '-v' '-w' '/tmp/graph7740348942532394254.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:01:35] [INFO ] Decomposing Gal with order
[2024-05-21 20:01:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:01:35] [INFO ] Removed a total of 116 redundant transitions.
[2024-05-21 20:01:35] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:01:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2024-05-21 20:01:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8052127165467823234.gal : 6 ms
[2024-05-21 20:01:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18178127467984375363.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/CTLFireability8052127165467823234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18178127467984375363.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.60568e+07,0.075362,5912,399,87,3578,538,389,7534,73,2879,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * E((EF(AX(((i3.i1.u18.p70==1)&&(i0.u2.p7==1)))) + (((i8.i1.u37.p106!=1) * !(AX((i8.i0.u27.p120==1)))) * ((i3.i1.u19.p65==1)&&(...439
=> equivalent forward existential formula: [(FwdU((Init * EX(TRUE)),(E(TRUE U !(EX(!(((i3.i1.u18.p70==1)&&(i0.u2.p7==1)))))) + (((i8.i1.u37.p106!=1) * !(!(...509
Reverse transition relation is NOT exact ! Due to transitions t149, t156, t174, t186, t202, i0.u45.t32, i0.u45.t35, i0.u45.t36, i0.u45.t37, i2.t139, i2.u9....562
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
(forward)formula 0,1,4.92426,157712,1,0,341619,2603,2538,424409,394,25942,406607
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 204
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 155 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 155 transition count 201
Applied a total of 40 rules in 4 ms. Remains 155 /175 variables (removed 20) and now considering 201/221 (removed 20) transitions.
// Phase 1: matrix 201 rows 155 cols
[2024-05-21 20:01:40] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 20:01:40] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 20:01:40] [INFO ] Invariant cache hit.
[2024-05-21 20:01:40] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-21 20:01:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:01:43] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:01:43] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:01:43] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:01:43] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:01:43] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:01:43] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:01:44] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:01:44] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-05-21 20:01:44] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:01:44] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 3 ms to minimize.
[2024-05-21 20:01:44] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:01:44] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:01:45] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:01:45] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:01:45] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-21 20:01:45] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-05-21 20:01:45] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:01:45] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:01:45] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:01:46] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:01:46] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
[2024-05-21 20:01:46] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-05-21 20:01:46] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 3 ms to minimize.
[2024-05-21 20:01:46] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 3 ms to minimize.
[2024-05-21 20:01:47] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:01:47] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:01:47] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:01:47] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:01:48] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:01:48] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-05-21 20:01:48] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-21 20:01:48] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:01:48] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:01:50] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:01:50] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:01:50] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:01:51] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:01:51] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:01:51] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:01:52] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:01:52] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:01:52] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2024-05-21 20:01:53] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:01:54] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:01:54] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 201/356 variables, 155/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/356 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 208 constraints, problems are : Problem set: 0 solved, 200 unsolved in 23655 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 200/408 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:02:14] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/356 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/356 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 409 constraints, problems are : Problem set: 0 solved, 200 unsolved in 21737 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 46/46 constraints]
After SMT, in 45444ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 45446ms
Starting structural reductions in LTL mode, iteration 1 : 155/175 places, 201/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45693 ms. Remains : 155/175 places, 201/221 transitions.
[2024-05-21 20:02:26] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:02:26] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:02:26] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-21 20:02:26] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:02:26] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:02:26] [INFO ] Time to serialize gal into /tmp/CTLFireability18151022578611087918.gal : 2 ms
[2024-05-21 20:02:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15529666431162111389.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/CTLFireability18151022578611087918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15529666431162111389.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,5.3033e+07,1.58753,43012,2,6292,5,155069,6,0,823,202144,0


Converting to forward existential form...Done !
original formula: AG(EX((EF((p157==0)) * ((EX((p42==0)) * AG((((p6==0)||(p9==0))||((p111==0)||(p147==0))))) + (!(E((((p6==1)&&(p15==1))&&((p80==1)&&(p147==...205
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((E(TRUE U (p157==0)) * ((EX((p42==0)) * !(E(TRUE U !((((p6==0)||(p9==0))||((p111==0)||(...283
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t36, t37, t38, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95, t97...371
(forward)formula 0,0,15.836,390048,1,0,475,2.51164e+06,433,259,5735,1.68184e+06,576
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 153 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 153 transition count 199
Applied a total of 44 rules in 4 ms. Remains 153 /175 variables (removed 22) and now considering 199/221 (removed 22) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-05-21 20:02:42] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 20:02:42] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 20:02:42] [INFO ] Invariant cache hit.
[2024-05-21 20:02:42] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 20:02:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 2 ms to minimize.
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:02:46] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-05-21 20:02:46] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 3 ms to minimize.
[2024-05-21 20:02:46] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:02:46] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:02:46] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:02:46] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:02:46] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:02:47] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:02:47] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:02:47] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 3 ms to minimize.
[2024-05-21 20:02:47] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 3 ms to minimize.
[2024-05-21 20:02:47] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:02:48] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:02:48] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:02:48] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:02:48] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-21 20:02:48] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:02:48] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:02:49] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:02:49] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-21 20:02:49] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-21 20:02:49] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:02:49] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:02:49] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-21 20:02:50] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:02:50] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:02:52] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:02:52] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:02:52] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-21 20:02:53] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-05-21 20:02:53] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:02:57] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 199 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22718 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:03:07] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:03:09] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:03:12] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 18635 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 41404ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 41406ms
Starting structural reductions in LTL mode, iteration 1 : 153/175 places, 199/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41630 ms. Remains : 153/175 places, 199/221 transitions.
[2024-05-21 20:03:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:03:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:03:23] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-21 20:03:24] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:03:24] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:03:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1035725006914975533.gal : 3 ms
[2024-05-21 20:03:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14071658496274650703.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/CTLFireability1035725006914975533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14071658496274650703.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,4.9176e+07,1.77753,42144,2,6282,5,151031,6,0,813,196128,0


Converting to forward existential form...Done !
original formula: EF(AX(AG((p151==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((p151==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
(forward)formula 0,1,6.15803,131092,1,0,340,635932,420,187,5669,482611,410
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 144 edges and 175 vertex of which 4 / 175 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 172 transition count 150
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 82 rules applied. Total rules applied 151 place count 104 transition count 136
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 159 place count 97 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 96 transition count 135
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 160 place count 96 transition count 122
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 186 place count 83 transition count 122
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 195 place count 74 transition count 113
Iterating global reduction 4 with 9 rules applied. Total rules applied 204 place count 74 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 72 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 72 transition count 107
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 4 with 2 rules applied. Total rules applied 210 place count 72 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 211 place count 71 transition count 105
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 243 place count 55 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 55 transition count 88
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 247 place count 52 transition count 79
Iterating global reduction 7 with 3 rules applied. Total rules applied 250 place count 52 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 252 place count 51 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 254 place count 51 transition count 76
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 7 with 1 rules applied. Total rules applied 255 place count 51 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 256 place count 50 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 258 place count 48 transition count 73
Applied a total of 258 rules in 27 ms. Remains 48 /175 variables (removed 127) and now considering 73/221 (removed 148) transitions.
// Phase 1: matrix 73 rows 48 cols
[2024-05-21 20:03:30] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 20:03:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:03:30] [INFO ] Invariant cache hit.
[2024-05-21 20:03:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:03:30] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [42, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 106 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/175 places, 73/221 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 46 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 45 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 44 transition count 71
Applied a total of 4 rules in 5 ms. Remains 44 /46 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 44 cols
[2024-05-21 20:03:30] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 20:03:30] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:03:30] [INFO ] Invariant cache hit.
[2024-05-21 20:03:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:03:30] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/175 places, 71/221 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 242 ms. Remains : 44/175 places, 71/221 transitions.
[2024-05-21 20:03:30] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:03:30] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:03:30] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-21 20:03:30] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:03:30] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:03:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16380358466514394752.gal : 1 ms
[2024-05-21 20:03:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17759865506246800064.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/CTLFireability16380358466514394752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17759865506246800064.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,68508,0.164029,8312,2,1033,5,20365,6,0,246,24461,0


Converting to forward existential form...Done !
original formula: EF((((p35==1) * AF((p99==0))) * (EG((p31==1)) + A(AF((((p6==1)&&(p14==1))&&((p114==1)&&(p147==1)))) U (((p56==1)&&(p87==1))&&((p118==1)&&...170
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * ((p35==1) * !(EG(!((p99==0)))))),(p31==1))] != FALSE + [(((FwdU(Init,TRUE) * ((p35==1)...423
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t7, t12, t14, t16, t18, t25, t40, t41, t42, t43, t57, t58, t59, t60, t61,...294
(forward)formula 0,0,6.06624,132828,1,0,1054,850623,184,469,2141,742118,1203
FORMULA AutonomousCar-PT-03b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 153 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 153 transition count 199
Applied a total of 44 rules in 6 ms. Remains 153 /175 variables (removed 22) and now considering 199/221 (removed 22) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-05-21 20:03:36] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 20:03:36] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 20:03:36] [INFO ] Invariant cache hit.
[2024-05-21 20:03:36] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 20:03:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:03:39] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:03:39] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:03:39] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-05-21 20:03:39] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:03:40] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-05-21 20:03:40] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:03:40] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:03:40] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
[2024-05-21 20:03:40] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:03:40] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:03:41] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:03:41] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:03:41] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2024-05-21 20:03:41] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:03:41] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:03:41] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:03:42] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:03:42] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:03:42] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
[2024-05-21 20:03:42] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:03:43] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-05-21 20:03:43] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-21 20:03:43] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:03:43] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:03:43] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:03:43] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:03:43] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-21 20:03:44] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:03:44] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:03:44] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:03:44] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:03:45] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:03:46] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 3 ms to minimize.
[2024-05-21 20:03:47] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:03:47] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:03:47] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-21 20:03:48] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:03:52] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 199 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:04:00] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:04:03] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:04:06] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 21511 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 43760ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 43764ms
Starting structural reductions in LTL mode, iteration 1 : 153/175 places, 199/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44085 ms. Remains : 153/175 places, 199/221 transitions.
[2024-05-21 20:04:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:04:20] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:04:20] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-21 20:04:20] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:04:20] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:04:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3229431434253999705.gal : 2 ms
[2024-05-21 20:04:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2352997183924769874.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/CTLFireability3229431434253999705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2352997183924769874.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.9176e+07,1.46577,42140,2,6282,5,151031,6,0,813,196128,0


Converting to forward existential form...Done !
original formula: AG(AX(A(AX((((p56==1)&&(p87==1))&&((p118==1)&&(p148==1)))) U !(EF((((p6==1)&&(p14==1))&&((p107==1)&&(p147==1))))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(FwdU(Init,TRUE)),!(!(E(TRUE U (((p6==1)&&(p14==1))&&((p107==1)&&(p147==1))))))) * !(!(EX(!((((p...367
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
(forward)formula 0,0,23.5788,596584,1,0,584,3.30821e+06,425,227,5713,3.06635e+06,676
FORMULA AutonomousCar-PT-03b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 204
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 155 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 155 transition count 201
Applied a total of 40 rules in 7 ms. Remains 155 /175 variables (removed 20) and now considering 201/221 (removed 20) transitions.
// Phase 1: matrix 201 rows 155 cols
[2024-05-21 20:04:44] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 20:04:44] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 20:04:44] [INFO ] Invariant cache hit.
[2024-05-21 20:04:44] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-21 20:04:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:04:46] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-05-21 20:04:47] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:04:47] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:04:47] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 2 ms to minimize.
[2024-05-21 20:04:47] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:04:47] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-21 20:04:47] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:04:48] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:04:48] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:04:48] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:04:48] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:04:48] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
[2024-05-21 20:04:48] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:04:48] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:04:48] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:04:49] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-21 20:04:49] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-21 20:04:49] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:04:49] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 3 ms to minimize.
[2024-05-21 20:04:49] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:04:50] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-05-21 20:04:50] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:04:50] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 3 ms to minimize.
[2024-05-21 20:04:50] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:04:51] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:04:53] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:04:53] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-21 20:04:53] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:04:53] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:04:54] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:04:54] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:04:54] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:04:54] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:04:54] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:04:54] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:04:55] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:04:56] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-21 20:04:56] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-21 20:04:56] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:04:56] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:04:56] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 5 ms to minimize.
[2024-05-21 20:04:57] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:04:58] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:05:00] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2024-05-21 20:05:00] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 201/356 variables, 155/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (OVERLAPS) 0/356 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 208 constraints, problems are : Problem set: 0 solved, 200 unsolved in 24728 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/208 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 200/408 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/356 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 408 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12248 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 45/45 constraints]
After SMT, in 37034ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 37036ms
Starting structural reductions in LTL mode, iteration 1 : 155/175 places, 201/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37236 ms. Remains : 155/175 places, 201/221 transitions.
[2024-05-21 20:05:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:05:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:05:21] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-21 20:05:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:05:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:05:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10691922007037911207.gal : 2 ms
[2024-05-21 20:05:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7575631353112980211.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/CTLFireability10691922007037911207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7575631353112980211.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.32151e+07,2.12362,56824,2,6748,5,206282,6,0,823,276760,0


Converting to forward existential form...Done !
original formula: (A((!(EF(AG((p35==1)))) * A(!(E((p158==1) U (p132==1))) U !(EF(((((p6==1)&&(p14==1))&&((p80==1)&&(p147==1)))||(p109==1)))))) U EF(!(EX(((...396
=> equivalent forward existential formula: (([((FwdU(Init,!(E(TRUE U !(EX(((((p115==1)&&(p6==1))&&((p14==1)&&(p49==1)))&&(p147==1))))))) * !((!(E(TRUE U !(...1006
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t29, t33, t36, t37, t38, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95...382
Using saturation style SCC detection
(forward)formula 0,1,17.0029,405220,1,0,654,1.99478e+06,447,283,6086,2.00929e+06,759
FORMULA AutonomousCar-PT-03b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 204
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 156 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 156 transition count 202
Applied a total of 38 rules in 4 ms. Remains 156 /175 variables (removed 19) and now considering 202/221 (removed 19) transitions.
// Phase 1: matrix 202 rows 156 cols
[2024-05-21 20:05:38] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 20:05:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 20:05:38] [INFO ] Invariant cache hit.
[2024-05-21 20:05:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 20:05:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:05:41] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:05:41] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-05-21 20:05:41] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:05:41] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-21 20:05:42] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 2 ms to minimize.
[2024-05-21 20:05:42] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:05:42] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-21 20:05:42] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:05:42] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:05:42] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-21 20:05:42] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:05:43] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:05:43] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:05:43] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:05:44] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:05:44] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:05:44] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 3 ms to minimize.
[2024-05-21 20:05:45] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:05:45] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 3 ms to minimize.
[2024-05-21 20:05:46] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:05:48] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:05:48] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:05:50] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-05-21 20:05:50] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 202/358 variables, 156/188 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:05:54] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:05:54] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:05:54] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:05:54] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:05:55] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:05:55] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:05:55] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 195 constraints, problems are : Problem set: 0 solved, 201 unsolved in 21510 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:06:02] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:06:04] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/358 variables, 156/197 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 201/398 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 398 constraints, problems are : Problem set: 0 solved, 201 unsolved in 14338 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 33/33 constraints]
After SMT, in 35899ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 35901ms
Starting structural reductions in LTL mode, iteration 1 : 156/175 places, 202/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36122 ms. Remains : 156/175 places, 202/221 transitions.
[2024-05-21 20:06:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:06:14] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:06:14] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-21 20:06:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:06:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:06:14] [INFO ] Time to serialize gal into /tmp/CTLFireability785930240184480416.gal : 1 ms
[2024-05-21 20:06:14] [INFO ] Time to serialize properties into /tmp/CTLFireability41871648494177325.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/CTLFireability785930240184480416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability41871648494177325.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 -...280
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.4869e+07,1.59702,41656,2,6334,5,150845,6,0,828,193351,0


Converting to forward existential form...Done !
original formula: (EG(AF((((AG((((p6==0)||(p15==0))||((p49==0)||(p147==0)))) + ((p138==0)&&(p167==0))) + ((p60==0)||(p6==0))) + (((p14==0)||(p114==0))||(p1...500
=> equivalent forward existential formula: ([((FwdU((Init * EG(!(EG(!((((!(E(TRUE U !((((p6==0)||(p15==0))||((p49==0)||(p147==0)))))) + ((p138==0)&&(p167==...1118
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95, t97...371
Detected timeout of ITS tools.
[2024-05-21 20:06:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:06:45] [INFO ] Applying decomposition
[2024-05-21 20:06:45] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8755869189356537174.txt' '-o' '/tmp/graph8755869189356537174.bin' '-w' '/tmp/graph8755869189356537174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8755869189356537174.bin' '-l' '-1' '-v' '-w' '/tmp/graph8755869189356537174.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:06:45] [INFO ] Decomposing Gal with order
[2024-05-21 20:06:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:06:45] [INFO ] Removed a total of 122 redundant transitions.
[2024-05-21 20:06:45] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:06:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-21 20:06:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4737013327458484019.gal : 5 ms
[2024-05-21 20:06:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17070595632488266017.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/CTLFireability4737013327458484019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17070595632488266017.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.4869e+07,0.063027,5460,408,73,3131,449,377,4368,66,1159,0


Converting to forward existential form...Done !
original formula: (EG(AF((((AG((((i0.u1.p6==0)||(i0.u1.p15==0))||((i3.u16.p49==0)||(i0.u1.p147==0)))) + ((i10.i2.u45.p138==0)&&(i14.u61.p167==0))) + ((i5.i...756
=> equivalent forward existential formula: ([((FwdU((Init * EG(!(EG(!((((!(E(TRUE U !((((i0.u1.p6==0)||(i0.u1.p15==0))||((i3.u16.p49==0)||(i0.u1.p147==0)))...1622
Reverse transition relation is NOT exact ! Due to transitions t148, t169, t181, t199, i0.t145, i0.t143, i3.u15.t120, i3.u15.t123, i3.u16.t121, i4.i1.t136, ...546
Using saturation style SCC detection
Using 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 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
Using saturation style SCC detection
Using 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 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
Using saturation style SCC detection
(forward)formula 0,1,9.70221,310500,1,0,671020,2001,2865,868873,375,13212,848683
FORMULA AutonomousCar-PT-03b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-21 20:06:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:06:54] [INFO ] Flatten gal took : 5 ms
Total runtime 933580 ms.

BK_STOP 1716322014949

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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