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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 113K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716261938321

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 03:25:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:25:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:25:41] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-21 03:25:41] [INFO ] Transformed 482 places.
[2024-05-21 03:25:41] [INFO ] Transformed 480 transitions.
[2024-05-21 03:25:41] [INFO ] Found NUPN structural information;
[2024-05-21 03:25:41] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-05b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 428 transition count 426
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 428 transition count 426
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 112 place count 428 transition count 422
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 140 place count 400 transition count 394
Iterating global reduction 1 with 28 rules applied. Total rules applied 168 place count 400 transition count 394
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 172 place count 396 transition count 390
Iterating global reduction 1 with 4 rules applied. Total rules applied 176 place count 396 transition count 390
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 179 place count 393 transition count 387
Iterating global reduction 1 with 3 rules applied. Total rules applied 182 place count 393 transition count 387
Applied a total of 182 rules in 317 ms. Remains 393 /482 variables (removed 89) and now considering 387/480 (removed 93) transitions.
// Phase 1: matrix 387 rows 393 cols
[2024-05-21 03:25:42] [INFO ] Computed 34 invariants in 48 ms
[2024-05-21 03:25:43] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-21 03:25:43] [INFO ] Invariant cache hit.
[2024-05-21 03:25:43] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2024-05-21 03:25:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 03:25:54] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 44 ms to minimize.
[2024-05-21 03:25:55] [INFO ] Deduced a trap composed of 62 places in 198 ms of which 5 ms to minimize.
[2024-05-21 03:25:55] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 4 ms to minimize.
[2024-05-21 03:25:55] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 4 ms to minimize.
[2024-05-21 03:25:55] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 4 ms to minimize.
[2024-05-21 03:25:55] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 4 ms to minimize.
[2024-05-21 03:25:55] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-05-21 03:25:55] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 3 ms to minimize.
[2024-05-21 03:25:56] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:25:56] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:25:56] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-21 03:25:56] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:25:57] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 5 ms to minimize.
[2024-05-21 03:25:57] [INFO ] Deduced a trap composed of 56 places in 270 ms of which 4 ms to minimize.
[2024-05-21 03:25:57] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 4 ms to minimize.
[2024-05-21 03:25:57] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 4 ms to minimize.
[2024-05-21 03:25:57] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 3 ms to minimize.
[2024-05-21 03:25:58] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:25:58] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:25:58] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 03:26:03] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 8 ms to minimize.
[2024-05-21 03:26:03] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 5 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 4 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 5 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 5 ms to minimize.
[2024-05-21 03:26:05] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 5 ms to minimize.
[2024-05-21 03:26:05] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 3 ms to minimize.
[2024-05-21 03:26:05] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 5 ms to minimize.
[2024-05-21 03:26:06] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 4 ms to minimize.
[2024-05-21 03:26:06] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 4 ms to minimize.
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 5 ms to minimize.
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 4 ms to minimize.
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 4 ms to minimize.
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 4 ms to minimize.
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 85 places in 183 ms of which 4 ms to minimize.
[2024-05-21 03:26:09] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 6 ms to minimize.
[2024-05-21 03:26:09] [INFO ] Deduced a trap composed of 84 places in 226 ms of which 4 ms to minimize.
[2024-05-21 03:26:09] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 4 ms to minimize.
[2024-05-21 03:26:10] [INFO ] Deduced a trap composed of 58 places in 219 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 03:26:11] [INFO ] Deduced a trap composed of 61 places in 338 ms of which 6 ms to minimize.
[2024-05-21 03:26:11] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 5 ms to minimize.
[2024-05-21 03:26:11] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 6 ms to minimize.
[2024-05-21 03:26:12] [INFO ] Deduced a trap composed of 67 places in 307 ms of which 5 ms to minimize.
[2024-05-21 03:26:12] [INFO ] Deduced a trap composed of 72 places in 265 ms of which 6 ms to minimize.
[2024-05-21 03:26:12] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 6 ms to minimize.
[2024-05-21 03:26:12] [INFO ] Deduced a trap composed of 69 places in 271 ms of which 5 ms to minimize.
[2024-05-21 03:26:13] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 5 ms to minimize.
[2024-05-21 03:26:13] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/780 variables, and 83 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/393 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 49/83 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 03:26:20] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 5 ms to minimize.
[2024-05-21 03:26:21] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 5 ms to minimize.
[2024-05-21 03:26:21] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 5 ms to minimize.
[2024-05-21 03:26:21] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 6 ms to minimize.
[2024-05-21 03:26:22] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 4 ms to minimize.
[2024-05-21 03:26:22] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 4 ms to minimize.
[2024-05-21 03:26:22] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:26:22] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 6 ms to minimize.
[2024-05-21 03:26:23] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 5 ms to minimize.
[2024-05-21 03:26:23] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 5 ms to minimize.
[2024-05-21 03:26:23] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:26:23] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-05-21 03:26:23] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 3 ms to minimize.
[2024-05-21 03:26:24] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 4 ms to minimize.
[2024-05-21 03:26:24] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 4 ms to minimize.
[2024-05-21 03:26:24] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 4 ms to minimize.
[2024-05-21 03:26:25] [INFO ] Deduced a trap composed of 79 places in 189 ms of which 4 ms to minimize.
[2024-05-21 03:26:25] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:26:25] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 4 ms to minimize.
[2024-05-21 03:26:26] [INFO ] Deduced a trap composed of 84 places in 223 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 03:26:27] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:26:28] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:26:28] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:26:28] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:26:28] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:26:29] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 4 ms to minimize.
[2024-05-21 03:26:29] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 4 ms to minimize.
[2024-05-21 03:26:29] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 4 ms to minimize.
[2024-05-21 03:26:30] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 4 ms to minimize.
[2024-05-21 03:26:30] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 3 ms to minimize.
[2024-05-21 03:26:32] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-21 03:26:32] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 03:26:35] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 4 ms to minimize.
[2024-05-21 03:26:35] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 4 ms to minimize.
[2024-05-21 03:26:35] [INFO ] Deduced a trap composed of 68 places in 194 ms of which 4 ms to minimize.
[2024-05-21 03:26:36] [INFO ] Deduced a trap composed of 73 places in 216 ms of which 4 ms to minimize.
[2024-05-21 03:26:36] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:26:37] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 6 ms to minimize.
[2024-05-21 03:26:37] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 4 ms to minimize.
[2024-05-21 03:26:37] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 4 ms to minimize.
[2024-05-21 03:26:37] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 3 ms to minimize.
[2024-05-21 03:26:38] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 4 ms to minimize.
[2024-05-21 03:26:40] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:26:40] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 3 ms to minimize.
[2024-05-21 03:26:40] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 13/128 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-21 03:26:44] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 5 ms to minimize.
SMT process timed out in 60289ms, After SMT, problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in LTL mode, iteration 1 : 393/482 places, 387/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62210 ms. Remains : 393/482 places, 387/480 transitions.
Support contains 38 out of 393 places after structural reductions.
[2024-05-21 03:26:44] [INFO ] Flatten gal took : 117 ms
[2024-05-21 03:26:44] [INFO ] Flatten gal took : 50 ms
[2024-05-21 03:26:44] [INFO ] Input system was already deterministic with 387 transitions.
Support contains 34 out of 393 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (162 resets) in 2278 ms. (17 steps per ms) remains 6/32 properties
BEST_FIRST walk for 40004 steps (15 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (13 resets) in 195 ms. (204 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 149 ms. (266 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
[2024-05-21 03:26:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 322/365 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:45] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-21 03:26:46] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-21 03:26:47] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 3 ms to minimize.
[2024-05-21 03:26:47] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 28/393 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:47] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 5 ms to minimize.
[2024-05-21 03:26:47] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 4 ms to minimize.
[2024-05-21 03:26:47] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 4 ms to minimize.
[2024-05-21 03:26:47] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-05-21 03:26:48] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:26:48] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 3 ms to minimize.
[2024-05-21 03:26:48] [INFO ] Deduced a trap composed of 70 places in 211 ms of which 4 ms to minimize.
[2024-05-21 03:26:48] [INFO ] Deduced a trap composed of 83 places in 201 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:48] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 4 ms to minimize.
[2024-05-21 03:26:49] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 387/780 variables, 393/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:49] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 4 ms to minimize.
[2024-05-21 03:26:49] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/780 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 452 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4452 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 322/365 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:50] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 4 ms to minimize.
[2024-05-21 03:26:50] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-05-21 03:26:50] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 28/393 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:51] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 5 ms to minimize.
[2024-05-21 03:26:51] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 4 ms to minimize.
[2024-05-21 03:26:51] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:26:51] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 4 ms to minimize.
[2024-05-21 03:26:52] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 5 ms to minimize.
[2024-05-21 03:26:52] [INFO ] Deduced a trap composed of 58 places in 264 ms of which 5 ms to minimize.
[2024-05-21 03:26:52] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 5 ms to minimize.
[2024-05-21 03:26:52] [INFO ] Deduced a trap composed of 58 places in 257 ms of which 5 ms to minimize.
[2024-05-21 03:26:53] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:53] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 5 ms to minimize.
[2024-05-21 03:26:53] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:26:53] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 5 ms to minimize.
[2024-05-21 03:26:54] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:54] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:26:54] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 387/780 variables, 393/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/780 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:54] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/780 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/780 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:26:55] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 4 ms to minimize.
SMT process timed out in 9589ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 387/387 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 393 transition count 248
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 161 rules applied. Total rules applied 300 place count 254 transition count 226
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 310 place count 244 transition count 226
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 310 place count 244 transition count 178
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 406 place count 196 transition count 178
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 411 place count 191 transition count 173
Iterating global reduction 3 with 5 rules applied. Total rules applied 416 place count 191 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 416 place count 191 transition count 172
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 418 place count 190 transition count 172
Performed 73 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 564 place count 117 transition count 90
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 584 place count 117 transition count 70
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 604 place count 97 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 605 place count 96 transition count 69
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 47 rules applied. Total rules applied 652 place count 74 transition count 44
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 677 place count 49 transition count 44
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 677 place count 49 transition count 28
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 709 place count 33 transition count 28
Applied a total of 709 rules in 168 ms. Remains 33 /393 variables (removed 360) and now considering 28/387 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 33/393 places, 28/387 transitions.
RANDOM walk for 112 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/3 properties
FORMULA AutoFlight-PT-05b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 96 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 380 transition count 374
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 380 transition count 374
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 380 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 377 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 377 transition count 366
Applied a total of 37 rules in 47 ms. Remains 377 /393 variables (removed 16) and now considering 366/387 (removed 21) transitions.
// Phase 1: matrix 366 rows 377 cols
[2024-05-21 03:26:56] [INFO ] Computed 34 invariants in 9 ms
[2024-05-21 03:26:56] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-21 03:26:56] [INFO ] Invariant cache hit.
[2024-05-21 03:26:56] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-05-21 03:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:27:06] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 3 ms to minimize.
[2024-05-21 03:27:06] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 3 ms to minimize.
[2024-05-21 03:27:06] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:27:06] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 3 ms to minimize.
[2024-05-21 03:27:07] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
[2024-05-21 03:27:07] [INFO ] Deduced a trap composed of 21 places in 369 ms of which 7 ms to minimize.
[2024-05-21 03:27:07] [INFO ] Deduced a trap composed of 51 places in 361 ms of which 6 ms to minimize.
[2024-05-21 03:27:08] [INFO ] Deduced a trap composed of 16 places in 363 ms of which 6 ms to minimize.
[2024-05-21 03:27:08] [INFO ] Deduced a trap composed of 63 places in 306 ms of which 6 ms to minimize.
[2024-05-21 03:27:09] [INFO ] Deduced a trap composed of 18 places in 323 ms of which 5 ms to minimize.
[2024-05-21 03:27:09] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 5 ms to minimize.
[2024-05-21 03:27:09] [INFO ] Deduced a trap composed of 56 places in 287 ms of which 6 ms to minimize.
[2024-05-21 03:27:09] [INFO ] Deduced a trap composed of 56 places in 266 ms of which 5 ms to minimize.
[2024-05-21 03:27:10] [INFO ] Deduced a trap composed of 57 places in 284 ms of which 5 ms to minimize.
[2024-05-21 03:27:10] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 5 ms to minimize.
[2024-05-21 03:27:10] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 5 ms to minimize.
[2024-05-21 03:27:11] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 5 ms to minimize.
[2024-05-21 03:27:11] [INFO ] Deduced a trap composed of 60 places in 315 ms of which 6 ms to minimize.
[2024-05-21 03:27:11] [INFO ] Deduced a trap composed of 50 places in 329 ms of which 5 ms to minimize.
[2024-05-21 03:27:12] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:27:17] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 6 ms to minimize.
[2024-05-21 03:27:17] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 5 ms to minimize.
[2024-05-21 03:27:17] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 5 ms to minimize.
[2024-05-21 03:27:18] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 4 ms to minimize.
[2024-05-21 03:27:18] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 5 ms to minimize.
[2024-05-21 03:27:18] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 4 ms to minimize.
[2024-05-21 03:27:19] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 5 ms to minimize.
[2024-05-21 03:27:19] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 4 ms to minimize.
[2024-05-21 03:27:19] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 5 ms to minimize.
[2024-05-21 03:27:20] [INFO ] Deduced a trap composed of 70 places in 268 ms of which 5 ms to minimize.
[2024-05-21 03:27:20] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 5 ms to minimize.
[2024-05-21 03:27:20] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 4 ms to minimize.
[2024-05-21 03:27:21] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 4 ms to minimize.
[2024-05-21 03:27:21] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 4 ms to minimize.
[2024-05-21 03:27:21] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 5 ms to minimize.
[2024-05-21 03:27:21] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 4 ms to minimize.
[2024-05-21 03:27:22] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 4 ms to minimize.
[2024-05-21 03:27:22] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 5 ms to minimize.
[2024-05-21 03:27:22] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 4 ms to minimize.
[2024-05-21 03:27:22] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:27:23] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 5 ms to minimize.
[2024-05-21 03:27:24] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 5 ms to minimize.
[2024-05-21 03:27:24] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 5 ms to minimize.
[2024-05-21 03:27:24] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 4 ms to minimize.
[2024-05-21 03:27:24] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 5 ms to minimize.
[2024-05-21 03:27:25] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 5 ms to minimize.
[2024-05-21 03:27:25] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 5 ms to minimize.
[2024-05-21 03:27:25] [INFO ] Deduced a trap composed of 70 places in 252 ms of which 5 ms to minimize.
[2024-05-21 03:27:25] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 4 ms to minimize.
[2024-05-21 03:27:26] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:27:26] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/743 variables, and 85 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/377 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 51/85 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:27:33] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 4 ms to minimize.
[2024-05-21 03:27:33] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 4 ms to minimize.
[2024-05-21 03:27:33] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:27:34] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 3 ms to minimize.
[2024-05-21 03:27:34] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:27:34] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 4 ms to minimize.
[2024-05-21 03:27:34] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 2 ms to minimize.
[2024-05-21 03:27:34] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 03:27:35] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-21 03:27:35] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-05-21 03:27:35] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 3 ms to minimize.
[2024-05-21 03:27:35] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-21 03:27:35] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:27:36] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:27:36] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:27:36] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:27:37] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 5 ms to minimize.
[2024-05-21 03:27:38] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:27:42] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2024-05-21 03:27:42] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 4 ms to minimize.
[2024-05-21 03:27:42] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:27:42] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-05-21 03:27:44] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:27:48] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 4 ms to minimize.
[2024-05-21 03:27:48] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 4 ms to minimize.
[2024-05-21 03:27:51] [INFO ] Deduced a trap composed of 75 places in 201 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:27:54] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 3 ms to minimize.
[2024-05-21 03:27:54] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 4 ms to minimize.
[2024-05-21 03:27:56] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/743 variables, and 114 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/377 constraints, PredecessorRefiner: 0/365 constraints, Known Traps: 80/80 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 377/393 places, 366/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61018 ms. Remains : 377/393 places, 366/387 transitions.
Stuttering acceptance computed with spot in 474 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-00
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 9 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-00 finished in 61614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 392 transition count 250
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 158 rules applied. Total rules applied 294 place count 256 transition count 228
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 305 place count 246 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 245 transition count 227
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 306 place count 245 transition count 178
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 404 place count 196 transition count 178
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 411 place count 189 transition count 171
Iterating global reduction 4 with 7 rules applied. Total rules applied 418 place count 189 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 418 place count 189 transition count 168
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 424 place count 186 transition count 168
Performed 70 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 564 place count 116 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 565 place count 115 transition count 88
Reduce places removed 9 places and 0 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 4 with 13 rules applied. Total rules applied 578 place count 106 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 582 place count 102 transition count 84
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 582 place count 102 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 592 place count 97 transition count 79
Applied a total of 592 rules in 83 ms. Remains 97 /393 variables (removed 296) and now considering 79/387 (removed 308) transitions.
// Phase 1: matrix 79 rows 97 cols
[2024-05-21 03:27:57] [INFO ] Computed 25 invariants in 1 ms
[2024-05-21 03:27:57] [INFO ] Implicit Places using invariants in 138 ms returned [38, 55, 72, 76, 87, 91, 96]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 142 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/393 places, 79/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 85 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 78 transition count 67
Applied a total of 24 rules in 25 ms. Remains 78 /90 variables (removed 12) and now considering 67/79 (removed 12) transitions.
// Phase 1: matrix 67 rows 78 cols
[2024-05-21 03:27:57] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 03:27:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 03:27:58] [INFO ] Invariant cache hit.
[2024-05-21 03:27:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 03:27:58] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/393 places, 67/387 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 527 ms. Remains : 78/393 places, 67/387 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-02
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-02 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1))) U p2))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 392 transition count 251
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 157 rules applied. Total rules applied 292 place count 257 transition count 229
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 303 place count 247 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 304 place count 246 transition count 228
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 304 place count 246 transition count 179
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 402 place count 197 transition count 179
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 409 place count 190 transition count 172
Iterating global reduction 4 with 7 rules applied. Total rules applied 416 place count 190 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 416 place count 190 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 420 place count 188 transition count 170
Performed 69 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 558 place count 119 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 559 place count 118 transition count 91
Reduce places removed 9 places and 0 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 4 with 13 rules applied. Total rules applied 572 place count 109 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 576 place count 105 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 576 place count 105 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 586 place count 100 transition count 82
Applied a total of 586 rules in 88 ms. Remains 100 /393 variables (removed 293) and now considering 82/387 (removed 305) transitions.
// Phase 1: matrix 82 rows 100 cols
[2024-05-21 03:27:58] [INFO ] Computed 25 invariants in 2 ms
[2024-05-21 03:27:58] [INFO ] Implicit Places using invariants in 173 ms returned [41, 58, 75, 79, 83, 88, 99]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 175 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/393 places, 82/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 87 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 87 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 86 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 85 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 84 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 82 transition count 71
Applied a total of 22 rules in 20 ms. Remains 82 /93 variables (removed 11) and now considering 71/82 (removed 11) transitions.
// Phase 1: matrix 71 rows 82 cols
[2024-05-21 03:27:58] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 03:27:58] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 03:27:58] [INFO ] Invariant cache hit.
[2024-05-21 03:27:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 03:27:58] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/393 places, 71/387 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 601 ms. Remains : 82/393 places, 71/387 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-03
Stuttering criterion allowed to conclude after 313 steps with 39 reset in 4 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-03 finished in 753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 379 transition count 373
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 379 transition count 373
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 379 transition count 367
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 376 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 376 transition count 364
Applied a total of 40 rules in 68 ms. Remains 376 /393 variables (removed 17) and now considering 364/387 (removed 23) transitions.
// Phase 1: matrix 364 rows 376 cols
[2024-05-21 03:27:59] [INFO ] Computed 34 invariants in 6 ms
[2024-05-21 03:27:59] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-21 03:27:59] [INFO ] Invariant cache hit.
[2024-05-21 03:27:59] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-21 03:27:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:28:09] [INFO ] Deduced a trap composed of 48 places in 373 ms of which 7 ms to minimize.
[2024-05-21 03:28:10] [INFO ] Deduced a trap composed of 17 places in 402 ms of which 6 ms to minimize.
[2024-05-21 03:28:10] [INFO ] Deduced a trap composed of 57 places in 389 ms of which 7 ms to minimize.
[2024-05-21 03:28:10] [INFO ] Deduced a trap composed of 53 places in 352 ms of which 7 ms to minimize.
[2024-05-21 03:28:11] [INFO ] Deduced a trap composed of 53 places in 315 ms of which 5 ms to minimize.
[2024-05-21 03:28:11] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 5 ms to minimize.
[2024-05-21 03:28:11] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 5 ms to minimize.
[2024-05-21 03:28:12] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 5 ms to minimize.
[2024-05-21 03:28:12] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 5 ms to minimize.
[2024-05-21 03:28:12] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 6 ms to minimize.
[2024-05-21 03:28:12] [INFO ] Deduced a trap composed of 68 places in 338 ms of which 6 ms to minimize.
[2024-05-21 03:28:13] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 8 ms to minimize.
[2024-05-21 03:28:13] [INFO ] Deduced a trap composed of 22 places in 326 ms of which 6 ms to minimize.
[2024-05-21 03:28:13] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 5 ms to minimize.
[2024-05-21 03:28:14] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 5 ms to minimize.
[2024-05-21 03:28:14] [INFO ] Deduced a trap composed of 54 places in 291 ms of which 5 ms to minimize.
[2024-05-21 03:28:14] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 6 ms to minimize.
[2024-05-21 03:28:15] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 5 ms to minimize.
[2024-05-21 03:28:15] [INFO ] Deduced a trap composed of 63 places in 289 ms of which 5 ms to minimize.
[2024-05-21 03:28:15] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:28:21] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 6 ms to minimize.
[2024-05-21 03:28:21] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 5 ms to minimize.
[2024-05-21 03:28:22] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 5 ms to minimize.
[2024-05-21 03:28:22] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 4 ms to minimize.
[2024-05-21 03:28:23] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:28:23] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 4 ms to minimize.
[2024-05-21 03:28:23] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 5 ms to minimize.
[2024-05-21 03:28:23] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 5 ms to minimize.
[2024-05-21 03:28:24] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 5 ms to minimize.
[2024-05-21 03:28:24] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 6 ms to minimize.
[2024-05-21 03:28:25] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 5 ms to minimize.
[2024-05-21 03:28:26] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 4 ms to minimize.
[2024-05-21 03:28:27] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:28:29] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 5 ms to minimize.
[2024-05-21 03:28:30] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 5 ms to minimize.
SMT process timed out in 30115ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Starting structural reductions in LTL mode, iteration 1 : 376/393 places, 364/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31040 ms. Remains : 376/393 places, 364/387 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-04
Stuttering criterion allowed to conclude after 235 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-04 finished in 31184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1 U G(p0))||F(p2))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 392 transition count 250
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 156 rules applied. Total rules applied 292 place count 256 transition count 230
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 303 place count 246 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 304 place count 245 transition count 229
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 304 place count 245 transition count 182
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 398 place count 198 transition count 182
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 405 place count 191 transition count 175
Iterating global reduction 4 with 7 rules applied. Total rules applied 412 place count 191 transition count 175
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 412 place count 191 transition count 173
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 416 place count 189 transition count 173
Performed 72 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 560 place count 117 transition count 92
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 561 place count 117 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 562 place count 116 transition count 91
Reduce places removed 5 places and 0 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 4 with 7 rules applied. Total rules applied 569 place count 111 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 571 place count 109 transition count 89
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 571 place count 109 transition count 86
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 577 place count 106 transition count 86
Applied a total of 577 rules in 81 ms. Remains 106 /393 variables (removed 287) and now considering 86/387 (removed 301) transitions.
// Phase 1: matrix 86 rows 106 cols
[2024-05-21 03:28:30] [INFO ] Computed 29 invariants in 2 ms
[2024-05-21 03:28:30] [INFO ] Implicit Places using invariants in 180 ms returned [45, 62, 79, 85, 91, 96, 100, 105]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 182 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/393 places, 86/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 80
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 91 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 91 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 90 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 90 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 89 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 89 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 88 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 88 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 87 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 87 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 86 transition count 74
Applied a total of 24 rules in 35 ms. Remains 86 /98 variables (removed 12) and now considering 74/86 (removed 12) transitions.
// Phase 1: matrix 74 rows 86 cols
[2024-05-21 03:28:30] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 03:28:30] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 03:28:30] [INFO ] Invariant cache hit.
[2024-05-21 03:28:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 03:28:30] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [39, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 373 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/393 places, 74/387 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 84 transition count 72
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 72
Applied a total of 4 rules in 4 ms. Remains 82 /84 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 82 cols
[2024-05-21 03:28:30] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 03:28:30] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 03:28:30] [INFO ] Invariant cache hit.
[2024-05-21 03:28:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 03:28:31] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 82/393 places, 72/387 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 953 ms. Remains : 82/393 places, 72/387 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-05
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-05 finished in 1207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 392 transition count 247
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 161 rules applied. Total rules applied 300 place count 253 transition count 225
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 310 place count 243 transition count 225
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 310 place count 243 transition count 177
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 406 place count 195 transition count 177
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 414 place count 187 transition count 169
Iterating global reduction 3 with 8 rules applied. Total rules applied 422 place count 187 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 422 place count 187 transition count 166
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 428 place count 184 transition count 166
Performed 69 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 566 place count 115 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 567 place count 114 transition count 87
Reduce places removed 4 places and 0 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 3 with 6 rules applied. Total rules applied 573 place count 110 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 575 place count 108 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 575 place count 108 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 579 place count 106 transition count 83
Applied a total of 579 rules in 65 ms. Remains 106 /393 variables (removed 287) and now considering 83/387 (removed 304) transitions.
// Phase 1: matrix 83 rows 106 cols
[2024-05-21 03:28:31] [INFO ] Computed 30 invariants in 2 ms
[2024-05-21 03:28:31] [INFO ] Implicit Places using invariants in 149 ms returned [44, 61, 78, 84, 90, 96, 100, 105]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 153 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/393 places, 83/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 77
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 91 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 91 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 90 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 90 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 89 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 89 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 88 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 88 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 87 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 87 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 86 transition count 71
Applied a total of 24 rules in 30 ms. Remains 86 /98 variables (removed 12) and now considering 71/83 (removed 12) transitions.
// Phase 1: matrix 71 rows 86 cols
[2024-05-21 03:28:31] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 03:28:31] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 03:28:31] [INFO ] Invariant cache hit.
[2024-05-21 03:28:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 03:28:32] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [37, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 345 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/393 places, 71/387 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 84 transition count 69
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 69
Applied a total of 4 rules in 8 ms. Remains 82 /84 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 82 cols
[2024-05-21 03:28:32] [INFO ] Computed 20 invariants in 2 ms
[2024-05-21 03:28:32] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 03:28:32] [INFO ] Invariant cache hit.
[2024-05-21 03:28:32] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 03:28:32] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 82/393 places, 69/387 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 901 ms. Remains : 82/393 places, 69/387 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-06
Product exploration explored 100000 steps with 7769 reset in 636 ms.
Product exploration explored 100000 steps with 7677 reset in 374 ms.
Computed a total of 7 stabilizing places and 3 stable transitions
Computed a total of 7 stabilizing places and 3 stable transitions
Detected a total of 7/82 stabilizing places and 3/69 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 258 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-21 03:28:34] [INFO ] Invariant cache hit.
[2024-05-21 03:28:34] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 03:28:34] [INFO ] Invariant cache hit.
[2024-05-21 03:28:34] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 03:28:34] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-21 03:28:34] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-21 03:28:34] [INFO ] Invariant cache hit.
[2024-05-21 03:28:34] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/82 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 03:28:35] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 69/151 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 19/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 122 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2635 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 82/82 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/82 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 69/151 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 19/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 61/183 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 183 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2641 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 82/82 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints]
After SMT, in 5303ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5305ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5706 ms. Remains : 82/82 places, 69/69 transitions.
Computed a total of 7 stabilizing places and 3 stable transitions
Computed a total of 7 stabilizing places and 3 stable transitions
Detected a total of 7/82 stabilizing places and 3/69 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 247 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 285 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7840 reset in 261 ms.
Product exploration explored 100000 steps with 7557 reset in 602 ms.
Built C files in :
/tmp/ltsmin2540560566472295360
[2024-05-21 03:28:41] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2024-05-21 03:28:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:28:41] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2024-05-21 03:28:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:28:41] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2024-05-21 03:28:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:28:41] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2540560566472295360
Running compilation step : cd /tmp/ltsmin2540560566472295360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 586 ms.
Running link step : cd /tmp/ltsmin2540560566472295360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin2540560566472295360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2293903880144022779.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-21 03:28:56] [INFO ] Invariant cache hit.
[2024-05-21 03:28:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 03:28:57] [INFO ] Invariant cache hit.
[2024-05-21 03:28:57] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 03:28:57] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-21 03:28:57] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-21 03:28:57] [INFO ] Invariant cache hit.
[2024-05-21 03:28:57] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/82 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 03:28:57] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 69/151 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 19/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 122 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2534 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 82/82 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/82 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 69/151 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 19/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 61/183 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 183 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2991 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 82/82 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints]
After SMT, in 5538ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5540ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5763 ms. Remains : 82/82 places, 69/69 transitions.
Built C files in :
/tmp/ltsmin1856960618565782042
[2024-05-21 03:29:02] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2024-05-21 03:29:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:02] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2024-05-21 03:29:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:02] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2024-05-21 03:29:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1856960618565782042
Running compilation step : cd /tmp/ltsmin1856960618565782042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 465 ms.
Running link step : cd /tmp/ltsmin1856960618565782042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1856960618565782042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5841019529335364774.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:29:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:29:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:29:17] [INFO ] Time to serialize gal into /tmp/LTL13967727564898901224.gal : 3 ms
[2024-05-21 03:29:17] [INFO ] Time to serialize properties into /tmp/LTL14069064633455185679.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13967727564898901224.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3541522789419212649.hoa' '-atoms' '/tmp/LTL14069064633455185679.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14069064633455185679.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3541522789419212649.hoa
Reverse transition relation is NOT exact ! Due to transitions t143, t146.t157.t160.t170.t173.t183.t192.t199.t206.t216.t225.t234.t243.t252.t261.t269.t278.t2...395
Computing Next relation with stutter on 1216 deadlock states
8 unique states visited
0 strongly connected components in search stack
9 transitions explored
5 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.232086,20408,1,0,150,31130,168,77,2360,18810,207
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-05b-LTLFireability-06 finished in 46797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&G(p2)))))'
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 378 transition count 372
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 378 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 378 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 375 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 375 transition count 363
Applied a total of 42 rules in 21 ms. Remains 375 /393 variables (removed 18) and now considering 363/387 (removed 24) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-21 03:29:18] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 03:29:18] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 03:29:18] [INFO ] Invariant cache hit.
[2024-05-21 03:29:18] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 03:29:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:29:28] [INFO ] Deduced a trap composed of 49 places in 344 ms of which 7 ms to minimize.
[2024-05-21 03:29:29] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 6 ms to minimize.
[2024-05-21 03:29:29] [INFO ] Deduced a trap composed of 62 places in 267 ms of which 6 ms to minimize.
[2024-05-21 03:29:29] [INFO ] Deduced a trap composed of 65 places in 360 ms of which 5 ms to minimize.
[2024-05-21 03:29:30] [INFO ] Deduced a trap composed of 56 places in 308 ms of which 5 ms to minimize.
[2024-05-21 03:29:30] [INFO ] Deduced a trap composed of 58 places in 278 ms of which 6 ms to minimize.
[2024-05-21 03:29:30] [INFO ] Deduced a trap composed of 55 places in 341 ms of which 6 ms to minimize.
[2024-05-21 03:29:31] [INFO ] Deduced a trap composed of 19 places in 324 ms of which 6 ms to minimize.
[2024-05-21 03:29:31] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 6 ms to minimize.
[2024-05-21 03:29:31] [INFO ] Deduced a trap composed of 65 places in 299 ms of which 5 ms to minimize.
[2024-05-21 03:29:32] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 5 ms to minimize.
[2024-05-21 03:29:32] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 5 ms to minimize.
[2024-05-21 03:29:32] [INFO ] Deduced a trap composed of 60 places in 254 ms of which 5 ms to minimize.
[2024-05-21 03:29:32] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 5 ms to minimize.
[2024-05-21 03:29:33] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 5 ms to minimize.
[2024-05-21 03:29:33] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 5 ms to minimize.
[2024-05-21 03:29:33] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 4 ms to minimize.
[2024-05-21 03:29:34] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 5 ms to minimize.
[2024-05-21 03:29:34] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 4 ms to minimize.
[2024-05-21 03:29:34] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:29:39] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 5 ms to minimize.
[2024-05-21 03:29:40] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 6 ms to minimize.
[2024-05-21 03:29:40] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 5 ms to minimize.
[2024-05-21 03:29:40] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 5 ms to minimize.
[2024-05-21 03:29:40] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 5 ms to minimize.
[2024-05-21 03:29:41] [INFO ] Deduced a trap composed of 61 places in 253 ms of which 5 ms to minimize.
[2024-05-21 03:29:41] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 5 ms to minimize.
[2024-05-21 03:29:41] [INFO ] Deduced a trap composed of 16 places in 272 ms of which 5 ms to minimize.
[2024-05-21 03:29:42] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:29:42] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:29:42] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 5 ms to minimize.
[2024-05-21 03:29:42] [INFO ] Deduced a trap composed of 82 places in 257 ms of which 5 ms to minimize.
[2024-05-21 03:29:43] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 5 ms to minimize.
[2024-05-21 03:29:43] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 5 ms to minimize.
[2024-05-21 03:29:43] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:29:44] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 4 ms to minimize.
[2024-05-21 03:29:44] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 4 ms to minimize.
[2024-05-21 03:29:44] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:29:45] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 5 ms to minimize.
[2024-05-21 03:29:45] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:29:46] [INFO ] Deduced a trap composed of 62 places in 228 ms of which 5 ms to minimize.
[2024-05-21 03:29:46] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:29:46] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 5 ms to minimize.
[2024-05-21 03:29:46] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 5 ms to minimize.
[2024-05-21 03:29:47] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 4 ms to minimize.
[2024-05-21 03:29:47] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 4 ms to minimize.
[2024-05-21 03:29:47] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 4 ms to minimize.
[2024-05-21 03:29:47] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 4 ms to minimize.
[2024-05-21 03:29:48] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 4 ms to minimize.
[2024-05-21 03:29:48] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 4 ms to minimize.
[2024-05-21 03:29:48] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:29:48] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/738 variables, and 86 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 52/86 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:29:54] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:29:55] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 5 ms to minimize.
[2024-05-21 03:29:55] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 4 ms to minimize.
[2024-05-21 03:29:55] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 4 ms to minimize.
[2024-05-21 03:29:55] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 4 ms to minimize.
[2024-05-21 03:29:56] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 4 ms to minimize.
[2024-05-21 03:29:56] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 4 ms to minimize.
[2024-05-21 03:29:56] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:29:56] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:29:56] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:29:56] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 03:29:57] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:29:57] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-21 03:29:57] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-21 03:29:57] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 03:29:57] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-21 03:29:58] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 4 ms to minimize.
[2024-05-21 03:29:59] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 4 ms to minimize.
[2024-05-21 03:30:00] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2024-05-21 03:30:00] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:30:01] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 4 ms to minimize.
[2024-05-21 03:30:02] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 4 ms to minimize.
[2024-05-21 03:30:02] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 363/738 variables, 375/484 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 362/846 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:30:15] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 4 ms to minimize.
[2024-05-21 03:30:17] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 4 ms to minimize.
[2024-05-21 03:30:17] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:30:17] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 4 ms to minimize.
[2024-05-21 03:30:18] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 4 ms to minimize.
[2024-05-21 03:30:18] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 852 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 81/81 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60895 ms. Remains : 375/393 places, 363/387 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-07 finished in 61121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U (p2||G(p1)))||p0))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 392 transition count 253
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 153 rules applied. Total rules applied 286 place count 259 transition count 233
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 299 place count 250 transition count 229
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 304 place count 246 transition count 228
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 304 place count 246 transition count 180
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 400 place count 198 transition count 180
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 407 place count 191 transition count 173
Iterating global reduction 4 with 7 rules applied. Total rules applied 414 place count 191 transition count 173
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 414 place count 191 transition count 170
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 420 place count 188 transition count 170
Performed 70 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 560 place count 118 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 561 place count 117 transition count 90
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 572 place count 109 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 575 place count 106 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 575 place count 106 transition count 82
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 585 place count 101 transition count 82
Applied a total of 585 rules in 44 ms. Remains 101 /393 variables (removed 292) and now considering 82/387 (removed 305) transitions.
// Phase 1: matrix 82 rows 101 cols
[2024-05-21 03:30:19] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 03:30:19] [INFO ] Implicit Places using invariants in 255 ms returned [43, 60, 77, 81, 85, 90, 95, 100]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 263 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/393 places, 82/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 87 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 87 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 86 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 85 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 84 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 83 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 83 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 82 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 82 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 81 transition count 70
Applied a total of 24 rules in 11 ms. Remains 81 /93 variables (removed 12) and now considering 70/82 (removed 12) transitions.
// Phase 1: matrix 70 rows 81 cols
[2024-05-21 03:30:19] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 03:30:19] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 03:30:19] [INFO ] Invariant cache hit.
[2024-05-21 03:30:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:30:20] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/393 places, 70/387 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 623 ms. Remains : 81/393 places, 70/387 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-08
Product exploration explored 100000 steps with 3928 reset in 385 ms.
Product exploration explored 100000 steps with 3938 reset in 359 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 517 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 317 steps (11 resets) in 10 ms. (28 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 p0 p2)))]
Knowledge based reduction with 5 factoid took 780 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 03:30:22] [INFO ] Invariant cache hit.
[2024-05-21 03:30:22] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 03:30:22] [INFO ] Invariant cache hit.
[2024-05-21 03:30:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:30:22] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 03:30:22] [INFO ] Redundant transitions in 2 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-21 03:30:22] [INFO ] Invariant cache hit.
[2024-05-21 03:30:22] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/81 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 03:30:23] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 70/151 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 112 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2277 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/81 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 70/151 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 169 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 1/1 constraints]
After SMT, in 4515ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4824 ms. Remains : 81/81 places, 70/70 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 584 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 540 steps (18 resets) in 8 ms. (60 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 p0 p2)))]
Knowledge based reduction with 5 factoid took 789 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3938 reset in 255 ms.
Product exploration explored 100000 steps with 3991 reset in 272 ms.
Built C files in :
/tmp/ltsmin18283330007132690500
[2024-05-21 03:30:29] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2024-05-21 03:30:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:29] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2024-05-21 03:30:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:29] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2024-05-21 03:30:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18283330007132690500
Running compilation step : cd /tmp/ltsmin18283330007132690500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 302 ms.
Running link step : cd /tmp/ltsmin18283330007132690500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18283330007132690500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10679581580125928267.hoa' '--buchi-type=spotba'
LTSmin run took 7449 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05b-LTLFireability-08 finished in 18278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(p1&&F(p0)&&G(F(!p0))))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 380 transition count 374
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 380 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 380 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 378 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 378 transition count 366
Applied a total of 36 rules in 25 ms. Remains 378 /393 variables (removed 15) and now considering 366/387 (removed 21) transitions.
// Phase 1: matrix 366 rows 378 cols
[2024-05-21 03:30:37] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 03:30:37] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 03:30:37] [INFO ] Invariant cache hit.
[2024-05-21 03:30:38] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-05-21 03:30:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:30:48] [INFO ] Deduced a trap composed of 46 places in 299 ms of which 4 ms to minimize.
[2024-05-21 03:30:48] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 4 ms to minimize.
[2024-05-21 03:30:48] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 5 ms to minimize.
[2024-05-21 03:30:49] [INFO ] Deduced a trap composed of 62 places in 270 ms of which 5 ms to minimize.
[2024-05-21 03:30:49] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 5 ms to minimize.
[2024-05-21 03:30:49] [INFO ] Deduced a trap composed of 61 places in 273 ms of which 5 ms to minimize.
[2024-05-21 03:30:50] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 5 ms to minimize.
[2024-05-21 03:30:50] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 5 ms to minimize.
[2024-05-21 03:30:50] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:30:50] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 5 ms to minimize.
[2024-05-21 03:30:50] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:30:50] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:30:51] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-21 03:30:51] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 4 ms to minimize.
[2024-05-21 03:30:51] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:30:51] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:30:51] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 3 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 4 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:30:56] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-05-21 03:30:56] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:31:01] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 4 ms to minimize.
[2024-05-21 03:31:02] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 4 ms to minimize.
[2024-05-21 03:31:02] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
[2024-05-21 03:31:02] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 4 ms to minimize.
[2024-05-21 03:31:03] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-05-21 03:31:03] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:31:03] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/744 variables, and 67 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:31:14] [INFO ] Deduced a trap composed of 59 places in 309 ms of which 6 ms to minimize.
[2024-05-21 03:31:14] [INFO ] Deduced a trap composed of 54 places in 293 ms of which 5 ms to minimize.
[2024-05-21 03:31:14] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 6 ms to minimize.
[2024-05-21 03:31:15] [INFO ] Deduced a trap composed of 63 places in 269 ms of which 5 ms to minimize.
[2024-05-21 03:31:15] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 4 ms to minimize.
[2024-05-21 03:31:15] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 5 ms to minimize.
[2024-05-21 03:31:16] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 4 ms to minimize.
[2024-05-21 03:31:16] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 5 ms to minimize.
[2024-05-21 03:31:16] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 4 ms to minimize.
[2024-05-21 03:31:16] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 4 ms to minimize.
[2024-05-21 03:31:17] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:31:17] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 4 ms to minimize.
[2024-05-21 03:31:17] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-21 03:31:17] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 3 ms to minimize.
[2024-05-21 03:31:18] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-21 03:31:18] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-21 03:31:18] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 3 ms to minimize.
[2024-05-21 03:31:18] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 03:31:18] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 2 ms to minimize.
[2024-05-21 03:31:18] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:31:19] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 3 ms to minimize.
[2024-05-21 03:31:19] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 3 ms to minimize.
[2024-05-21 03:31:19] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 3 ms to minimize.
[2024-05-21 03:31:20] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-21 03:31:20] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
[2024-05-21 03:31:20] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:31:21] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 4 ms to minimize.
[2024-05-21 03:31:21] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 3 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:31:24] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:31:24] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-05-21 03:31:25] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 03:31:26] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 4 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:31:30] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:31:35] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 4 ms to minimize.
[2024-05-21 03:31:35] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/744 variables, and 115 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/365 constraints, Known Traps: 81/81 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 378/393 places, 366/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60904 ms. Remains : 378/393 places, 366/387 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-09
Product exploration explored 100000 steps with 721 reset in 252 ms.
Product exploration explored 100000 steps with 720 reset in 283 ms.
Computed a total of 94 stabilizing places and 94 stable transitions
Computed a total of 94 stabilizing places and 94 stable transitions
Detected a total of 94/378 stabilizing places and 94/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 532 steps (0 resets) in 11 ms. (44 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 376 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Applied a total of 0 rules in 16 ms. Remains 378 /378 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-21 03:31:40] [INFO ] Invariant cache hit.
[2024-05-21 03:31:40] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-21 03:31:40] [INFO ] Invariant cache hit.
[2024-05-21 03:31:41] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-05-21 03:31:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:31:51] [INFO ] Deduced a trap composed of 46 places in 387 ms of which 6 ms to minimize.
[2024-05-21 03:31:51] [INFO ] Deduced a trap composed of 17 places in 371 ms of which 6 ms to minimize.
[2024-05-21 03:31:51] [INFO ] Deduced a trap composed of 21 places in 357 ms of which 6 ms to minimize.
[2024-05-21 03:31:52] [INFO ] Deduced a trap composed of 62 places in 306 ms of which 6 ms to minimize.
[2024-05-21 03:31:52] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 5 ms to minimize.
[2024-05-21 03:31:53] [INFO ] Deduced a trap composed of 61 places in 287 ms of which 5 ms to minimize.
[2024-05-21 03:31:53] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 5 ms to minimize.
[2024-05-21 03:31:53] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 5 ms to minimize.
[2024-05-21 03:31:53] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 5 ms to minimize.
[2024-05-21 03:31:54] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 5 ms to minimize.
[2024-05-21 03:31:54] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 4 ms to minimize.
[2024-05-21 03:31:54] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 4 ms to minimize.
[2024-05-21 03:31:54] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 4 ms to minimize.
[2024-05-21 03:31:55] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 5 ms to minimize.
[2024-05-21 03:31:55] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 5 ms to minimize.
[2024-05-21 03:31:55] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 5 ms to minimize.
[2024-05-21 03:31:56] [INFO ] Deduced a trap composed of 72 places in 265 ms of which 5 ms to minimize.
[2024-05-21 03:31:56] [INFO ] Deduced a trap composed of 76 places in 277 ms of which 5 ms to minimize.
[2024-05-21 03:31:56] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 4 ms to minimize.
[2024-05-21 03:31:57] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:32:02] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:32:02] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-05-21 03:32:02] [INFO ] Deduced a trap composed of 57 places in 292 ms of which 4 ms to minimize.
[2024-05-21 03:32:03] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 4 ms to minimize.
[2024-05-21 03:32:04] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 03:32:05] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:32:08] [INFO ] Deduced a trap composed of 54 places in 340 ms of which 6 ms to minimize.
[2024-05-21 03:32:08] [INFO ] Deduced a trap composed of 55 places in 319 ms of which 6 ms to minimize.
[2024-05-21 03:32:08] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 5 ms to minimize.
[2024-05-21 03:32:09] [INFO ] Deduced a trap composed of 52 places in 272 ms of which 5 ms to minimize.
[2024-05-21 03:32:10] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 5 ms to minimize.
[2024-05-21 03:32:10] [INFO ] Deduced a trap composed of 61 places in 185 ms of which 3 ms to minimize.
[2024-05-21 03:32:10] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/744 variables, and 67 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:32:16] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 3 ms to minimize.
[2024-05-21 03:32:17] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 4 ms to minimize.
[2024-05-21 03:32:17] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 3 ms to minimize.
[2024-05-21 03:32:17] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 5 ms to minimize.
[2024-05-21 03:32:17] [INFO ] Deduced a trap composed of 62 places in 247 ms of which 4 ms to minimize.
[2024-05-21 03:32:17] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 4 ms to minimize.
[2024-05-21 03:32:18] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-21 03:32:18] [INFO ] Deduced a trap composed of 71 places in 227 ms of which 4 ms to minimize.
[2024-05-21 03:32:18] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 5 ms to minimize.
[2024-05-21 03:32:19] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 4 ms to minimize.
[2024-05-21 03:32:19] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-21 03:32:19] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:32:19] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:32:19] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:32:19] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-05-21 03:32:20] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2024-05-21 03:32:20] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-21 03:32:20] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 4 ms to minimize.
[2024-05-21 03:32:20] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-21 03:32:20] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:32:21] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:32:21] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:32:22] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:32:22] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 4 ms to minimize.
[2024-05-21 03:32:22] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:32:23] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-21 03:32:23] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 4 ms to minimize.
[2024-05-21 03:32:23] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 4 ms to minimize.
[2024-05-21 03:32:24] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 4 ms to minimize.
[2024-05-21 03:32:24] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 3 ms to minimize.
[2024-05-21 03:32:24] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:32:25] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 4 ms to minimize.
[2024-05-21 03:32:25] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:32:25] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 4 ms to minimize.
[2024-05-21 03:32:25] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 3 ms to minimize.
[2024-05-21 03:32:25] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:32:25] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 3 ms to minimize.
[2024-05-21 03:32:26] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 3 ms to minimize.
[2024-05-21 03:32:26] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-21 03:32:26] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:32:27] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-05-21 03:32:27] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-05-21 03:32:28] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:32:29] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:32:30] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:32:33] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:32:37] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:32:38] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/744 variables, and 115 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/365 constraints, Known Traps: 81/81 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 60925 ms. Remains : 378/378 places, 366/366 transitions.
Computed a total of 94 stabilizing places and 94 stable transitions
Computed a total of 94 stabilizing places and 94 stable transitions
Detected a total of 94/378 stabilizing places and 94/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 610 steps (0 resets) in 9 ms. (61 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 719 reset in 149 ms.
Product exploration explored 100000 steps with 721 reset in 167 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 378 transition count 366
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 378 transition count 361
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 127 place count 378 transition count 361
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 178 place count 378 transition count 361
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 277 place count 279 transition count 262
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 376 place count 279 transition count 262
Performed 89 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 465 place count 279 transition count 252
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 522 place count 222 transition count 195
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 579 place count 222 transition count 195
Deduced a syphon composed of 106 places in 0 ms
Applied a total of 579 rules in 70 ms. Remains 222 /378 variables (removed 156) and now considering 195/366 (removed 171) transitions.
[2024-05-21 03:32:43] [INFO ] Redundant transitions in 7 ms returned []
Running 194 sub problems to find dead transitions.
// Phase 1: matrix 195 rows 222 cols
[2024-05-21 03:32:43] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 03:32:43] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/222 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-21 03:32:47] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 4 ms to minimize.
[2024-05-21 03:32:47] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 4 ms to minimize.
[2024-05-21 03:32:47] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 2 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 4 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 03:32:48] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 3 ms to minimize.
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD187 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 20/54 constraints. Problems are: Problem set: 62 solved, 132 unsolved
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-21 03:32:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 03:32:50] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 15/69 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/69 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 195/417 variables, 222/291 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 37/328 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/328 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/417 variables, 0/328 constraints. Problems are: Problem set: 106 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 328 constraints, problems are : Problem set: 106 solved, 88 unsolved in 10808 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 222/222 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 106 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 103/218 variables, 32/32 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 35/67 constraints. Problems are: Problem set: 106 solved, 88 unsolved
[2024-05-21 03:32:55] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 1/68 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/68 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 4/222 variables, 2/70 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/70 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 195/417 variables, 222/292 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 37/329 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 88/417 constraints. Problems are: Problem set: 106 solved, 88 unsolved
[2024-05-21 03:32:57] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-21 03:32:57] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 2/419 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/419 constraints. Problems are: Problem set: 106 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/417 variables, 0/419 constraints. Problems are: Problem set: 106 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 419 constraints, problems are : Problem set: 106 solved, 88 unsolved in 10548 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 222/222 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 88/194 constraints, Known Traps: 38/38 constraints]
After SMT, in 21412ms problems are : Problem set: 106 solved, 88 unsolved
Search for dead transitions found 106 dead transitions in 21415ms
Found 106 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 106 transitions
Dead transitions reduction (with SMT) removed 106 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 222/378 places, 89/366 transitions.
Graph (complete) has 296 edges and 222 vertex of which 116 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.4 ms
Discarding 106 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 116 /222 variables (removed 106) and now considering 89/89 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/378 places, 89/366 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21521 ms. Remains : 116/378 places, 89/366 transitions.
Built C files in :
/tmp/ltsmin16119907014993192235
[2024-05-21 03:33:05] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16119907014993192235
Running compilation step : cd /tmp/ltsmin16119907014993192235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1513 ms.
Running link step : cd /tmp/ltsmin16119907014993192235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16119907014993192235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5717521766650747997.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 366/366 (removed 0) transitions.
// Phase 1: matrix 366 rows 378 cols
[2024-05-21 03:33:20] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 03:33:20] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-21 03:33:20] [INFO ] Invariant cache hit.
[2024-05-21 03:33:20] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-05-21 03:33:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:33:28] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 5 ms to minimize.
[2024-05-21 03:33:28] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 4 ms to minimize.
[2024-05-21 03:33:28] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 4 ms to minimize.
[2024-05-21 03:33:29] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:33:29] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:33:29] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 3 ms to minimize.
[2024-05-21 03:33:29] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-21 03:33:29] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:33:29] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 4 ms to minimize.
[2024-05-21 03:33:30] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-21 03:33:30] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-21 03:33:30] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-21 03:33:30] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:33:30] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 5 ms to minimize.
[2024-05-21 03:33:30] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:33:31] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-05-21 03:33:31] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:33:31] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 3 ms to minimize.
[2024-05-21 03:33:31] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-21 03:33:31] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:33:35] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 4 ms to minimize.
[2024-05-21 03:33:35] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-05-21 03:33:36] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 5 ms to minimize.
[2024-05-21 03:33:36] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 4 ms to minimize.
[2024-05-21 03:33:36] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 03:33:37] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:33:40] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 6 ms to minimize.
[2024-05-21 03:33:40] [INFO ] Deduced a trap composed of 55 places in 312 ms of which 6 ms to minimize.
[2024-05-21 03:33:40] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 5 ms to minimize.
[2024-05-21 03:33:41] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 4 ms to minimize.
[2024-05-21 03:33:41] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:33:42] [INFO ] Deduced a trap composed of 61 places in 212 ms of which 4 ms to minimize.
[2024-05-21 03:33:42] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:33:46] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 3 ms to minimize.
[2024-05-21 03:33:48] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 4 ms to minimize.
[2024-05-21 03:33:48] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 4 ms to minimize.
[2024-05-21 03:33:48] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:33:48] [INFO ] Deduced a trap composed of 66 places in 149 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/744 variables, and 72 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:33:54] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 5 ms to minimize.
[2024-05-21 03:33:55] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 4 ms to minimize.
[2024-05-21 03:33:55] [INFO ] Deduced a trap composed of 57 places in 231 ms of which 4 ms to minimize.
[2024-05-21 03:33:55] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 4 ms to minimize.
[2024-05-21 03:33:55] [INFO ] Deduced a trap composed of 60 places in 249 ms of which 5 ms to minimize.
[2024-05-21 03:33:55] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:33:56] [INFO ] Deduced a trap composed of 75 places in 229 ms of which 4 ms to minimize.
[2024-05-21 03:33:56] [INFO ] Deduced a trap composed of 69 places in 231 ms of which 4 ms to minimize.
[2024-05-21 03:33:56] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 3 ms to minimize.
[2024-05-21 03:33:56] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 5 ms to minimize.
[2024-05-21 03:33:57] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 5 ms to minimize.
[2024-05-21 03:33:57] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 4 ms to minimize.
[2024-05-21 03:33:57] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:33:57] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 4 ms to minimize.
[2024-05-21 03:33:57] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:33:58] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:33:58] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:33:58] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 5 ms to minimize.
[2024-05-21 03:33:59] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 4 ms to minimize.
[2024-05-21 03:33:59] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:34:00] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 5 ms to minimize.
[2024-05-21 03:34:00] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 3 ms to minimize.
[2024-05-21 03:34:01] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-05-21 03:34:01] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 4 ms to minimize.
[2024-05-21 03:34:01] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-05-21 03:34:01] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 3 ms to minimize.
[2024-05-21 03:34:01] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 3 ms to minimize.
[2024-05-21 03:34:02] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:34:02] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 3 ms to minimize.
[2024-05-21 03:34:02] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:34:02] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:34:02] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 3 ms to minimize.
[2024-05-21 03:34:02] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 4 ms to minimize.
[2024-05-21 03:34:03] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-05-21 03:34:03] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 15/107 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:34:06] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 3 ms to minimize.
[2024-05-21 03:34:07] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-05-21 03:34:07] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:34:07] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 4 ms to minimize.
[2024-05-21 03:34:07] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:34:07] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:34:07] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-21 03:34:09] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-05-21 03:34:09] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-21 03:34:09] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-21 03:34:10] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 03:34:10] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:34:13] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-21 03:34:18] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 3 ms to minimize.
[2024-05-21 03:34:18] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:34:20] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/744 variables, and 123 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/365 constraints, Known Traps: 89/89 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 378/378 places, 366/366 transitions.
Built C files in :
/tmp/ltsmin6816393682125382607
[2024-05-21 03:34:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6816393682125382607
Running compilation step : cd /tmp/ltsmin6816393682125382607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1095 ms.
Running link step : cd /tmp/ltsmin6816393682125382607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6816393682125382607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12209371514124648870.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:34:36] [INFO ] Flatten gal took : 23 ms
[2024-05-21 03:34:36] [INFO ] Flatten gal took : 22 ms
[2024-05-21 03:34:36] [INFO ] Time to serialize gal into /tmp/LTL2301954279049617291.gal : 6 ms
[2024-05-21 03:34:36] [INFO ] Time to serialize properties into /tmp/LTL9068885528982248747.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2301954279049617291.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3592072581220873505.hoa' '-atoms' '/tmp/LTL9068885528982248747.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9068885528982248747.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3592072581220873505.hoa
Detected timeout of ITS tools.
[2024-05-21 03:34:51] [INFO ] Flatten gal took : 22 ms
[2024-05-21 03:34:51] [INFO ] Flatten gal took : 21 ms
[2024-05-21 03:34:51] [INFO ] Time to serialize gal into /tmp/LTL2934955878870407342.gal : 7 ms
[2024-05-21 03:34:51] [INFO ] Time to serialize properties into /tmp/LTL3289067048075137393.ltl : 5 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2934955878870407342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3289067048075137393.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(p182!=1)")))||((("(p127==1)")&&(F("(p182!=1)")))&&(G(F("(p182==1)")))))))))
Formula 0 simplified : XXG(FG!"(p182!=1)" & (!"(p127==1)" | G!"(p182!=1)" | FG!"(p182==1)"))
Detected timeout of ITS tools.
[2024-05-21 03:35:06] [INFO ] Flatten gal took : 17 ms
[2024-05-21 03:35:06] [INFO ] Applying decomposition
[2024-05-21 03:35:06] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15786206286478326136.txt' '-o' '/tmp/graph15786206286478326136.bin' '-w' '/tmp/graph15786206286478326136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15786206286478326136.bin' '-l' '-1' '-v' '-w' '/tmp/graph15786206286478326136.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:35:06] [INFO ] Decomposing Gal with order
[2024-05-21 03:35:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:35:06] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 03:35:06] [INFO ] Flatten gal took : 94 ms
[2024-05-21 03:35:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-21 03:35:06] [INFO ] Time to serialize gal into /tmp/LTL7513293832480890460.gal : 14 ms
[2024-05-21 03:35:06] [INFO ] Time to serialize properties into /tmp/LTL13363675020670820427.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7513293832480890460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13363675020670820427.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(i10.i0.u47.p182!=1)")))||((("(i7.u38.p127==1)")&&(F("(i10.i0.u47.p182!=1)")))&&(G(F("(i10.i0.u47.p182==1)")))))))))
Formula 0 simplified : XXG(FG!"(i10.i0.u47.p182!=1)" & (!"(i7.u38.p127==1)" | G!"(i10.i0.u47.p182!=1)" | FG!"(i10.i0.u47.p182==1)"))
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 284079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F((G(F(!p0))||(p1&&F(!p0))))) U (G((G(p0)||(p0&&F((G(F(!p0))||(p1&&F(!p0)))))))||(!p2&&(G(p0)||(p0&&F((G(F(!p0))||(p1&&F(!p0)))))))))))'
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 380 transition count 374
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 380 transition count 374
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 380 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 377 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 377 transition count 367
Applied a total of 36 rules in 22 ms. Remains 377 /393 variables (removed 16) and now considering 367/387 (removed 20) transitions.
// Phase 1: matrix 367 rows 377 cols
[2024-05-21 03:35:21] [INFO ] Computed 34 invariants in 5 ms
[2024-05-21 03:35:21] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-21 03:35:21] [INFO ] Invariant cache hit.
[2024-05-21 03:35:22] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-05-21 03:35:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 03:35:30] [INFO ] Deduced a trap composed of 61 places in 210 ms of which 4 ms to minimize.
[2024-05-21 03:35:30] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 4 ms to minimize.
[2024-05-21 03:35:31] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 6 ms to minimize.
[2024-05-21 03:35:31] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 4 ms to minimize.
[2024-05-21 03:35:31] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 4 ms to minimize.
[2024-05-21 03:35:31] [INFO ] Deduced a trap composed of 54 places in 284 ms of which 6 ms to minimize.
[2024-05-21 03:35:32] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-05-21 03:35:32] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 3 ms to minimize.
[2024-05-21 03:35:32] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:35:32] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:35:32] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 4 ms to minimize.
[2024-05-21 03:35:32] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:35:33] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 4 ms to minimize.
[2024-05-21 03:35:33] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-05-21 03:35:33] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:35:33] [INFO ] Deduced a trap composed of 69 places in 228 ms of which 5 ms to minimize.
[2024-05-21 03:35:34] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 5 ms to minimize.
[2024-05-21 03:35:34] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:35:34] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2024-05-21 03:35:34] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 03:35:38] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-21 03:35:39] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 4 ms to minimize.
[2024-05-21 03:35:39] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 3 ms to minimize.
[2024-05-21 03:35:39] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-21 03:35:40] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:35:40] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-21 03:35:40] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-21 03:35:40] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-21 03:35:40] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-21 03:35:40] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-21 03:35:40] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:35:41] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 3 ms to minimize.
[2024-05-21 03:35:41] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-21 03:35:41] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 3 ms to minimize.
[2024-05-21 03:35:41] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-21 03:35:41] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:35:41] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-21 03:35:41] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:35:43] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:35:43] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 03:35:44] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 3 ms to minimize.
[2024-05-21 03:35:46] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-21 03:35:46] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:35:47] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 03:35:48] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 5 ms to minimize.
[2024-05-21 03:35:48] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 5 ms to minimize.
[2024-05-21 03:35:49] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 5 ms to minimize.
[2024-05-21 03:35:49] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 3 ms to minimize.
[2024-05-21 03:35:52] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:35:52] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 4 ms to minimize.
[2024-05-21 03:35:52] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 3 ms to minimize.
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Starting structural reductions in LTL mode, iteration 1 : 377/393 places, 367/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30892 ms. Remains : 377/393 places, 367/387 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), true, false, p0, p0]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-10 finished in 31211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 379 transition count 373
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 379 transition count 373
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 379 transition count 367
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 376 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 376 transition count 364
Applied a total of 40 rules in 21 ms. Remains 376 /393 variables (removed 17) and now considering 364/387 (removed 23) transitions.
// Phase 1: matrix 364 rows 376 cols
[2024-05-21 03:35:52] [INFO ] Computed 34 invariants in 4 ms
[2024-05-21 03:35:53] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 03:35:53] [INFO ] Invariant cache hit.
[2024-05-21 03:35:53] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-21 03:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:00] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-05-21 03:36:00] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 4 ms to minimize.
[2024-05-21 03:36:00] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:36:00] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:36:01] [INFO ] Deduced a trap composed of 74 places in 158 ms of which 4 ms to minimize.
[2024-05-21 03:36:01] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:36:01] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:36:01] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:36:01] [INFO ] Deduced a trap composed of 60 places in 170 ms of which 3 ms to minimize.
[2024-05-21 03:36:01] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 03:36:02] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 3 ms to minimize.
[2024-05-21 03:36:02] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 4 ms to minimize.
[2024-05-21 03:36:02] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 4 ms to minimize.
[2024-05-21 03:36:02] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 3 ms to minimize.
[2024-05-21 03:36:03] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 3 ms to minimize.
[2024-05-21 03:36:03] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:36:03] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:36:03] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 5 ms to minimize.
[2024-05-21 03:36:03] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 5 ms to minimize.
[2024-05-21 03:36:04] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:08] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 4 ms to minimize.
[2024-05-21 03:36:08] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 4 ms to minimize.
[2024-05-21 03:36:08] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 3 ms to minimize.
[2024-05-21 03:36:08] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 2 ms to minimize.
[2024-05-21 03:36:08] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-05-21 03:36:08] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-05-21 03:36:09] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 5 ms to minimize.
[2024-05-21 03:36:09] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 3 ms to minimize.
[2024-05-21 03:36:09] [INFO ] Deduced a trap composed of 59 places in 240 ms of which 5 ms to minimize.
[2024-05-21 03:36:09] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 5 ms to minimize.
[2024-05-21 03:36:10] [INFO ] Deduced a trap composed of 61 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:36:10] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 4 ms to minimize.
[2024-05-21 03:36:11] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 3 ms to minimize.
[2024-05-21 03:36:11] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 5 ms to minimize.
[2024-05-21 03:36:11] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 5 ms to minimize.
[2024-05-21 03:36:12] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 5 ms to minimize.
[2024-05-21 03:36:13] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 4 ms to minimize.
[2024-05-21 03:36:13] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-05-21 03:36:13] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:36:14] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:14] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2024-05-21 03:36:14] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:36:15] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 5 ms to minimize.
[2024-05-21 03:36:15] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-05-21 03:36:16] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-21 03:36:16] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-21 03:36:16] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 2 ms to minimize.
[2024-05-21 03:36:17] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:36:17] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-21 03:36:17] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:20] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 4 ms to minimize.
[2024-05-21 03:36:21] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:36:21] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-21 03:36:21] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 3 ms to minimize.
[2024-05-21 03:36:21] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-21 03:36:21] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/740 variables, and 90 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 56/90 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:28] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 3 ms to minimize.
[2024-05-21 03:36:29] [INFO ] Deduced a trap composed of 68 places in 229 ms of which 5 ms to minimize.
[2024-05-21 03:36:29] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 5 ms to minimize.
[2024-05-21 03:36:29] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:36:29] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:36:29] [INFO ] Deduced a trap composed of 59 places in 189 ms of which 4 ms to minimize.
[2024-05-21 03:36:30] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 5 ms to minimize.
[2024-05-21 03:36:30] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 5 ms to minimize.
[2024-05-21 03:36:30] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:36:30] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:36:31] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:36:31] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:36:31] [INFO ] Deduced a trap composed of 83 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:34] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 5 ms to minimize.
[2024-05-21 03:36:34] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 4 ms to minimize.
[2024-05-21 03:36:35] [INFO ] Deduced a trap composed of 64 places in 218 ms of which 5 ms to minimize.
[2024-05-21 03:36:35] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:36:35] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 4 ms to minimize.
[2024-05-21 03:36:35] [INFO ] Deduced a trap composed of 61 places in 233 ms of which 4 ms to minimize.
[2024-05-21 03:36:35] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 5 ms to minimize.
[2024-05-21 03:36:36] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:36:36] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 5 ms to minimize.
[2024-05-21 03:36:36] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 4 ms to minimize.
[2024-05-21 03:36:37] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-21 03:36:37] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-21 03:36:37] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-21 03:36:37] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:36:37] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 15/118 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:41] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 4 ms to minimize.
[2024-05-21 03:36:41] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:36:41] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-05-21 03:36:42] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:36:42] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 5 ms to minimize.
[2024-05-21 03:36:42] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:49] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 03:36:51] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 4 ms to minimize.
[2024-05-21 03:36:51] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:36:52] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 4 ms to minimize.
[2024-05-21 03:36:53] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/740 variables, and 129 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 0/363 constraints, Known Traps: 95/95 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 376/393 places, 364/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60638 ms. Remains : 376/393 places, 364/387 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-11 finished in 60767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&X(p1)))&&G(p2))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 378 transition count 372
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 378 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 378 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 375 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 375 transition count 363
Applied a total of 42 rules in 22 ms. Remains 375 /393 variables (removed 18) and now considering 363/387 (removed 24) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-21 03:36:53] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 03:36:53] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 03:36:53] [INFO ] Invariant cache hit.
[2024-05-21 03:36:54] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 03:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:02] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 4 ms to minimize.
[2024-05-21 03:37:02] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 6 ms to minimize.
[2024-05-21 03:37:02] [INFO ] Deduced a trap composed of 62 places in 191 ms of which 3 ms to minimize.
[2024-05-21 03:37:03] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:37:03] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 4 ms to minimize.
[2024-05-21 03:37:03] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 8 ms to minimize.
[2024-05-21 03:37:03] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 4 ms to minimize.
[2024-05-21 03:37:03] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 4 ms to minimize.
[2024-05-21 03:37:04] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 5 ms to minimize.
[2024-05-21 03:37:04] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 5 ms to minimize.
[2024-05-21 03:37:04] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 3 ms to minimize.
[2024-05-21 03:37:04] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:37:05] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 4 ms to minimize.
[2024-05-21 03:37:05] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 4 ms to minimize.
[2024-05-21 03:37:05] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 5 ms to minimize.
[2024-05-21 03:37:05] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 5 ms to minimize.
[2024-05-21 03:37:05] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:37:06] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:37:06] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 4 ms to minimize.
[2024-05-21 03:37:06] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:11] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:37:11] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 4 ms to minimize.
[2024-05-21 03:37:11] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 7 ms to minimize.
[2024-05-21 03:37:11] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:37:12] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:37:12] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:37:12] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 5 ms to minimize.
[2024-05-21 03:37:12] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 3 ms to minimize.
[2024-05-21 03:37:13] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 4 ms to minimize.
[2024-05-21 03:37:13] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:37:13] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 5 ms to minimize.
[2024-05-21 03:37:13] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:37:13] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 4 ms to minimize.
[2024-05-21 03:37:14] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 5 ms to minimize.
[2024-05-21 03:37:14] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:37:14] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 4 ms to minimize.
[2024-05-21 03:37:14] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 4 ms to minimize.
[2024-05-21 03:37:15] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:37:15] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 4 ms to minimize.
[2024-05-21 03:37:15] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:16] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 4 ms to minimize.
[2024-05-21 03:37:16] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 4 ms to minimize.
[2024-05-21 03:37:16] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:37:16] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:37:16] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 4 ms to minimize.
[2024-05-21 03:37:17] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 4 ms to minimize.
[2024-05-21 03:37:17] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-05-21 03:37:17] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 4 ms to minimize.
[2024-05-21 03:37:17] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:37:17] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-05-21 03:37:18] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 3 ms to minimize.
[2024-05-21 03:37:18] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-05-21 03:37:19] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 3 ms to minimize.
[2024-05-21 03:37:19] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-05-21 03:37:19] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-21 03:37:19] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:37:19] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-21 03:37:19] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 03:37:19] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 3 ms to minimize.
[2024-05-21 03:37:20] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:22] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 03:37:22] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-21 03:37:22] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 4 ms to minimize.
[2024-05-21 03:37:24] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/738 variables, and 98 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 64/98 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:29] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 7 ms to minimize.
[2024-05-21 03:37:29] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:37:29] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2024-05-21 03:37:29] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 4 ms to minimize.
[2024-05-21 03:37:30] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 3 ms to minimize.
[2024-05-21 03:37:30] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 03:37:30] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:37:30] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:37:30] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 3 ms to minimize.
[2024-05-21 03:37:31] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 3 ms to minimize.
[2024-05-21 03:37:31] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:37:33] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:37:33] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-21 03:37:33] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 4 ms to minimize.
[2024-05-21 03:37:33] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:36] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:42] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 3 ms to minimize.
[2024-05-21 03:37:42] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:37:42] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 4 ms to minimize.
[2024-05-21 03:37:43] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:48] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 4 ms to minimize.
[2024-05-21 03:37:48] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 03:37:48] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:37:53] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:37:53] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 3 ms to minimize.
[2024-05-21 03:37:54] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/738 variables, and 124 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 0/362 constraints, Known Traps: 90/90 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60844 ms. Remains : 375/393 places, 363/387 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-12 finished in 61087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 378 transition count 372
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 378 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 378 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 375 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 375 transition count 363
Applied a total of 42 rules in 35 ms. Remains 375 /393 variables (removed 18) and now considering 363/387 (removed 24) transitions.
[2024-05-21 03:37:54] [INFO ] Invariant cache hit.
[2024-05-21 03:37:55] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-21 03:37:55] [INFO ] Invariant cache hit.
[2024-05-21 03:37:55] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 03:37:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:38:02] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 4 ms to minimize.
[2024-05-21 03:38:03] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 4 ms to minimize.
[2024-05-21 03:38:03] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 4 ms to minimize.
[2024-05-21 03:38:03] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 4 ms to minimize.
[2024-05-21 03:38:03] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 4 ms to minimize.
[2024-05-21 03:38:04] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:38:04] [INFO ] Deduced a trap composed of 55 places in 273 ms of which 6 ms to minimize.
[2024-05-21 03:38:04] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 6 ms to minimize.
[2024-05-21 03:38:04] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 4 ms to minimize.
[2024-05-21 03:38:05] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 5 ms to minimize.
[2024-05-21 03:38:05] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 4 ms to minimize.
[2024-05-21 03:38:05] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 4 ms to minimize.
[2024-05-21 03:38:05] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:38:06] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 5 ms to minimize.
[2024-05-21 03:38:06] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:38:06] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 4 ms to minimize.
[2024-05-21 03:38:06] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:38:06] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 4 ms to minimize.
[2024-05-21 03:38:07] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 4 ms to minimize.
[2024-05-21 03:38:07] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:38:11] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:38:11] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 3 ms to minimize.
[2024-05-21 03:38:12] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-05-21 03:38:12] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:38:12] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-05-21 03:38:12] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:38:12] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:38:13] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 5 ms to minimize.
[2024-05-21 03:38:13] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 4 ms to minimize.
[2024-05-21 03:38:13] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 4 ms to minimize.
[2024-05-21 03:38:13] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 5 ms to minimize.
[2024-05-21 03:38:14] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 3 ms to minimize.
[2024-05-21 03:38:14] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:38:14] [INFO ] Deduced a trap composed of 57 places in 214 ms of which 3 ms to minimize.
[2024-05-21 03:38:14] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:38:15] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 4 ms to minimize.
[2024-05-21 03:38:15] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2024-05-21 03:38:15] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 3 ms to minimize.
[2024-05-21 03:38:15] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 3 ms to minimize.
[2024-05-21 03:38:16] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:38:16] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 4 ms to minimize.
[2024-05-21 03:38:16] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 4 ms to minimize.
[2024-05-21 03:38:17] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
[2024-05-21 03:38:17] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:38:17] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 4 ms to minimize.
[2024-05-21 03:38:17] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 4 ms to minimize.
[2024-05-21 03:38:17] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:38:17] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-21 03:38:18] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:38:18] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:38:18] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:38:18] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 3 ms to minimize.
[2024-05-21 03:38:19] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:38:19] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 4 ms to minimize.
[2024-05-21 03:38:19] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:38:19] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 4 ms to minimize.
[2024-05-21 03:38:20] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 4 ms to minimize.
[2024-05-21 03:38:20] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:38:20] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:38:20] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:38:21] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 03:38:22] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:38:22] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:38:24] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:38:24] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:38:24] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 03:38:25] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/738 variables, and 101 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:38:30] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 5 ms to minimize.
[2024-05-21 03:38:30] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 4 ms to minimize.
[2024-05-21 03:38:30] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 3 ms to minimize.
[2024-05-21 03:38:31] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:38:31] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 4 ms to minimize.
[2024-05-21 03:38:31] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 4 ms to minimize.
[2024-05-21 03:38:31] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:38:32] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 4 ms to minimize.
[2024-05-21 03:38:33] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:38:36] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 3 ms to minimize.
[2024-05-21 03:38:36] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:38:43] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (OVERLAPS) 363/738 variables, 375/488 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/738 variables, 362/850 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 850 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 79/79 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60834 ms. Remains : 375/393 places, 363/387 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-13
Stuttering criterion allowed to conclude after 241 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-13 finished in 60941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 378 transition count 372
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 378 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 378 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 375 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 375 transition count 363
Applied a total of 42 rules in 34 ms. Remains 375 /393 variables (removed 18) and now considering 363/387 (removed 24) transitions.
[2024-05-21 03:38:55] [INFO ] Invariant cache hit.
[2024-05-21 03:38:55] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 03:38:56] [INFO ] Invariant cache hit.
[2024-05-21 03:38:56] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 03:38:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:04] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 4 ms to minimize.
[2024-05-21 03:39:05] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:39:05] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 4 ms to minimize.
[2024-05-21 03:39:05] [INFO ] Deduced a trap composed of 65 places in 300 ms of which 6 ms to minimize.
[2024-05-21 03:39:05] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 4 ms to minimize.
[2024-05-21 03:39:06] [INFO ] Deduced a trap composed of 58 places in 215 ms of which 5 ms to minimize.
[2024-05-21 03:39:06] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 3 ms to minimize.
[2024-05-21 03:39:06] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 6 ms to minimize.
[2024-05-21 03:39:06] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2024-05-21 03:39:06] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 3 ms to minimize.
[2024-05-21 03:39:07] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 3 ms to minimize.
[2024-05-21 03:39:07] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:39:07] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 5 ms to minimize.
[2024-05-21 03:39:07] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 4 ms to minimize.
[2024-05-21 03:39:08] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 3 ms to minimize.
[2024-05-21 03:39:08] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 3 ms to minimize.
[2024-05-21 03:39:08] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-05-21 03:39:08] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:39:08] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 4 ms to minimize.
[2024-05-21 03:39:09] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:13] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 5 ms to minimize.
[2024-05-21 03:39:14] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 5 ms to minimize.
[2024-05-21 03:39:14] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 4 ms to minimize.
[2024-05-21 03:39:14] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:39:14] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 5 ms to minimize.
[2024-05-21 03:39:15] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 4 ms to minimize.
[2024-05-21 03:39:15] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 4 ms to minimize.
[2024-05-21 03:39:15] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 5 ms to minimize.
[2024-05-21 03:39:15] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 4 ms to minimize.
[2024-05-21 03:39:16] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 4 ms to minimize.
[2024-05-21 03:39:16] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 4 ms to minimize.
[2024-05-21 03:39:16] [INFO ] Deduced a trap composed of 82 places in 236 ms of which 5 ms to minimize.
[2024-05-21 03:39:16] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 4 ms to minimize.
[2024-05-21 03:39:17] [INFO ] Deduced a trap composed of 57 places in 241 ms of which 5 ms to minimize.
[2024-05-21 03:39:17] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 4 ms to minimize.
[2024-05-21 03:39:17] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 4 ms to minimize.
[2024-05-21 03:39:18] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:39:18] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:39:18] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 3 ms to minimize.
[2024-05-21 03:39:18] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:19] [INFO ] Deduced a trap composed of 62 places in 202 ms of which 4 ms to minimize.
[2024-05-21 03:39:19] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:39:19] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 4 ms to minimize.
[2024-05-21 03:39:19] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:39:20] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:39:20] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 4 ms to minimize.
[2024-05-21 03:39:20] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 4 ms to minimize.
[2024-05-21 03:39:20] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 4 ms to minimize.
[2024-05-21 03:39:20] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 4 ms to minimize.
[2024-05-21 03:39:21] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-05-21 03:39:21] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:39:21] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 4 ms to minimize.
[2024-05-21 03:39:22] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 5 ms to minimize.
[2024-05-21 03:39:22] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 4 ms to minimize.
[2024-05-21 03:39:22] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 3 ms to minimize.
[2024-05-21 03:39:22] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 4 ms to minimize.
[2024-05-21 03:39:22] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 4 ms to minimize.
[2024-05-21 03:39:22] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 4 ms to minimize.
[2024-05-21 03:39:23] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:39:23] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:24] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 4 ms to minimize.
[2024-05-21 03:39:24] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:39:25] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/738 variables, and 97 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 63/97 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:31] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:39:31] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 4 ms to minimize.
[2024-05-21 03:39:32] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 2 ms to minimize.
[2024-05-21 03:39:32] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-05-21 03:39:32] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 3 ms to minimize.
[2024-05-21 03:39:34] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:37] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 3 ms to minimize.
[2024-05-21 03:39:37] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 4 ms to minimize.
[2024-05-21 03:39:37] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:39:37] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 4 ms to minimize.
[2024-05-21 03:39:37] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 3 ms to minimize.
[2024-05-21 03:39:38] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:39:39] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 4 ms to minimize.
[2024-05-21 03:39:40] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:43] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 3 ms to minimize.
[2024-05-21 03:39:43] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:39:43] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:48] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:39:54] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/738 variables, and 116 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 0/362 constraints, Known Traps: 82/82 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60872 ms. Remains : 375/393 places, 363/387 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-14
Product exploration explored 100000 steps with 751 reset in 208 ms.
Product exploration explored 100000 steps with 775 reset in 272 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Detected a total of 91/375 stabilizing places and 91/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 244 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 419 steps (0 resets) in 7 ms. (52 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 298 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 03:39:58] [INFO ] Invariant cache hit.
[2024-05-21 03:39:58] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-21 03:39:58] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 03:39:59] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2024-05-21 03:39:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 03:39:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2024-05-21 03:39:59] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 03:40:00] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2024-05-21 03:40:00] [INFO ] Computed and/alt/rep : 362/517/362 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-21 03:40:04] [INFO ] Added : 296 causal constraints over 60 iterations in 3947 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Applied a total of 0 rules in 7 ms. Remains 375 /375 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2024-05-21 03:40:04] [INFO ] Invariant cache hit.
[2024-05-21 03:40:04] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 03:40:04] [INFO ] Invariant cache hit.
[2024-05-21 03:40:05] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 03:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:40:13] [INFO ] Deduced a trap composed of 49 places in 317 ms of which 7 ms to minimize.
[2024-05-21 03:40:13] [INFO ] Deduced a trap composed of 17 places in 299 ms of which 6 ms to minimize.
[2024-05-21 03:40:14] [INFO ] Deduced a trap composed of 62 places in 294 ms of which 6 ms to minimize.
[2024-05-21 03:40:14] [INFO ] Deduced a trap composed of 65 places in 294 ms of which 6 ms to minimize.
[2024-05-21 03:40:14] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 5 ms to minimize.
[2024-05-21 03:40:15] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 6 ms to minimize.
[2024-05-21 03:40:15] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 6 ms to minimize.
[2024-05-21 03:40:15] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 5 ms to minimize.
[2024-05-21 03:40:15] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 4 ms to minimize.
[2024-05-21 03:40:16] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 4 ms to minimize.
[2024-05-21 03:40:16] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 5 ms to minimize.
[2024-05-21 03:40:16] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 5 ms to minimize.
[2024-05-21 03:40:16] [INFO ] Deduced a trap composed of 60 places in 219 ms of which 4 ms to minimize.
[2024-05-21 03:40:16] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 6 ms to minimize.
[2024-05-21 03:40:17] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 5 ms to minimize.
[2024-05-21 03:40:17] [INFO ] Deduced a trap composed of 62 places in 187 ms of which 5 ms to minimize.
[2024-05-21 03:40:17] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 4 ms to minimize.
[2024-05-21 03:40:17] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 4 ms to minimize.
[2024-05-21 03:40:18] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 5 ms to minimize.
[2024-05-21 03:40:18] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:40:22] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 5 ms to minimize.
[2024-05-21 03:40:22] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:40:22] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 4 ms to minimize.
[2024-05-21 03:40:23] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:40:23] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:40:23] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 5 ms to minimize.
[2024-05-21 03:40:23] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 3 ms to minimize.
[2024-05-21 03:40:24] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 3 ms to minimize.
[2024-05-21 03:40:24] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-21 03:40:24] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-21 03:40:24] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 3 ms to minimize.
[2024-05-21 03:40:24] [INFO ] Deduced a trap composed of 82 places in 245 ms of which 5 ms to minimize.
[2024-05-21 03:40:25] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 3 ms to minimize.
[2024-05-21 03:40:25] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:40:25] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 4 ms to minimize.
[2024-05-21 03:40:26] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 4 ms to minimize.
[2024-05-21 03:40:26] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 4 ms to minimize.
[2024-05-21 03:40:26] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:40:26] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 3 ms to minimize.
[2024-05-21 03:40:26] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:40:27] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2024-05-21 03:40:27] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 4 ms to minimize.
[2024-05-21 03:40:27] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 4 ms to minimize.
[2024-05-21 03:40:27] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 3 ms to minimize.
[2024-05-21 03:40:28] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 03:40:28] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:40:28] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 03:40:28] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 3 ms to minimize.
[2024-05-21 03:40:28] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 4 ms to minimize.
[2024-05-21 03:40:28] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 4 ms to minimize.
[2024-05-21 03:40:29] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 4 ms to minimize.
[2024-05-21 03:40:29] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 4 ms to minimize.
[2024-05-21 03:40:30] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 5 ms to minimize.
[2024-05-21 03:40:30] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:40:30] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 4 ms to minimize.
[2024-05-21 03:40:30] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-05-21 03:40:30] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 4 ms to minimize.
[2024-05-21 03:40:31] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:40:31] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:40:31] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:40:32] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 4 ms to minimize.
[2024-05-21 03:40:32] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 03:40:33] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 2 ms to minimize.
[2024-05-21 03:40:35] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 3 ms to minimize.
[2024-05-21 03:40:35] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 3 ms to minimize.
SMT process timed out in 30091ms, After SMT, problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 30098ms
Finished structural reductions in LTL mode , in 1 iterations and 30853 ms. Remains : 375/375 places, 363/363 transitions.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Detected a total of 91/375 stabilizing places and 91/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 525 steps (0 resets) in 7 ms. (65 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 03:40:36] [INFO ] Invariant cache hit.
[2024-05-21 03:40:36] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned sat
[2024-05-21 03:40:36] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 03:40:37] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-05-21 03:40:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 03:40:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-21 03:40:37] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 03:40:38] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2024-05-21 03:40:38] [INFO ] Computed and/alt/rep : 362/517/362 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-21 03:40:41] [INFO ] Added : 296 causal constraints over 60 iterations in 3045 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 780 reset in 155 ms.
Product exploration explored 100000 steps with 807 reset in 173 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 375 transition count 363
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 375 transition count 358
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 127 place count 375 transition count 358
Deduced a syphon composed of 173 places in 1 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 178 place count 375 transition count 358
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 277 place count 276 transition count 259
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 376 place count 276 transition count 259
Performed 86 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 462 place count 276 transition count 249
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 519 place count 219 transition count 192
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 576 place count 219 transition count 192
Deduced a syphon composed of 103 places in 0 ms
Applied a total of 576 rules in 32 ms. Remains 219 /375 variables (removed 156) and now considering 192/363 (removed 171) transitions.
[2024-05-21 03:40:42] [INFO ] Redundant transitions in 7 ms returned []
Running 191 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 219 cols
[2024-05-21 03:40:42] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 03:40:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-21 03:40:46] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 3 ms to minimize.
[2024-05-21 03:40:46] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:40:46] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 4 ms to minimize.
[2024-05-21 03:40:47] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:40:47] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-05-21 03:40:47] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 03:40:47] [INFO ] Deduced a trap composed of 2 places in 149 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 03:40:47] [INFO ] Deduced a trap composed of 2 places in 149 ms of which 4 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 03:40:47] [INFO ] Deduced a trap composed of 2 places in 143 ms of which 4 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 03:40:47] [INFO ] Deduced a trap composed of 2 places in 152 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 03:40:48] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 4 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 03:40:48] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 4 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 03:40:48] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 4 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-21 03:40:48] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 3 ms to minimize.
[2024-05-21 03:40:48] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 03:40:48] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 8 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 03:40:48] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 4 ms to minimize.
[2024-05-21 03:40:49] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-21 03:40:49] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
[2024-05-21 03:40:49] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/54 constraints. Problems are: Problem set: 61 solved, 130 unsolved
[2024-05-21 03:40:49] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-05-21 03:40:49] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 03:40:49] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 03:40:49] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD111 is UNSAT
[2024-05-21 03:40:50] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 4 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 14/68 constraints. Problems are: Problem set: 103 solved, 88 unsolved
[2024-05-21 03:40:51] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-21 03:40:51] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 2/70 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/70 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 192/411 variables, 219/289 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 37/326 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/326 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/411 variables, 0/326 constraints. Problems are: Problem set: 103 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 326 constraints, problems are : Problem set: 103 solved, 88 unsolved in 13580 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 219/219 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 103 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 100/215 variables, 32/32 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 36/68 constraints. Problems are: Problem set: 103 solved, 88 unsolved
[2024-05-21 03:40:56] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 1/69 constraints. Problems are: Problem set: 103 solved, 88 unsolved
[2024-05-21 03:40:57] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 1/70 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/70 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 4/219 variables, 2/72 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/72 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 192/411 variables, 219/291 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 37/328 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 88/416 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/416 constraints. Problems are: Problem set: 103 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/411 variables, 0/416 constraints. Problems are: Problem set: 103 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 416 constraints, problems are : Problem set: 103 solved, 88 unsolved in 11153 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 219/219 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 88/191 constraints, Known Traps: 38/38 constraints]
After SMT, in 24778ms problems are : Problem set: 103 solved, 88 unsolved
Search for dead transitions found 103 dead transitions in 24781ms
Found 103 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 103 transitions
Dead transitions reduction (with SMT) removed 103 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 219/375 places, 89/363 transitions.
Graph (complete) has 296 edges and 219 vertex of which 116 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.1 ms
Discarding 103 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 116 /219 variables (removed 103) and now considering 89/89 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/375 places, 89/363 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24832 ms. Remains : 116/375 places, 89/363 transitions.
Built C files in :
/tmp/ltsmin1060324726710810107
[2024-05-21 03:41:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1060324726710810107
Running compilation step : cd /tmp/ltsmin1060324726710810107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1200 ms.
Running link step : cd /tmp/ltsmin1060324726710810107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1060324726710810107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3104797364890609143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Applied a total of 0 rules in 15 ms. Remains 375 /375 variables (removed 0) and now considering 363/363 (removed 0) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-21 03:41:22] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 03:41:22] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 03:41:22] [INFO ] Invariant cache hit.
[2024-05-21 03:41:22] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 03:41:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:41:30] [INFO ] Deduced a trap composed of 49 places in 356 ms of which 6 ms to minimize.
[2024-05-21 03:41:31] [INFO ] Deduced a trap composed of 17 places in 344 ms of which 6 ms to minimize.
[2024-05-21 03:41:31] [INFO ] Deduced a trap composed of 62 places in 307 ms of which 4 ms to minimize.
[2024-05-21 03:41:31] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 6 ms to minimize.
[2024-05-21 03:41:32] [INFO ] Deduced a trap composed of 56 places in 275 ms of which 5 ms to minimize.
[2024-05-21 03:41:32] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 5 ms to minimize.
[2024-05-21 03:41:32] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 5 ms to minimize.
[2024-05-21 03:41:32] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 5 ms to minimize.
[2024-05-21 03:41:33] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 5 ms to minimize.
[2024-05-21 03:41:33] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 4 ms to minimize.
[2024-05-21 03:41:33] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 3 ms to minimize.
[2024-05-21 03:41:34] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 4 ms to minimize.
[2024-05-21 03:41:34] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 3 ms to minimize.
[2024-05-21 03:41:34] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 5 ms to minimize.
[2024-05-21 03:41:34] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 5 ms to minimize.
[2024-05-21 03:41:35] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 5 ms to minimize.
[2024-05-21 03:41:35] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2024-05-21 03:41:35] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 3 ms to minimize.
[2024-05-21 03:41:35] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 3 ms to minimize.
[2024-05-21 03:41:35] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:41:40] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 5 ms to minimize.
[2024-05-21 03:41:40] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-05-21 03:41:40] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2024-05-21 03:41:40] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 4 ms to minimize.
[2024-05-21 03:41:40] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 5 ms to minimize.
[2024-05-21 03:41:41] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 3 ms to minimize.
[2024-05-21 03:41:41] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 5 ms to minimize.
[2024-05-21 03:41:41] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 4 ms to minimize.
[2024-05-21 03:41:41] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 4 ms to minimize.
[2024-05-21 03:41:42] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-05-21 03:41:42] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 4 ms to minimize.
[2024-05-21 03:41:42] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 4 ms to minimize.
[2024-05-21 03:41:42] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 4 ms to minimize.
[2024-05-21 03:41:43] [INFO ] Deduced a trap composed of 57 places in 275 ms of which 5 ms to minimize.
[2024-05-21 03:41:43] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:41:44] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:41:44] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 4 ms to minimize.
[2024-05-21 03:41:44] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 4 ms to minimize.
[2024-05-21 03:41:44] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 5 ms to minimize.
[2024-05-21 03:41:45] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:41:45] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 5 ms to minimize.
[2024-05-21 03:41:46] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 4 ms to minimize.
[2024-05-21 03:41:46] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:41:46] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 4 ms to minimize.
[2024-05-21 03:41:46] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 4 ms to minimize.
[2024-05-21 03:41:46] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 4 ms to minimize.
[2024-05-21 03:41:47] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 4 ms to minimize.
[2024-05-21 03:41:47] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 4 ms to minimize.
[2024-05-21 03:41:47] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 4 ms to minimize.
[2024-05-21 03:41:47] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 4 ms to minimize.
[2024-05-21 03:41:48] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 4 ms to minimize.
[2024-05-21 03:41:48] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 4 ms to minimize.
[2024-05-21 03:41:49] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 5 ms to minimize.
[2024-05-21 03:41:49] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 3 ms to minimize.
[2024-05-21 03:41:49] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:41:49] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 4 ms to minimize.
[2024-05-21 03:41:50] [INFO ] Deduced a trap composed of 69 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:41:50] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:41:50] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:41:50] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:41:52] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 4 ms to minimize.
[2024-05-21 03:41:52] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/738 variables, and 96 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 62/96 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:41:58] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 3 ms to minimize.
[2024-05-21 03:41:58] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-21 03:41:59] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-05-21 03:41:59] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 03:41:59] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:41:59] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-05-21 03:42:01] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:42:04] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-21 03:42:04] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 03:42:07] [INFO ] Deduced a trap composed of 71 places in 220 ms of which 4 ms to minimize.
[2024-05-21 03:42:07] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 4 ms to minimize.
[2024-05-21 03:42:07] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 5 ms to minimize.
[2024-05-21 03:42:08] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:42:11] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 4 ms to minimize.
[2024-05-21 03:42:11] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:42:13] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 5 ms to minimize.
[2024-05-21 03:42:14] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 03:42:17] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:42:17] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/738 variables, and 115 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 0/362 constraints, Known Traps: 81/81 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in LTL mode , in 1 iterations and 60656 ms. Remains : 375/375 places, 363/363 transitions.
Built C files in :
/tmp/ltsmin5098292636237856032
[2024-05-21 03:42:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5098292636237856032
Running compilation step : cd /tmp/ltsmin5098292636237856032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1363 ms.
Running link step : cd /tmp/ltsmin5098292636237856032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5098292636237856032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3479224959563724671.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:42:38] [INFO ] Flatten gal took : 30 ms
[2024-05-21 03:42:38] [INFO ] Flatten gal took : 13 ms
[2024-05-21 03:42:38] [INFO ] Time to serialize gal into /tmp/LTL10795468203603932868.gal : 5 ms
[2024-05-21 03:42:38] [INFO ] Time to serialize properties into /tmp/LTL9820633583310480476.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10795468203603932868.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9541216839393219576.hoa' '-atoms' '/tmp/LTL9820633583310480476.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9820633583310480476.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9541216839393219576.hoa
Detected timeout of ITS tools.
[2024-05-21 03:42:53] [INFO ] Flatten gal took : 12 ms
[2024-05-21 03:42:53] [INFO ] Flatten gal took : 12 ms
[2024-05-21 03:42:53] [INFO ] Time to serialize gal into /tmp/LTL9627586331139436972.gal : 3 ms
[2024-05-21 03:42:53] [INFO ] Time to serialize properties into /tmp/LTL18061172774723313956.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9627586331139436972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18061172774723313956.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(p17==0)")))&&(F("(p308==1)"))))))
Formula 0 simplified : XX(GF!"(p17==0)" | G!"(p308==1)")
Detected timeout of ITS tools.
[2024-05-21 03:43:08] [INFO ] Flatten gal took : 12 ms
[2024-05-21 03:43:08] [INFO ] Applying decomposition
[2024-05-21 03:43:08] [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/graph8740844183837538905.txt' '-o' '/tmp/graph8740844183837538905.bin' '-w' '/tmp/graph8740844183837538905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8740844183837538905.bin' '-l' '-1' '-v' '-w' '/tmp/graph8740844183837538905.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:43:08] [INFO ] Decomposing Gal with order
[2024-05-21 03:43:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:43:08] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-21 03:43:08] [INFO ] Flatten gal took : 30 ms
[2024-05-21 03:43:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 03:43:08] [INFO ] Time to serialize gal into /tmp/LTL14602255423254346554.gal : 7 ms
[2024-05-21 03:43:08] [INFO ] Time to serialize properties into /tmp/LTL6210300018447319415.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14602255423254346554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6210300018447319415.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i3.u8.p17==0)")))&&(F("(i23.u87.p308==1)"))))))
Formula 0 simplified : XX(GF!"(i3.u8.p17==0)" | G!"(i23.u87.p308==1)")
Reverse transition relation is NOT exact ! Due to transitions t117, t120, t143, t146, t170, t173, t192, t199, t216, t225, t243, t252, t278, t295, t374, t37...822
Computing Next relation with stutter on 800 deadlock states
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 267937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(p1&&F(p0)&&G(F(!p0))))))))'
Found a Shortening insensitive property : AutoFlight-PT-05b-LTLFireability-09
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 392 transition count 248
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 160 rules applied. Total rules applied 298 place count 254 transition count 226
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 308 place count 244 transition count 226
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 308 place count 244 transition count 178
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 404 place count 196 transition count 178
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 410 place count 190 transition count 172
Iterating global reduction 3 with 6 rules applied. Total rules applied 416 place count 190 transition count 172
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 416 place count 190 transition count 169
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 422 place count 187 transition count 169
Performed 70 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 562 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 563 place count 116 transition count 89
Reduce places removed 9 places and 0 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 3 with 13 rules applied. Total rules applied 576 place count 107 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 580 place count 103 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 580 place count 103 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 590 place count 98 transition count 80
Applied a total of 590 rules in 42 ms. Remains 98 /393 variables (removed 295) and now considering 80/387 (removed 307) transitions.
// Phase 1: matrix 80 rows 98 cols
[2024-05-21 03:43:24] [INFO ] Computed 25 invariants in 1 ms
[2024-05-21 03:43:24] [INFO ] Implicit Places using invariants in 160 ms returned [41, 58, 75, 79, 83, 88, 92, 97]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 161 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 90/393 places, 80/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 84 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 84 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 78 transition count 68
Applied a total of 24 rules in 8 ms. Remains 78 /90 variables (removed 12) and now considering 68/80 (removed 12) transitions.
// Phase 1: matrix 68 rows 78 cols
[2024-05-21 03:43:24] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 03:43:24] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 03:43:24] [INFO ] Invariant cache hit.
[2024-05-21 03:43:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-21 03:43:24] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 78/393 places, 68/387 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 426 ms. Remains : 78/393 places, 68/387 transitions.
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-09
Product exploration explored 100000 steps with 11961 reset in 145 ms.
Product exploration explored 100000 steps with 11879 reset in 152 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/78 stabilizing places and 5/68 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 345 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 488 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 78 /78 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-21 03:43:26] [INFO ] Invariant cache hit.
[2024-05-21 03:43:26] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 03:43:26] [INFO ] Invariant cache hit.
[2024-05-21 03:43:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-21 03:43:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-21 03:43:26] [INFO ] Invariant cache hit.
[2024-05-21 03:43:26] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 68/146 variables, 78/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 11/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 106 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1686 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 78/78 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 68/146 variables, 78/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 11/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 53/159 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-21 03:43:28] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 160 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 78/78 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
After SMT, in 3627ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3629ms
Finished structural reductions in LTL mode , in 1 iterations and 3865 ms. Remains : 78/78 places, 68/68 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/78 stabilizing places and 5/68 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 294 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 356 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11894 reset in 132 ms.
Stack based approach found an accepted trace after 31678 steps with 3729 reset with depth 15 and stack size 15 in 48 ms.
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 8063 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Found a Shortening insensitive property : AutoFlight-PT-05b-LTLFireability-14
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 393/393 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 392 transition count 247
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 161 rules applied. Total rules applied 300 place count 253 transition count 225
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 310 place count 243 transition count 225
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 310 place count 243 transition count 177
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 406 place count 195 transition count 177
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 414 place count 187 transition count 169
Iterating global reduction 3 with 8 rules applied. Total rules applied 422 place count 187 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 422 place count 187 transition count 166
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 428 place count 184 transition count 166
Performed 67 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 562 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 563 place count 116 transition count 89
Reduce places removed 9 places and 0 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 3 with 13 rules applied. Total rules applied 576 place count 107 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 580 place count 103 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 580 place count 103 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 590 place count 98 transition count 80
Applied a total of 590 rules in 16 ms. Remains 98 /393 variables (removed 295) and now considering 80/387 (removed 307) transitions.
// Phase 1: matrix 80 rows 98 cols
[2024-05-21 03:43:32] [INFO ] Computed 25 invariants in 1 ms
[2024-05-21 03:43:32] [INFO ] Implicit Places using invariants in 148 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 97/393 places, 80/387 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 90 transition count 73
Applied a total of 14 rules in 3 ms. Remains 90 /97 variables (removed 7) and now considering 73/80 (removed 7) transitions.
// Phase 1: matrix 73 rows 90 cols
[2024-05-21 03:43:32] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 03:43:32] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 03:43:32] [INFO ] Invariant cache hit.
[2024-05-21 03:43:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-21 03:43:32] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/393 places, 73/387 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 490 ms. Remains : 90/393 places, 73/387 transitions.
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-14
Stuttering criterion allowed to conclude after 478 steps with 25 reset in 1 ms.
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 927 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 03:43:32] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13927041668173375092
[2024-05-21 03:43:32] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2024-05-21 03:43:32] [INFO ] Applying decomposition
[2024-05-21 03:43:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:43:32] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2024-05-21 03:43:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:43:32] [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/graph10508150308834573195.txt' '-o' '/tmp/graph10508150308834573195.bin' '-w' '/tmp/graph10508150308834573195.weights'
[2024-05-21 03:43:32] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10508150308834573195.bin' '-l' '-1' '-v' '-w' '/tmp/graph10508150308834573195.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:43:32] [INFO ] Decomposing Gal with order
[2024-05-21 03:43:32] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:43:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:43:32] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13927041668173375092
Running compilation step : cd /tmp/ltsmin13927041668173375092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 03:43:32] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-21 03:43:32] [INFO ] Flatten gal took : 30 ms
[2024-05-21 03:43:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2024-05-21 03:43:32] [INFO ] Time to serialize gal into /tmp/LTLFireability3532296605346934413.gal : 7 ms
[2024-05-21 03:43:32] [INFO ] Time to serialize properties into /tmp/LTLFireability1740518769905074846.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3532296605346934413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1740518769905074846.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(X(F((G(F("(i11.u47.p182!=1)")))||((("(i8.u36.p127==1)")&&(F("(i11.u47.p182!=1)")))&&(G(F("(i11.u47.p182==1)")))))))))
Formula 0 simplified : XXG(FG!"(i11.u47.p182!=1)" & (!"(i8.u36.p127==1)" | G!"(i11.u47.p182!=1)" | FG!"(i11.u47.p182==1)"))
Compilation finished in 1574 ms.
Running link step : cd /tmp/ltsmin13927041668173375092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13927041668173375092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t120, t130, t133, t143, t160, t192, t199, t216, t225, t243, t252, t269, t278, t373, t374, t37...986
Computing Next relation with stutter on 800 deadlock states
186 unique states visited
186 strongly connected components in search stack
187 transitions explored
186 items max in DFS search stack
9953 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,99.6017,1688728,1,0,4.10619e+06,450,4902,5.22893e+06,251,1607,6767021
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-05b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X((F(G("(i7.u6.p17==0)")))&&(F("(i22.i0.i0.u85.p308==1)"))))))
Formula 1 simplified : XX(GF!"(i7.u6.p17==0)" | G!"(i22.i0.i0.u85.p308==1)")
Computing Next relation with stutter on 800 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13927041668173375092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13927041668173375092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp2==true)))&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 04:09:30] [INFO ] Applying decomposition
[2024-05-21 04:09:30] [INFO ] Flatten gal took : 29 ms
[2024-05-21 04:09:30] [INFO ] Decomposing Gal with order
[2024-05-21 04:09:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:09:30] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 04:09:30] [INFO ] Flatten gal took : 46 ms
[2024-05-21 04:09:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 40 ms.
[2024-05-21 04:09:30] [INFO ] Time to serialize gal into /tmp/LTLFireability5180989026092813980.gal : 8 ms
[2024-05-21 04:09:30] [INFO ] Time to serialize properties into /tmp/LTLFireability5614860758089628513.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5180989026092813980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5614860758089628513.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u76.p17==0)")))&&(F("(i1.i0.u65.p308==1)"))))))
Formula 0 simplified : XX(GF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u76.p17==0)" | G!"(i1.i0.u65.p308==1)")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13927041668173375092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp2==true)))&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin13927041668173375092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp2==true)))&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;