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.r468-smll-171620167000100.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 ltsminxred
Input is AutoFlight-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167000100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 22:14 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 70K 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-03b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717184069136

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:34:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:34:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:34:32] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-05-31 19:34:32] [INFO ] Transformed 298 places.
[2024-05-31 19:34:32] [INFO ] Transformed 296 transitions.
[2024-05-31 19:34:32] [INFO ] Found NUPN structural information;
[2024-05-31 19:34:32] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-03b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 265 transition count 263
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 265 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 265 transition count 259
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 86 place count 249 transition count 243
Iterating global reduction 1 with 16 rules applied. Total rules applied 102 place count 249 transition count 243
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 247 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 247 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 246 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 246 transition count 240
Applied a total of 108 rules in 219 ms. Remains 246 /298 variables (removed 52) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 246 cols
[2024-05-31 19:34:32] [INFO ] Computed 22 invariants in 40 ms
[2024-05-31 19:34:33] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-05-31 19:34:33] [INFO ] Invariant cache hit.
[2024-05-31 19:34:33] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-31 19:34:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:34:39] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 60 ms to minimize.
[2024-05-31 19:34:39] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 5 ms to minimize.
[2024-05-31 19:34:39] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 5 ms to minimize.
[2024-05-31 19:34:39] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 5 ms to minimize.
[2024-05-31 19:34:40] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-31 19:34:40] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 4 ms to minimize.
[2024-05-31 19:34:40] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:34:40] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:34:40] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:34:40] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:34:40] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:34:41] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-31 19:34:41] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 4 ms to minimize.
[2024-05-31 19:34:41] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 3 ms to minimize.
[2024-05-31 19:34:41] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 4 ms to minimize.
[2024-05-31 19:34:42] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:34:42] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:34:42] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 4 ms to minimize.
[2024-05-31 19:34:42] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 3 ms to minimize.
[2024-05-31 19:34:42] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:34:45] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:34:45] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 3 ms to minimize.
[2024-05-31 19:34:45] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 3 ms to minimize.
[2024-05-31 19:34:45] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 4 ms to minimize.
[2024-05-31 19:34:46] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-05-31 19:34:46] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:34:46] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 3 ms to minimize.
[2024-05-31 19:34:47] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 2 ms to minimize.
[2024-05-31 19:34:47] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:34:47] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:34:48] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:34:52] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 240/486 variables, 246/300 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:34:58] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:34:58] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 302 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:35:07] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:35:07] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:35:07] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:35:08] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:35:10] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:35:10] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 4 ms to minimize.
[2024-05-31 19:35:10] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 3 ms to minimize.
[2024-05-31 19:35:10] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 3 ms to minimize.
[2024-05-31 19:35:10] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:35:11] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:35:12] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-31 19:35:13] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:35:13] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:35:14] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:35:14] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 240/486 variables, 246/317 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 239/556 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:35:18] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:35:18] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 3 ms to minimize.
[2024-05-31 19:35:19] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 4 ms to minimize.
[2024-05-31 19:35:19] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:35:20] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:35:20] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:35:21] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:35:22] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:35:28] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:35:30] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 7 ms to minimize.
[2024-05-31 19:35:30] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 3 ms to minimize.
[2024-05-31 19:35:30] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:35:30] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 569 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 62/62 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in LTL mode, iteration 1 : 246/298 places, 240/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61589 ms. Remains : 246/298 places, 240/296 transitions.
Support contains 36 out of 246 places after structural reductions.
[2024-05-31 19:35:34] [INFO ] Flatten gal took : 67 ms
[2024-05-31 19:35:34] [INFO ] Flatten gal took : 28 ms
[2024-05-31 19:35:34] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 35 out of 246 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (249 resets) in 2366 ms. (16 steps per ms) remains 3/29 properties
BEST_FIRST walk for 40002 steps (26 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (26 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
[2024-05-31 19:35:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 142/230 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/246 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 240/486 variables, 246/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 268 constraints, problems are : Problem set: 0 solved, 3 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 142/230 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/246 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:35:35] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:35:36] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:35:36] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:35:36] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 4 ms to minimize.
[2024-05-31 19:35:36] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 4 ms to minimize.
[2024-05-31 19:35:36] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:35:36] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:35:36] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:35:37] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:35:37] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:35:37] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 240/486 variables, 246/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/486 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1897 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 2262ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 144 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=13 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 24 ms.
Computed a total of 64 stabilizing places and 64 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&&X(X(F(p1)))))))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 53 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-31 19:35:38] [INFO ] Computed 22 invariants in 5 ms
[2024-05-31 19:35:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-31 19:35:38] [INFO ] Invariant cache hit.
[2024-05-31 19:35:38] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-31 19:35:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:35:42] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 5 ms to minimize.
[2024-05-31 19:35:43] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 4 ms to minimize.
[2024-05-31 19:35:43] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:35:43] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 4 ms to minimize.
[2024-05-31 19:35:43] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 4 ms to minimize.
[2024-05-31 19:35:43] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:35:44] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 4 ms to minimize.
[2024-05-31 19:35:44] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 3 ms to minimize.
[2024-05-31 19:35:44] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:35:44] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:35:44] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 4 ms to minimize.
[2024-05-31 19:35:44] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:35:45] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:35:45] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 4 ms to minimize.
[2024-05-31 19:35:45] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:35:45] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:35:45] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:35:45] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:35:45] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:35:46] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:35:48] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:35:48] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:35:48] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:35:48] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:35:49] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:35:49] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:35:49] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:35:50] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-31 19:35:50] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:35:50] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:35:51] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 4 ms to minimize.
[2024-05-31 19:35:51] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:35:51] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:35:51] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27625 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:36:12] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:36:12] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:36:13] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:36:13] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:36:13] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:36:13] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:36:19] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 4 ms to minimize.
[2024-05-31 19:36:20] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:36:20] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:36:20] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:36:21] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:36:21] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:36:28] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 57702ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 57711ms
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58274 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 464 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-00
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 7 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-00 finished in 58866 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||X(p0))))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 245 transition count 151
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 101 rules applied. Total rules applied 189 place count 157 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 195 place count 151 transition count 138
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 195 place count 151 transition count 107
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 257 place count 120 transition count 107
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 263 place count 114 transition count 101
Iterating global reduction 3 with 6 rules applied. Total rules applied 269 place count 114 transition count 101
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 269 place count 114 transition count 98
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 275 place count 111 transition count 98
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 355 place count 71 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 70 transition count 53
Reduce places removed 6 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 3 with 9 rules applied. Total rules applied 365 place count 64 transition count 50
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 368 place count 61 transition count 50
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 368 place count 61 transition count 47
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 374 place count 58 transition count 47
Applied a total of 374 rules in 89 ms. Remains 58 /246 variables (removed 188) and now considering 47/240 (removed 193) transitions.
// Phase 1: matrix 47 rows 58 cols
[2024-05-31 19:36:37] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:36:37] [INFO ] Implicit Places using invariants in 114 ms returned [22, 33, 44, 48, 52, 57]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 118 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/246 places, 47/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 45 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 45 transition count 40
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 16 place count 44 transition count 39
Applied a total of 16 rules in 17 ms. Remains 44 /52 variables (removed 8) and now considering 39/47 (removed 8) transitions.
// Phase 1: matrix 39 rows 44 cols
[2024-05-31 19:36:37] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 19:36:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 19:36:37] [INFO ] Invariant cache hit.
[2024-05-31 19:36:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/246 places, 39/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 378 ms. Remains : 44/246 places, 39/240 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-01
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-01 finished in 450 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))||G((p1||F(p2)))))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 245 transition count 158
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 90 rules applied. Total rules applied 171 place count 164 transition count 149
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 176 place count 161 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 159 transition count 147
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 178 place count 159 transition count 115
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 242 place count 127 transition count 115
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 247 place count 122 transition count 110
Iterating global reduction 4 with 5 rules applied. Total rules applied 252 place count 122 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 252 place count 122 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 258 place count 119 transition count 107
Performed 41 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 340 place count 78 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 342 place count 77 transition count 62
Applied a total of 342 rules in 54 ms. Remains 77 /246 variables (removed 169) and now considering 62/240 (removed 178) transitions.
// Phase 1: matrix 62 rows 77 cols
[2024-05-31 19:36:37] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 19:36:37] [INFO ] Implicit Places using invariants in 133 ms returned [26, 30, 31, 32, 33, 57, 63, 69, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 142 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/246 places, 62/240 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 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 58
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 64 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 61 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 61 transition count 55
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 2 with 4 rules applied. Total rules applied 18 place count 59 transition count 53
Applied a total of 18 rules in 14 ms. Remains 59 /68 variables (removed 9) and now considering 53/62 (removed 9) transitions.
// Phase 1: matrix 53 rows 59 cols
[2024-05-31 19:36:37] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 19:36:37] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 19:36:37] [INFO ] Invariant cache hit.
[2024-05-31 19:36:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 19:36:37] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/246 places, 53/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 447 ms. Remains : 59/246 places, 53/240 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-02
Product exploration explored 100000 steps with 30500 reset in 651 ms.
Product exploration explored 100000 steps with 30522 reset in 415 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 460 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 738 steps (32 resets) in 15 ms. (46 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 1060 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 53/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-31 19:36:41] [INFO ] Invariant cache hit.
[2024-05-31 19:36:41] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-31 19:36:41] [INFO ] Invariant cache hit.
[2024-05-31 19:36:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 19:36:41] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-31 19:36:41] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-31 19:36:41] [INFO ] Invariant cache hit.
[2024-05-31 19:36:41] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/112 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 84 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1635 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/112 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 51/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 135 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1762 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 3419ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3421ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3696 ms. Remains : 59/59 places, 53/53 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 572 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 314 steps (12 resets) in 12 ms. (24 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 894 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 30630 reset in 326 ms.
Product exploration explored 100000 steps with 30387 reset in 592 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-31 19:36:48] [INFO ] Invariant cache hit.
[2024-05-31 19:36:48] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 19:36:48] [INFO ] Invariant cache hit.
[2024-05-31 19:36:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 19:36:48] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-31 19:36:48] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-31 19:36:48] [INFO ] Invariant cache hit.
[2024-05-31 19:36:48] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/112 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 84 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/112 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 51/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 135 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 3227ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3399 ms. Remains : 59/59 places, 53/53 transitions.
Treatment of property AutoFlight-PT-03b-LTLFireability-02 finished in 14080 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 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 245 transition count 150
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 102 rules applied. Total rules applied 191 place count 156 transition count 137
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 197 place count 150 transition count 137
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 197 place count 150 transition count 108
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 255 place count 121 transition count 108
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 261 place count 115 transition count 102
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 115 transition count 102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 267 place count 115 transition count 99
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 273 place count 112 transition count 99
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 353 place count 72 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 354 place count 71 transition count 54
Reduce places removed 6 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 3 with 9 rules applied. Total rules applied 363 place count 65 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 366 place count 62 transition count 51
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 366 place count 62 transition count 48
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 372 place count 59 transition count 48
Applied a total of 372 rules in 47 ms. Remains 59 /246 variables (removed 187) and now considering 48/240 (removed 192) transitions.
// Phase 1: matrix 48 rows 59 cols
[2024-05-31 19:36:51] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:36:51] [INFO ] Implicit Places using invariants in 120 ms returned [21, 33, 44, 48, 52]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 123 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/246 places, 48/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 45
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 45
Applied a total of 6 rules in 20 ms. Remains 51 /54 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 51 cols
[2024-05-31 19:36:51] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 19:36:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 19:36:51] [INFO ] Invariant cache hit.
[2024-05-31 19:36:51] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/246 places, 45/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 400 ms. Remains : 51/246 places, 45/240 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-03
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-03 finished in 523 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)) U (!p1&&G(p2))))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 29 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-31 19:36:52] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 19:36:52] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-31 19:36:52] [INFO ] Invariant cache hit.
[2024-05-31 19:36:52] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-31 19:36:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:36:56] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 4 ms to minimize.
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 4 ms to minimize.
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 4 ms to minimize.
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 4 ms to minimize.
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 4 ms to minimize.
[2024-05-31 19:36:58] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 4 ms to minimize.
[2024-05-31 19:36:58] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 4 ms to minimize.
[2024-05-31 19:36:58] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-31 19:36:58] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:36:58] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 3 ms to minimize.
[2024-05-31 19:36:58] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-05-31 19:36:59] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:36:59] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:36:59] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:36:59] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:36:59] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-31 19:36:59] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:37:00] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:37:00] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:37:02] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2024-05-31 19:37:02] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:37:03] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:37:03] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:37:03] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:37:03] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:37:04] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:37:04] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:37:04] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:37:04] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:37:05] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-05-31 19:37:05] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:37:05] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-31 19:37:06] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27445 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:37:25] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 4 ms to minimize.
[2024-05-31 19:37:26] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2024-05-31 19:37:26] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:37:26] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:37:27] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:37:27] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:37:33] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:37:33] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:37:34] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:37:34] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:37:34] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:37:34] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:37:42] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 57513ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 57519ms
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58074 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2), true, (AND (NOT p2) p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-04 finished in 58373 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)||X(p1))))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 29 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
[2024-05-31 19:37:50] [INFO ] Invariant cache hit.
[2024-05-31 19:37:50] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-31 19:37:50] [INFO ] Invariant cache hit.
[2024-05-31 19:37:51] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-31 19:37:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:37:55] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 5 ms to minimize.
[2024-05-31 19:37:55] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 3 ms to minimize.
[2024-05-31 19:37:55] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 4 ms to minimize.
[2024-05-31 19:37:55] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 4 ms to minimize.
[2024-05-31 19:37:56] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:37:56] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:37:56] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 4 ms to minimize.
[2024-05-31 19:37:56] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:37:56] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 4 ms to minimize.
[2024-05-31 19:37:56] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:37:57] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 4 ms to minimize.
[2024-05-31 19:37:57] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 4 ms to minimize.
[2024-05-31 19:37:57] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:37:57] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 4 ms to minimize.
[2024-05-31 19:37:57] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:38:01] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:38:01] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:38:01] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:38:01] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:38:01] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:38:01] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:38:02] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:38:02] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 3 ms to minimize.
[2024-05-31 19:38:02] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:38:03] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:38:03] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:38:04] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:38:04] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:38:04] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27649 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:38:24] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 4 ms to minimize.
[2024-05-31 19:38:25] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:38:25] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:38:25] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:38:25] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:38:25] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:38:32] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 4 ms to minimize.
[2024-05-31 19:38:32] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 6 ms to minimize.
[2024-05-31 19:38:32] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:38:33] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:38:33] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:38:33] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:38:41] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 57703ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 57709ms
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58271 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-05
Product exploration explored 100000 steps with 2177 reset in 257 ms.
Product exploration explored 100000 steps with 2160 reset in 368 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/233 stabilizing places and 57/225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 3489 steps (21 resets) in 15 ms. (218 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 655 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-31 19:38:51] [INFO ] Invariant cache hit.
[2024-05-31 19:38:51] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-31 19:38:51] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:38:51] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-31 19:38:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:38:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-31 19:38:51] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:38:51] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2024-05-31 19:38:52] [INFO ] Computed and/alt/rep : 224/321/224 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-31 19:38:53] [INFO ] Added : 215 causal constraints over 43 iterations in 1478 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 225/225 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 232 transition count 150
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 80 rules applied. Total rules applied 154 place count 158 transition count 144
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 160 place count 154 transition count 142
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 164 place count 152 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 151 transition count 140
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 165 place count 151 transition count 108
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 229 place count 119 transition count 108
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 319 place count 74 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 320 place count 73 transition count 56
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 5 with 7 rules applied. Total rules applied 327 place count 68 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 329 place count 66 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 329 place count 66 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 335 place count 63 transition count 51
Applied a total of 335 rules in 40 ms. Remains 63 /233 variables (removed 170) and now considering 51/225 (removed 174) transitions.
// Phase 1: matrix 51 rows 63 cols
[2024-05-31 19:38:53] [INFO ] Computed 17 invariants in 1 ms
[2024-05-31 19:38:53] [INFO ] Implicit Places using invariants in 105 ms returned [24, 35, 52, 57, 62]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 116 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/233 places, 51/225 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 54 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 52 transition count 45
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 16 place count 50 transition count 43
Applied a total of 16 rules in 13 ms. Remains 50 /58 variables (removed 8) and now considering 43/51 (removed 8) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-05-31 19:38:53] [INFO ] Computed 12 invariants in 5 ms
[2024-05-31 19:38:53] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 19:38:53] [INFO ] Invariant cache hit.
[2024-05-31 19:38:53] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/233 places, 43/225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 50/233 places, 43/225 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/50 stabilizing places and 2/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 973 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 251 steps (10 resets) in 6 ms. (35 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 1268 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-31 19:38:56] [INFO ] Invariant cache hit.
[2024-05-31 19:38:56] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 19:38:56] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 19:38:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:38:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-31 19:38:56] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-31 19:38:56] [INFO ] Computed and/alt/rep : 25/40/25 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 19:38:57] [INFO ] Added : 4 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 11238 reset in 227 ms.
Stack based approach found an accepted trace after 4366 steps with 510 reset with depth 6 and stack size 6 in 12 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-05 finished in 66978 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(p0)))&&(G(p1) U X(X(G(p2))))&&F(p3)))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 239 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 239 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 239 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 238 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 238 transition count 230
Applied a total of 18 rules in 9 ms. Remains 238 /246 variables (removed 8) and now considering 230/240 (removed 10) transitions.
// Phase 1: matrix 230 rows 238 cols
[2024-05-31 19:38:57] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 19:38:57] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-31 19:38:57] [INFO ] Invariant cache hit.
[2024-05-31 19:38:58] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-31 19:38:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:02] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 5 ms to minimize.
[2024-05-31 19:39:02] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 4 ms to minimize.
[2024-05-31 19:39:02] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-05-31 19:39:02] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:39:02] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:39:02] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 4 ms to minimize.
[2024-05-31 19:39:03] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-05-31 19:39:03] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 3 ms to minimize.
[2024-05-31 19:39:03] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:39:03] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 4 ms to minimize.
[2024-05-31 19:39:03] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:39:04] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:39:04] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:39:04] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:39:04] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:08] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:10] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 3 ms to minimize.
[2024-05-31 19:39:10] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 5 ms to minimize.
[2024-05-31 19:39:11] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 3 ms to minimize.
[2024-05-31 19:39:11] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:13] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:39:13] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:18] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:39:18] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 230/468 variables, 238/284 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 284 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:30] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 4 ms to minimize.
[2024-05-31 19:39:30] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:39:31] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:39:31] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:39:31] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:39:31] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:39:31] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:39:31] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:33] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 4 ms to minimize.
[2024-05-31 19:39:34] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2024-05-31 19:39:34] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 5 ms to minimize.
[2024-05-31 19:39:34] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:39:34] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:39:34] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:39:35] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:39:35] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:39:35] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:36] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:39:37] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:39] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 4 ms to minimize.
[2024-05-31 19:39:40] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-31 19:39:40] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:42] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 3 ms to minimize.
[2024-05-31 19:39:42] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:44] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:39:44] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:46] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:39:46] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:39:47] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:39:47] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:39:47] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (OVERLAPS) 230/468 variables, 238/315 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 229/544 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-31 19:39:52] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/468 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 545 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 56/56 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 238/246 places, 230/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 238/246 places, 230/240 transitions.
Stuttering acceptance computed with spot in 542 ms :[(OR (NOT p3) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p3), (NOT p0), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 283 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-06 finished in 61230 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((G(F(p0))||(p1&&X((p1 U (X(p2)||G(p1)))))))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 238 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 236 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 235 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 234 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 234 transition count 227
Applied a total of 25 rules in 23 ms. Remains 234 /246 variables (removed 12) and now considering 227/240 (removed 13) transitions.
// Phase 1: matrix 227 rows 234 cols
[2024-05-31 19:39:58] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 19:39:58] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 19:39:58] [INFO ] Invariant cache hit.
[2024-05-31 19:39:59] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-31 19:39:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:03] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 5 ms to minimize.
[2024-05-31 19:40:03] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 4 ms to minimize.
[2024-05-31 19:40:04] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 4 ms to minimize.
[2024-05-31 19:40:04] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 4 ms to minimize.
[2024-05-31 19:40:04] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 4 ms to minimize.
[2024-05-31 19:40:04] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:40:04] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 4 ms to minimize.
[2024-05-31 19:40:05] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 6 ms to minimize.
[2024-05-31 19:40:05] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 4 ms to minimize.
[2024-05-31 19:40:05] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-05-31 19:40:05] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 4 ms to minimize.
[2024-05-31 19:40:05] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 4 ms to minimize.
[2024-05-31 19:40:06] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 4 ms to minimize.
[2024-05-31 19:40:06] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:40:06] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-05-31 19:40:06] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-31 19:40:06] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:40:06] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:40:07] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:40:07] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:10] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:40:10] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:11] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:40:12] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:40:12] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:40:12] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:40:12] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:40:12] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 4 ms to minimize.
[2024-05-31 19:40:12] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:40:12] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:40:12] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:40:13] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:40:13] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:40:13] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:40:13] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:40:13] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:40:14] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:15] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:19] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 227/461 variables, 234/295 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:27] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 296 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:32] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:35] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:36] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:40:37] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:40:37] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:40:37] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:40:37] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:39] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:40:39] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
[2024-05-31 19:40:39] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:41] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:45] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 227/461 variables, 234/308 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 226/534 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:51] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:40:58] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 536 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 54/54 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 227/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60642 ms. Remains : 234/246 places, 227/240 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-07
Product exploration explored 100000 steps with 661 reset in 247 ms.
Product exploration explored 100000 steps with 658 reset in 289 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/234 stabilizing places and 57/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 671 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
RANDOM walk for 40000 steps (247 resets) in 181 ms. (219 steps per ms) remains 2/9 properties
BEST_FIRST walk for 11881 steps (4 resets) in 49 ms. (237 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 14 factoid took 1767 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 565 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 449 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 233 transition count 151
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 84 rules applied. Total rules applied 159 place count 158 transition count 142
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 152 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 150 transition count 140
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 169 place count 150 transition count 108
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 233 place count 118 transition count 108
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 319 place count 75 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 74 transition count 58
Reduce places removed 6 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 9 rules applied. Total rules applied 329 place count 68 transition count 55
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 332 place count 65 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 332 place count 65 transition count 52
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 338 place count 62 transition count 52
Applied a total of 338 rules in 30 ms. Remains 62 /234 variables (removed 172) and now considering 52/227 (removed 175) transitions.
// Phase 1: matrix 52 rows 62 cols
[2024-05-31 19:41:04] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:41:04] [INFO ] Implicit Places using invariants in 113 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/234 places, 52/227 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 56 transition count 47
Applied a total of 10 rules in 4 ms. Remains 56 /61 variables (removed 5) and now considering 47/52 (removed 5) transitions.
// Phase 1: matrix 47 rows 56 cols
[2024-05-31 19:41:04] [INFO ] Computed 15 invariants in 0 ms
[2024-05-31 19:41:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 19:41:04] [INFO ] Invariant cache hit.
[2024-05-31 19:41:04] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/234 places, 47/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 356 ms. Remains : 56/234 places, 47/227 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/56 stabilizing places and 4/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 2559 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 456 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
RANDOM walk for 1026 steps (46 resets) in 7 ms. (128 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1 p0))), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0))), (F p2), (F (NOT (OR (NOT p2) p1 p0))), (F (NOT (OR (NOT p2) (NOT p1) p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 3836 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 450 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 5055 reset in 214 ms.
Product exploration explored 100000 steps with 5083 reset in 245 ms.
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 47/47 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-31 19:41:13] [INFO ] Invariant cache hit.
[2024-05-31 19:41:13] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-31 19:41:13] [INFO ] Invariant cache hit.
[2024-05-31 19:41:13] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-31 19:41:13] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-31 19:41:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 47/103 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/103 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 71 constraints, problems are : Problem set: 0 solved, 33 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 47/103 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 104 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2035ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2036ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2288 ms. Remains : 56/56 places, 47/47 transitions.
Treatment of property AutoFlight-PT-03b-LTLFireability-07 finished in 76929 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 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 238 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 236 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 235 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 234 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 234 transition count 227
Applied a total of 25 rules in 21 ms. Remains 234 /246 variables (removed 12) and now considering 227/240 (removed 13) transitions.
// Phase 1: matrix 227 rows 234 cols
[2024-05-31 19:41:15] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 19:41:15] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 19:41:15] [INFO ] Invariant cache hit.
[2024-05-31 19:41:16] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-31 19:41:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 5 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 4 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 4 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 4 ms to minimize.
[2024-05-31 19:41:21] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 4 ms to minimize.
[2024-05-31 19:41:21] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:41:21] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:41:21] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 4 ms to minimize.
[2024-05-31 19:41:21] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:41:21] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:41:22] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:41:22] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:41:22] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:41:22] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:41:22] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:41:22] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:41:23] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:41:23] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:41:26] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:41:26] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:41:26] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:41:27] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 3 ms to minimize.
[2024-05-31 19:41:27] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:41:27] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:41:28] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:41:29] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 4 ms to minimize.
[2024-05-31 19:41:29] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:41:29] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:41:29] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:41:29] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:41:30] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:41:30] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:41:30] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:41:30] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:41:30] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:41:31] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:41:31] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:41:31] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:41:31] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:41:31] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:41:31] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:41:31] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:41:31] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:41:32] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:41:32] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:41:34] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-31 19:41:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 227/461 variables, 234/304 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 304 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:41:48] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:41:49] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:41:51] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:41:54] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:41:55] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 4 ms to minimize.
[2024-05-31 19:41:55] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:41:56] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 227/461 variables, 234/311 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 226/537 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:42:03] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:42:04] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:42:12] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 540 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 58/58 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 227/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 234/246 places, 227/240 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-08 finished in 60771 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((F((p1||G(p2)))||p0))))'
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Applied a total of 26 rules in 27 ms. Remains 234 /246 variables (removed 12) and now considering 226/240 (removed 14) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-31 19:42:16] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 19:42:16] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-31 19:42:16] [INFO ] Invariant cache hit.
[2024-05-31 19:42:17] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-31 19:42:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:20] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 5 ms to minimize.
[2024-05-31 19:42:20] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 4 ms to minimize.
[2024-05-31 19:42:21] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 4 ms to minimize.
[2024-05-31 19:42:21] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 4 ms to minimize.
[2024-05-31 19:42:21] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
[2024-05-31 19:42:21] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 4 ms to minimize.
[2024-05-31 19:42:21] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:42:22] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-05-31 19:42:22] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:42:22] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 4 ms to minimize.
[2024-05-31 19:42:22] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2024-05-31 19:42:22] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:42:22] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-31 19:42:23] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-05-31 19:42:23] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:42:23] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:42:23] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 3 ms to minimize.
[2024-05-31 19:42:23] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:42:24] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 4 ms to minimize.
[2024-05-31 19:42:24] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:26] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:42:26] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-05-31 19:42:26] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:42:27] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:42:27] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:42:27] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:42:28] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:29] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:32] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:35] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:42:35] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:38] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 226/460 variables, 234/288 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:45] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:42:45] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 290 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:49] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-31 19:42:49] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-05-31 19:42:50] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:42:50] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:42:50] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:42:51] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:42:51] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-31 19:42:51] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-05-31 19:42:51] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:53] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:42:53] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 226/460 variables, 234/302 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 225/527 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:42:56] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:42:56] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:42:57] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:43:08] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/460 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 531 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 50/50 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 226/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60757 ms. Remains : 234/246 places, 226/240 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-09
Product exploration explored 100000 steps with 625 reset in 143 ms.
Product exploration explored 100000 steps with 626 reset in 164 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/234 stabilizing places and 58/226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 270 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (250 resets) in 247 ms. (161 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (24 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (26 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (26 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
[2024-05-31 19:43:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 134/218 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 5 (OVERLAPS) 16/234 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 226/460 variables, 234/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/460 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 256 constraints, problems are : Problem set: 1 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/64 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 19:43:18] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 153/217 variables, 19/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 19:43:18] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 7 (OVERLAPS) 17/234 variables, 1/24 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-31 19:43:18] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 1/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 226/460 variables, 234/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 1/260 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-31 19:43:18] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 1/261 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/460 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 261 constraints, problems are : Problem set: 2 solved, 1 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 772ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 (NOT p2))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLFireability-09 finished in 62677 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)||G(p1))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 12 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-31 19:43:19] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 19:43:19] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-31 19:43:19] [INFO ] Invariant cache hit.
[2024-05-31 19:43:19] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-31 19:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:43:22] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-05-31 19:43:22] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-31 19:43:22] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:43:22] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-31 19:43:22] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-31 19:43:22] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-05-31 19:43:23] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:43:23] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-05-31 19:43:23] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:43:23] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-05-31 19:43:23] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:43:23] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-31 19:43:23] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-31 19:43:23] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:43:24] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2024-05-31 19:43:24] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:43:24] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-31 19:43:24] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:43:24] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2024-05-31 19:43:24] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:43:26] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:43:26] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:43:26] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:43:26] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:43:26] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-31 19:43:26] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:43:27] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:43:27] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-31 19:43:27] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:43:27] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:43:28] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:43:28] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:43:28] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:43:28] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 18389 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:43:41] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:43:41] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:43:42] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:43:42] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:43:42] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-05-31 19:43:42] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:43:46] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-31 19:43:47] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:43:47] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:43:47] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2024-05-31 19:43:47] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2024-05-31 19:43:47] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:43:53] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:44:03] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/458 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 527 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 48/48 constraints]
After SMT, in 48434ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 48436ms
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48829 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-10
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-10 finished in 48960 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) U (p1&&X(p2))))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 15 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
[2024-05-31 19:44:08] [INFO ] Invariant cache hit.
[2024-05-31 19:44:08] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-31 19:44:08] [INFO ] Invariant cache hit.
[2024-05-31 19:44:08] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-31 19:44:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:44:11] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-05-31 19:44:11] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-31 19:44:11] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:44:11] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-31 19:44:11] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-31 19:44:11] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2024-05-31 19:44:12] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:44:12] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:44:12] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:44:12] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-31 19:44:12] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-31 19:44:12] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:44:12] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:44:12] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-31 19:44:13] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:44:13] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:44:13] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:44:13] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:44:13] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-31 19:44:13] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:44:15] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-31 19:44:15] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-31 19:44:15] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:44:15] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-05-31 19:44:15] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:44:15] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-31 19:44:16] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:44:16] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 15 ms to minimize.
[2024-05-31 19:44:16] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:44:16] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:44:17] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:44:17] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 6 ms to minimize.
[2024-05-31 19:44:17] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-05-31 19:44:17] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 18077 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:44:30] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:44:30] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:44:30] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-31 19:44:31] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:44:31] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2024-05-31 19:44:31] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:44:35] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:44:36] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:44:36] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:44:36] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:44:36] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-31 19:44:36] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:44:42] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:44:52] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/458 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 527 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 48/48 constraints]
After SMT, in 48117ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 48123ms
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48729 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-12
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-12 finished in 48892 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 U p1)) U (p2&&G(!p0)))||X(X(F(p1)))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Applied a total of 26 rules in 20 ms. Remains 234 /246 variables (removed 12) and now considering 226/240 (removed 14) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-31 19:44:56] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 19:44:57] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-31 19:44:57] [INFO ] Invariant cache hit.
[2024-05-31 19:44:57] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-31 19:44:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:00] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:45:00] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
[2024-05-31 19:45:00] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-31 19:45:00] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-05-31 19:45:00] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:45:00] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:45:01] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:45:01] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-31 19:45:01] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:45:01] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:45:01] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:45:01] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-05-31 19:45:01] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:45:01] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:45:02] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 3 ms to minimize.
[2024-05-31 19:45:02] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:04] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:05] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:45:05] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:45:05] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:45:06] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:45:06] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:45:06] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:45:06] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:45:06] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:45:06] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:45:06] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-05-31 19:45:06] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-31 19:45:08] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:08] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:11] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-31 19:45:11] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:45:12] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:13] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:45:13] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:45:13] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2024-05-31 19:45:13] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 226/460 variables, 234/299 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:19] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-31 19:45:19] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-05-31 19:45:19] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/460 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 304 constraints, problems are : Problem set: 0 solved, 225 unsolved in 29289 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/460 variables, 234/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 225/529 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:30] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:45:30] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:45:30] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:45:31] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2024-05-31 19:45:33] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 5/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/460 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 534 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20519 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 53/53 constraints]
After SMT, in 49836ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 49838ms
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 226/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50418 ms. Remains : 234/246 places, 226/240 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-14
Product exploration explored 100000 steps with 912 reset in 137 ms.
Product exploration explored 100000 steps with 911 reset in 157 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/234 stabilizing places and 57/226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 384 steps (0 resets) in 5 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-31 19:45:48] [INFO ] Invariant cache hit.
[2024-05-31 19:45:48] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-31 19:45:48] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:45:48] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-31 19:45:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:45:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-31 19:45:49] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:45:49] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 19:45:49] [INFO ] Computed and/alt/rep : 225/322/225 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-31 19:45:50] [INFO ] Added : 214 causal constraints over 43 iterations in 953 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 234 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Applied a total of 0 rules in 2 ms. Remains 234 /234 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-31 19:45:50] [INFO ] Invariant cache hit.
[2024-05-31 19:45:50] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 19:45:50] [INFO ] Invariant cache hit.
[2024-05-31 19:45:50] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-31 19:45:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:53] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:45:53] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:45:53] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:45:53] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2024-05-31 19:45:53] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-05-31 19:45:53] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:45:53] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-31 19:45:54] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:45:54] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:45:54] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:45:54] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:45:54] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:45:54] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:45:54] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:45:55] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:45:55] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:57] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:45:58] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:45:58] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:45:58] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-05-31 19:45:59] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:45:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-31 19:45:59] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-31 19:45:59] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:45:59] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:45:59] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:45:59] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-31 19:45:59] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 1 ms to minimize.
[2024-05-31 19:46:00] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-05-31 19:46:00] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:46:00] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:46:00] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:46:00] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-31 19:46:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-31 19:46:01] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:46:01] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:46:04] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-05-31 19:46:04] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:46:05] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:46:06] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-05-31 19:46:06] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:46:06] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:46:06] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 226/460 variables, 234/299 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:46:10] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:46:10] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:46:13] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:46:13] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:46:13] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/460 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 304 constraints, problems are : Problem set: 0 solved, 225 unsolved in 29680 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/460 variables, 234/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 225/529 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-31 19:46:23] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:46:23] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:46:24] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-31 19:46:24] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:46:26] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 5/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/460 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 534 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20378 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 53/53 constraints]
After SMT, in 50091ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 50095ms
Finished structural reductions in LTL mode , in 1 iterations and 50439 ms. Remains : 234/234 places, 226/226 transitions.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 466 steps (0 resets) in 5 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-31 19:46:41] [INFO ] Invariant cache hit.
[2024-05-31 19:46:41] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-31 19:46:41] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 19:46:41] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 19:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:46:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-31 19:46:41] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:46:41] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 19:46:41] [INFO ] Computed and/alt/rep : 225/322/225 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-31 19:46:42] [INFO ] Added : 214 causal constraints over 43 iterations in 886 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 914 reset in 291 ms.
Product exploration explored 100000 steps with 912 reset in 409 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 234 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 78 place count 234 transition count 222
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 78 place count 234 transition count 222
Deduced a syphon composed of 109 places in 1 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 113 place count 234 transition count 222
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 175 place count 172 transition count 160
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 237 place count 172 transition count 160
Performed 52 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 172 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 290 place count 172 transition count 155
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 320 place count 142 transition count 125
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 30 rules applied. Total rules applied 350 place count 142 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 351 place count 142 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 352 place count 141 transition count 124
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 353 place count 141 transition count 124
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 353 rules in 44 ms. Remains 141 /234 variables (removed 93) and now considering 124/226 (removed 102) transitions.
[2024-05-31 19:46:44] [INFO ] Redundant transitions in 3 ms returned []
Running 123 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 141 cols
[2024-05-31 19:46:44] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 19:46:44] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-31 19:46:45] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:46:45] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-31 19:46:46] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-31 19:46:47] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-31 19:46:47] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-31 19:46:47] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-31 19:46:47] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 20/42 constraints. Problems are: Problem set: 61 solved, 62 unsolved
[2024-05-31 19:46:47] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:46:47] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-31 19:46:47] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 3/45 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/45 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 124/265 variables, 141/186 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 21/207 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/207 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/207 constraints. Problems are: Problem set: 70 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 207 constraints, problems are : Problem set: 70 solved, 53 unsolved in 5107 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 141/141 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 70 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 67/137 variables, 20/20 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 23/43 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/43 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 4/141 variables, 2/45 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/45 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 124/265 variables, 141/186 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 21/207 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 53/260 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/260 constraints. Problems are: Problem set: 70 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/260 constraints. Problems are: Problem set: 70 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 260 constraints, problems are : Problem set: 70 solved, 53 unsolved in 3332 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 141/141 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 53/123 constraints, Known Traps: 23/23 constraints]
After SMT, in 8495ms problems are : Problem set: 70 solved, 53 unsolved
Search for dead transitions found 70 dead transitions in 8498ms
Found 70 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 70 transitions
Dead transitions reduction (with SMT) removed 70 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 141/234 places, 54/226 transitions.
Graph (complete) has 183 edges and 141 vertex of which 71 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.2 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 71 /141 variables (removed 70) and now considering 54/54 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/234 places, 54/226 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8561 ms. Remains : 71/234 places, 54/226 transitions.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 225
Applied a total of 2 rules in 10 ms. Remains 233 /234 variables (removed 1) and now considering 225/226 (removed 1) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-31 19:46:52] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 19:46:52] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 19:46:52] [INFO ] Invariant cache hit.
[2024-05-31 19:46:52] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-31 19:46:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:46:56] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 4 ms to minimize.
[2024-05-31 19:46:56] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 4 ms to minimize.
[2024-05-31 19:46:56] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:46:57] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:46:57] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:46:57] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 4 ms to minimize.
[2024-05-31 19:46:57] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 4 ms to minimize.
[2024-05-31 19:46:57] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
[2024-05-31 19:46:58] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:46:58] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:46:58] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:46:58] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-05-31 19:46:58] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 4 ms to minimize.
[2024-05-31 19:46:58] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-31 19:46:59] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 4 ms to minimize.
[2024-05-31 19:46:59] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:46:59] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:46:59] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:46:59] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:46:59] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:47:02] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-31 19:47:02] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:47:02] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-31 19:47:02] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:47:02] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-31 19:47:02] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:47:03] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-31 19:47:03] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:47:03] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:47:04] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:47:05] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 4 ms to minimize.
[2024-05-31 19:47:05] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:47:05] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:47:05] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 26647 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:47:25] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 4 ms to minimize.
[2024-05-31 19:47:25] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:47:26] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:47:26] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:47:26] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:47:26] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:47:32] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 4 ms to minimize.
[2024-05-31 19:47:33] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:47:33] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:47:33] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:47:34] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:47:34] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-31 19:47:42] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 56688ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 56692ms
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 225/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57084 ms. Remains : 233/234 places, 225/226 transitions.
Treatment of property AutoFlight-PT-03b-LTLFireability-14 finished in 172771 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))||G((p1||F(p2)))))'
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((G(F(p0))||(p1&&X((p1 U (X(p2)||G(p1)))))))))'
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 U p1)) U (p2&&G(!p0)))||X(X(F(p1)))))'
Found a Shortening insensitive property : AutoFlight-PT-03b-LTLFireability-14
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 245 transition count 156
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 95 rules applied. Total rules applied 178 place count 162 transition count 144
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 186 place count 156 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 188 place count 154 transition count 142
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 188 place count 154 transition count 110
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 252 place count 122 transition count 110
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 257 place count 117 transition count 105
Iterating global reduction 4 with 5 rules applied. Total rules applied 262 place count 117 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 262 place count 117 transition count 103
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 266 place count 115 transition count 103
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 346 place count 75 transition count 59
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 347 place count 75 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 348 place count 74 transition count 58
Reduce places removed 6 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 9 rules applied. Total rules applied 357 place count 68 transition count 55
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 360 place count 65 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 360 place count 65 transition count 52
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 366 place count 62 transition count 52
Applied a total of 366 rules in 25 ms. Remains 62 /246 variables (removed 184) and now considering 52/240 (removed 188) transitions.
// Phase 1: matrix 52 rows 62 cols
[2024-05-31 19:47:50] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:47:50] [INFO ] Implicit Places using invariants in 124 ms returned [24, 35, 46, 50, 61]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 125 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 57/246 places, 52/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 53 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 53 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 52 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 52 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 46
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 16 place count 49 transition count 44
Applied a total of 16 rules in 8 ms. Remains 49 /57 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 49 cols
[2024-05-31 19:47:50] [INFO ] Computed 11 invariants in 0 ms
[2024-05-31 19:47:50] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 19:47:50] [INFO ] Invariant cache hit.
[2024-05-31 19:47:50] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 49/246 places, 44/240 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 345 ms. Remains : 49/246 places, 44/240 transitions.
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-14
Stuttering criterion allowed to conclude after 1918 steps with 224 reset in 6 ms.
Treatment of property AutoFlight-PT-03b-LTLFireability-14 finished in 821 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 19:47:50] [INFO ] Flatten gal took : 28 ms
[2024-05-31 19:47:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-31 19:47:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 246 places, 240 transitions and 580 arcs took 8 ms.
Total runtime 799303 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-03b-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-03b-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-03b-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717185464380

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-03b-LTLFireability-02
ltl formula formula --ltl=/tmp/4246/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 246 places, 240 transitions and 580 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4246/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4246/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4246/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4246/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 248 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 247, there are 275 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~158 levels ~10000 states ~51832 transitions
pnml2lts-mc( 3/ 4): ~158 levels ~20000 states ~116168 transitions
pnml2lts-mc( 3/ 4): ~158 levels ~40000 states ~228480 transitions
pnml2lts-mc( 3/ 4): ~158 levels ~80000 states ~490844 transitions
pnml2lts-mc( 0/ 4): ~157 levels ~160000 states ~297424 transitions
pnml2lts-mc( 0/ 4): ~157 levels ~320000 states ~604316 transitions
pnml2lts-mc( 0/ 4): ~157 levels ~640000 states ~1317324 transitions
pnml2lts-mc( 0/ 4): ~157 levels ~1280000 states ~2622744 transitions
pnml2lts-mc( 0/ 4): ~157 levels ~2560000 states ~5343312 transitions
pnml2lts-mc( 0/ 4): ~220 levels ~5120000 states ~10943852 transitions
pnml2lts-mc( 0/ 4): ~220 levels ~10240000 states ~22186000 transitions
pnml2lts-mc( 0/ 4): ~338 levels ~20480000 states ~47166920 transitions
pnml2lts-mc( 0/ 4): ~1583 levels ~40960000 states ~97157564 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33540908
pnml2lts-mc( 0/ 4): unique states count: 33543731
pnml2lts-mc( 0/ 4): unique transitions count: 269557654
pnml2lts-mc( 0/ 4): - self-loop count: 20
pnml2lts-mc( 0/ 4): - claim dead count: 235997293
pnml2lts-mc( 0/ 4): - claim found count: 3342
pnml2lts-mc( 0/ 4): - claim success count: 33543759
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2119
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33543759 states 269557753 transitions, fanout: 8.036
pnml2lts-mc( 0/ 4): Total exploration time 216.480 sec (216.430 sec minimum, 216.447 sec on average)
pnml2lts-mc( 0/ 4): States per second: 154951, Transitions per second: 1245186
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 268.9MB, 8.4 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/20.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 268.9MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-03b-LTLFireability-07
ltl formula formula --ltl=/tmp/4246/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 246 places, 240 transitions and 580 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4246/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4246/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4246/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4246/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 247 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 247, there are 283 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~170 levels ~10000 states ~26360 transitions
pnml2lts-mc( 1/ 4): ~170 levels ~20000 states ~55120 transitions
pnml2lts-mc( 1/ 4): ~170 levels ~40000 states ~119724 transitions
pnml2lts-mc( 1/ 4): ~170 levels ~80000 states ~240540 transitions
pnml2lts-mc( 3/ 4): ~156 levels ~160000 states ~834364 transitions
pnml2lts-mc( 3/ 4): ~156 levels ~320000 states ~1763040 transitions
pnml2lts-mc( 1/ 4): ~181 levels ~640000 states ~2215464 transitions
pnml2lts-mc( 1/ 4): ~215 levels ~1280000 states ~4256592 transitions
pnml2lts-mc( 1/ 4): ~230 levels ~2560000 states ~8668812 transitions
pnml2lts-mc( 1/ 4): ~760 levels ~5120000 states ~17878668 transitions
pnml2lts-mc( 1/ 4): ~2043 levels ~10240000 states ~37614884 transitions
pnml2lts-mc( 1/ 4): ~4854 levels ~20480000 states ~77857892 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33487315
pnml2lts-mc( 0/ 4): unique states count: 33517853
pnml2lts-mc( 0/ 4): unique transitions count: 178547902
pnml2lts-mc( 0/ 4): - self-loop count: 77
pnml2lts-mc( 0/ 4): - claim dead count: 144911425
pnml2lts-mc( 0/ 4): - claim found count: 64074
pnml2lts-mc( 0/ 4): - claim success count: 33517875
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18333
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33517876 states 178547973 transitions, fanout: 5.327
pnml2lts-mc( 0/ 4): Total exploration time 191.570 sec (191.520 sec minimum, 191.548 sec on average)
pnml2lts-mc( 0/ 4): States per second: 174964, Transitions per second: 932025
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 280.8MB, 8.8 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/38.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 280.8MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-03b-LTLFireability-14
ltl formula formula --ltl=/tmp/4246/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 246 places, 240 transitions and 580 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4246/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4246/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4246/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4246/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 248 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 247, there are 257 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~147 levels ~10000 states ~27252 transitions
pnml2lts-mc( 0/ 4): ~147 levels ~20000 states ~53632 transitions
pnml2lts-mc( 0/ 4): ~147 levels ~40000 states ~113260 transitions
pnml2lts-mc( 0/ 4): ~147 levels ~80000 states ~232976 transitions
pnml2lts-mc( 0/ 4): ~147 levels ~160000 states ~503416 transitions
pnml2lts-mc( 0/ 4): ~147 levels ~320000 states ~1074476 transitions
pnml2lts-mc( 1/ 4): ~144 levels ~640000 states ~1918144 transitions
pnml2lts-mc( 1/ 4): ~144 levels ~1280000 states ~4025000 transitions
pnml2lts-mc( 1/ 4): ~144 levels ~2560000 states ~8312172 transitions
pnml2lts-mc( 1/ 4): ~144 levels ~5120000 states ~17853932 transitions
pnml2lts-mc( 1/ 4): ~144 levels ~10240000 states ~37670224 transitions
pnml2lts-mc( 1/ 4): ~156 levels ~20480000 states ~77211400 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550053
pnml2lts-mc( 0/ 4): unique states count: 33550538
pnml2lts-mc( 0/ 4): unique transitions count: 155736003
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 122181588
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33550555
pnml2lts-mc( 0/ 4): - cum. max stack depth: 599
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33550555 states 155736043 transitions, fanout: 4.642
pnml2lts-mc( 0/ 4): Total exploration time 183.190 sec (183.130 sec minimum, 183.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 183146, Transitions per second: 850134
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 268.0MB, 8.4 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/18.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 268.0MB (~256.0MB paged-in)

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-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutoFlight-PT-03b, 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 r468-smll-171620167000100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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