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-171620167000099.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167000099
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717183897141

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
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:31:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:31:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:31:39] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-31 19:31:39] [INFO ] Transformed 298 places.
[2024-05-31 19:31:39] [INFO ] Transformed 296 transitions.
[2024-05-31 19:31:39] [INFO ] Found NUPN structural information;
[2024-05-31 19:31:39] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 130 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-03b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 263 transition count 261
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 263 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 263 transition count 258
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 87 place count 249 transition count 244
Iterating global reduction 1 with 14 rules applied. Total rules applied 101 place count 249 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 247 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 247 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 245 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 245 transition count 240
Applied a total of 109 rules in 143 ms. Remains 245 /298 variables (removed 53) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 245 cols
[2024-05-31 19:31:39] [INFO ] Computed 22 invariants in 31 ms
[2024-05-31 19:31:40] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-31 19:31:40] [INFO ] Invariant cache hit.
[2024-05-31 19:31:40] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-31 19:31:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:31:44] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 33 ms to minimize.
[2024-05-31 19:31:44] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-05-31 19:31:44] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:31:44] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:31:44] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:31:44] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:31:45] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:31:46] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:31:46] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 3 ms to minimize.
[2024-05-31 19:31:46] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:31:46] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:31:46] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:31:47] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:31:48] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:31:48] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:31:48] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:31:48] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:31:48] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:31:48] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2024-05-31 19:31:49] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2024-05-31 19:31:49] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:31:49] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:31:49] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:31:49] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:31:49] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:31:50] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:31:50] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 7 ms to minimize.
[2024-05-31 19:31:50] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 3 ms to minimize.
[2024-05-31 19:31:50] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:31:50] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:31:50] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:31:51] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:31:51] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:31:51] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:31:52] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:31:52] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-31 19:31:52] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:31:52] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:31:52] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:31:53] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:31:54] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:31:54] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:31:54] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:31:54] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:31:54] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:31:54] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:31:54] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:31:55] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 5 ms to minimize.
[2024-05-31 19:31:55] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 3 ms to minimize.
[2024-05-31 19:31:55] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:31:55] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:31:55] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:31:56] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 13/83 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:31:58] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:31:58] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:31:58] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 2 ms to minimize.
[2024-05-31 19:31:58] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:31:59] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:31:59] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:32:00] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:32:00] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:32:01] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:32:02] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:32:02] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:32:02] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:32:02] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:32:02] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:32:06] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:32:06] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 19:32:07] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:32:07] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:32:07] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 239 unsolved
SMT process timed out in 30105ms, After SMT, problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 30135ms
Starting structural reductions in LTL mode, iteration 1 : 245/298 places, 240/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31231 ms. Remains : 245/298 places, 240/296 transitions.
Support contains 19 out of 245 places after structural reductions.
[2024-05-31 19:32:11] [INFO ] Flatten gal took : 96 ms
[2024-05-31 19:32:11] [INFO ] Flatten gal took : 24 ms
[2024-05-31 19:32:11] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 40000 steps (251 resets) in 1501 ms. (26 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (25 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
[2024-05-31 19:32:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 196/229 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/245 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:32:12] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:32:12] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:32:12] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:32:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 240/485 variables, 245/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 271 constraints, problems are : Problem set: 0 solved, 2 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 196/229 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:32:12] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:32:12] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/245 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:32:12] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 240/485 variables, 245/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:32:13] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/485 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/485 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 1231ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1232 steps, including 9 resets, run visited all 2 properties in 9 ms. (steps per millisecond=136 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 16 ms.
Computed a total of 63 stabilizing places and 63 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' '!(F(G(p0)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 244 transition count 159
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 91 rules applied. Total rules applied 171 place count 164 transition count 148
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 177 place count 159 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 158 transition count 147
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 178 place count 158 transition count 113
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 246 place count 124 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 121 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 121 transition count 110
Performed 46 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 344 place count 75 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 345 place count 74 transition count 57
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 350 place count 70 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 69 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 351 place count 69 transition count 53
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 357 place count 66 transition count 53
Applied a total of 357 rules in 58 ms. Remains 66 /245 variables (removed 179) and now considering 53/240 (removed 187) transitions.
// Phase 1: matrix 53 rows 66 cols
[2024-05-31 19:32:13] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 19:32:13] [INFO ] Implicit Places using invariants in 88 ms returned [28, 39, 50, 55, 59, 65]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 92 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/245 places, 53/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 55 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 55 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 54 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 53 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 52 transition count 45
Applied a total of 16 rules in 9 ms. Remains 52 /60 variables (removed 8) and now considering 45/53 (removed 8) transitions.
// Phase 1: matrix 45 rows 52 cols
[2024-05-31 19:32:13] [INFO ] Computed 12 invariants in 0 ms
[2024-05-31 19:32:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 19:32:13] [INFO ] Invariant cache hit.
[2024-05-31 19:32:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 19:32:13] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/245 places, 45/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 52/245 places, 45/240 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-01
Product exploration explored 100000 steps with 5193 reset in 481 ms.
Product exploration explored 100000 steps with 5198 reset in 256 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 102 steps (3 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-31 19:32:15] [INFO ] Invariant cache hit.
[2024-05-31 19:32:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 19:32:15] [INFO ] Invariant cache hit.
[2024-05-31 19:32:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 19:32:15] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-31 19:32:15] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-31 19:32:15] [INFO ] Invariant cache hit.
[2024-05-31 19:32:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 3/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 45/97 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 66 constraints, problems are : Problem set: 0 solved, 28 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 3/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 45/97 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 19:32:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 95 constraints, problems are : Problem set: 0 solved, 28 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 1/1 constraints]
After SMT, in 1199ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1200ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1337 ms. Remains : 52/52 places, 45/45 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5193 reset in 153 ms.
Stack based approach found an accepted trace after 39958 steps with 2085 reset with depth 8 and stack size 8 in 122 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-01 finished in 3932 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((G(p1)||p0))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 237 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 237 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 236 transition count 228
Applied a total of 21 rules in 10 ms. Remains 236 /245 variables (removed 9) and now considering 228/240 (removed 12) transitions.
// Phase 1: matrix 228 rows 236 cols
[2024-05-31 19:32:17] [INFO ] Computed 22 invariants in 8 ms
[2024-05-31 19:32:17] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 19:32:17] [INFO ] Invariant cache hit.
[2024-05-31 19:32:17] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-31 19:32:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:20] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-05-31 19:32:20] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:32:20] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:32:20] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:32:20] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:32:20] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:32:21] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 2 ms to minimize.
[2024-05-31 19:32:22] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:32:22] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:32:22] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-31 19:32:22] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:32:22] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:24] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:32:24] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-31 19:32:24] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 3 ms to minimize.
[2024-05-31 19:32:24] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:32:24] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:32:24] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:32:24] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:32:25] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:32:25] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:26] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:32:26] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:32:26] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:32:26] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 228/464 variables, 236/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:30] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:32] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:32:32] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:36] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:39] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 13 (OVERLAPS) 0/464 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 296 constraints, problems are : Problem set: 0 solved, 227 unsolved in 28106 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:47] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-05-31 19:32:47] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:32:48] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:32:48] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:32:48] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:32:48] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:49] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:32:49] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 3 ms to minimize.
[2024-05-31 19:32:49] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:32:50] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:32:50] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:32:50] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 228/464 variables, 236/308 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 227/535 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:32:54] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/464 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 536 constraints, problems are : Problem set: 0 solved, 227 unsolved in 25371 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 51/51 constraints]
After SMT, in 53513ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 53518ms
Starting structural reductions in LTL mode, iteration 1 : 236/245 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53880 ms. Remains : 236/245 places, 228/240 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-03 finished in 54453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F((p1&&X((p2 U p3))))))))'
Support contains 5 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 239 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 237 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 237 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 236 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 235 transition count 228
Applied a total of 22 rules in 24 ms. Remains 235 /245 variables (removed 10) and now considering 228/240 (removed 12) transitions.
// Phase 1: matrix 228 rows 235 cols
[2024-05-31 19:33:11] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 19:33:11] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-31 19:33:11] [INFO ] Invariant cache hit.
[2024-05-31 19:33:12] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-31 19:33:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:14] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:33:14] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 4 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:33:15] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:33:16] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-31 19:33:16] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:33:16] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:33:16] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:33:16] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:33:17] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:19] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:20] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:21] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:33:21] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:33:21] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:33:21] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:33:22] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:24] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:33:24] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:33:25] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:26] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:27] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:30] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:33:30] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:33:30] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:33:30] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:33:31] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:33:31] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (OVERLAPS) 228/463 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:35] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:37] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 297 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:44] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:33:44] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:33:44] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:33:44] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:33:44] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:33:44] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:33:44] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:33:44] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-31 19:33:45] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:33:46] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/463 variables, 235/315 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 227/542 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-31 19:33:48] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:33:49] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:33:49] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:33:53] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-31 19:33:54] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:33:54] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 3/549 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/463 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 549 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 65/65 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 235/245 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 235/245 places, 228/240 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-05
Product exploration explored 100000 steps with 1763 reset in 173 ms.
Product exploration explored 100000 steps with 1762 reset in 186 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p2), (X (NOT p3)), (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X p2)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 132 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (248 resets) in 243 ms. (163 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (28 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
[2024-05-31 19:34:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/235 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:34:13] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:34:13] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 228/463 variables, 235/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/235 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:34:13] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 228/463 variables, 235/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/463 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 803ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 137 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p2), (X (NOT p3)), (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X p2)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 p3 p2))), (F p3), (F (NOT p2)), (F p1)]
Knowledge based reduction with 17 factoid took 508 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
[2024-05-31 19:34:15] [INFO ] Invariant cache hit.
[2024-05-31 19:34:15] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-31 19:34:15] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:34:15] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-31 19:34:15] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-31 19:34:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:34:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-31 19:34:15] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:34:16] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-31 19:34:16] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-31 19:34:17] [INFO ] Added : 205 causal constraints over 41 iterations in 1155 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-31 19:34:17] [INFO ] Invariant cache hit.
[2024-05-31 19:34:17] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-31 19:34:17] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:34:17] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 19:34:17] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-31 19:34:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:34:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-31 19:34:17] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:34:17] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 19:34:17] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-31 19:34:18] [INFO ] Added : 209 causal constraints over 42 iterations in 874 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 228/228 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-31 19:34:18] [INFO ] Invariant cache hit.
[2024-05-31 19:34:18] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 19:34:18] [INFO ] Invariant cache hit.
[2024-05-31 19:34:19] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-31 19:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:22] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 4 ms to minimize.
[2024-05-31 19:34:22] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 4 ms to minimize.
[2024-05-31 19:34:22] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 4 ms to minimize.
[2024-05-31 19:34:23] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 4 ms to minimize.
[2024-05-31 19:34:23] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:34:23] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:34:23] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2024-05-31 19:34:23] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:34:23] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 4 ms to minimize.
[2024-05-31 19:34:24] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:34:24] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:34:24] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-05-31 19:34:24] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-31 19:34:24] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:34:24] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:34:24] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 4 ms to minimize.
[2024-05-31 19:34:25] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:34:25] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-31 19:34:26] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:34:26] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:29] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:31] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:33] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:34:33] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 5 ms to minimize.
[2024-05-31 19:34:33] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:34:33] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 4 ms to minimize.
[2024-05-31 19:34:34] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:38] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:34:38] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 4 ms to minimize.
[2024-05-31 19:34:39] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:41] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:43] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:47] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:34:47] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:34:47] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:34:47] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:34:47] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:34:48] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/463 variables, and 60 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:50] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:34:51] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:34:51] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 4 ms to minimize.
[2024-05-31 19:34:51] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 2 ms to minimize.
[2024-05-31 19:34:51] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:34:51] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-05-31 19:34:51] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:54] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:34:54] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:34:54] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
[2024-05-31 19:34:54] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:34:54] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:34:54] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-31 19:34:55] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:57] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:34:57] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:34:57] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:34:59] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:35:00] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 228/463 variables, 235/314 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 227/541 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:05] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:35:05] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 543 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 59/59 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in LTL mode , in 1 iterations and 60419 ms. Remains : 235/235 places, 228/228 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p2), (X (NOT p3)), (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X p2)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 143 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (248 resets) in 156 ms. (254 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (26 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-05-31 19:35:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/235 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:35:19] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:35:19] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 228/463 variables, 235/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/235 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:35:20] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 228/463 variables, 235/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/463 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 854ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 138 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=69 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p2), (X (NOT p3)), (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X p2)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 p3 p2))), (F p3), (F (NOT p2)), (F p1)]
Knowledge based reduction with 17 factoid took 507 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
[2024-05-31 19:35:21] [INFO ] Invariant cache hit.
[2024-05-31 19:35:21] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-31 19:35:21] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:35:21] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-05-31 19:35:21] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-31 19:35:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:35:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-31 19:35:22] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:35:22] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-05-31 19:35:22] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-31 19:35:23] [INFO ] Added : 205 causal constraints over 41 iterations in 1344 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-31 19:35:23] [INFO ] Invariant cache hit.
[2024-05-31 19:35:24] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-31 19:35:24] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 19:35:24] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-31 19:35:24] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-31 19:35:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:35:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-31 19:35:24] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 19:35:24] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-05-31 19:35:24] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-31 19:35:26] [INFO ] Added : 209 causal constraints over 42 iterations in 1266 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 1682 reset in 202 ms.
Product exploration explored 100000 steps with 1750 reset in 213 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-31 19:35:27] [INFO ] Invariant cache hit.
[2024-05-31 19:35:27] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 19:35:27] [INFO ] Invariant cache hit.
[2024-05-31 19:35:27] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-31 19:35:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:31] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 4 ms to minimize.
[2024-05-31 19:35:31] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 4 ms to minimize.
[2024-05-31 19:35:31] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
[2024-05-31 19:35:32] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 4 ms to minimize.
[2024-05-31 19:35:32] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 3 ms to minimize.
[2024-05-31 19:35:32] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 3 ms to minimize.
[2024-05-31 19:35:32] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:35:32] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 3 ms to minimize.
[2024-05-31 19:35:32] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 4 ms to minimize.
[2024-05-31 19:35:33] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:35:33] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:35:33] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:35:33] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:35:33] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:35:33] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:35:33] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 4 ms to minimize.
[2024-05-31 19:35:34] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:35:34] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:35:34] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:35:35] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:37] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:39] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:41] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:35:41] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:35:41] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:35:41] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:35:42] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:46] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 4 ms to minimize.
[2024-05-31 19:35:46] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:35:47] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:49] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:51] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:35:55] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-31 19:35:55] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:35:55] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:35:56] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:35:56] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:35:56] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/463 variables, and 60 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:36:00] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 4 ms to minimize.
[2024-05-31 19:36:00] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:36:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:36:00] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-31 19:36:00] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:36:00] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-05-31 19:36:01] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:36:03] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 11 ms to minimize.
[2024-05-31 19:36:03] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:36:03] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-31 19:36:03] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:36:03] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:36:03] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:36:04] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:36:06] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-31 19:36:06] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:36:06] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:36:08] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:36:09] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 228/463 variables, 235/314 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 227/541 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:36:14] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:36:14] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 543 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 59/59 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Finished structural reductions in LTL mode , in 1 iterations and 60456 ms. Remains : 235/235 places, 228/228 transitions.
Treatment of property AutoFlight-PT-03b-LTLCardinality-05 finished in 195842 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)||F(p1))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 235 transition count 227
Applied a total of 23 rules in 16 ms. Remains 235 /245 variables (removed 10) and now considering 227/240 (removed 13) transitions.
// Phase 1: matrix 227 rows 235 cols
[2024-05-31 19:36:27] [INFO ] Computed 22 invariants in 5 ms
[2024-05-31 19:36:27] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 19:36:27] [INFO ] Invariant cache hit.
[2024-05-31 19:36:28] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-31 19:36:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:36:32] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 5 ms to minimize.
[2024-05-31 19:36:32] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:36:32] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:36:32] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:36:32] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:36:32] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:36:32] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
[2024-05-31 19:36:33] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 4 ms to minimize.
[2024-05-31 19:36:33] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 4 ms to minimize.
[2024-05-31 19:36:33] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 4 ms to minimize.
[2024-05-31 19:36:33] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 3 ms to minimize.
[2024-05-31 19:36:33] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:36:33] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 4 ms to minimize.
[2024-05-31 19:36:34] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:36:34] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:36:34] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:36:34] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:36:34] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 4 ms to minimize.
[2024-05-31 19:36:34] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:36:35] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:36:37] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
[2024-05-31 19:36:37] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 4 ms to minimize.
[2024-05-31 19:36:38] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 3 ms to minimize.
[2024-05-31 19:36:38] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:36:38] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:36:38] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 3 ms to minimize.
[2024-05-31 19:36:39] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2024-05-31 19:36:39] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 3 ms to minimize.
[2024-05-31 19:36:39] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:36:39] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 3 ms to minimize.
[2024-05-31 19:36:39] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:36:41] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:36:41] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:36:42] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:36:42] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:36:42] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:36:43] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:36:44] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:36:44] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-31 19:36:44] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:36:48] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:36:48] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:36:50] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:36:51] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:36:52] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-31 19:36:52] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:36:53] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:36:53] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:36:53] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:36:53] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:36:57] [INFO ] Deduced a trap composed of 47 places in 126 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 235/462 variables, and 76 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 54/76 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:01] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:37:02] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:03] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/462 variables, 235/314 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 226/540 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:08] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:37:09] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:37:09] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:37:10] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:15] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 545 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 62/62 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 235/245 places, 227/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60557 ms. Remains : 235/245 places, 227/240 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-08
Product exploration explored 100000 steps with 1469 reset in 191 ms.
Product exploration explored 100000 steps with 1435 reset in 237 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 337 steps (0 resets) in 6 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 196 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)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-31 19:37:29] [INFO ] Invariant cache hit.
[2024-05-31 19:37:29] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-31 19:37:29] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:37:30] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-31 19:37:30] [INFO ] Computed and/alt/rep : 226/323/226 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-31 19:37:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:37:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-31 19:37:30] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 19:37:30] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-05-31 19:37:30] [INFO ] Computed and/alt/rep : 226/323/226 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-31 19:37:32] [INFO ] Added : 209 causal constraints over 42 iterations in 1291 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-31 19:37:32] [INFO ] Invariant cache hit.
[2024-05-31 19:37:32] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 19:37:32] [INFO ] Invariant cache hit.
[2024-05-31 19:37:32] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-31 19:37:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:36] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 4 ms to minimize.
[2024-05-31 19:37:36] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 4 ms to minimize.
[2024-05-31 19:37:37] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 4 ms to minimize.
[2024-05-31 19:37:37] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2024-05-31 19:37:37] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 4 ms to minimize.
[2024-05-31 19:37:37] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 4 ms to minimize.
[2024-05-31 19:37:37] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 4 ms to minimize.
[2024-05-31 19:37:38] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 4 ms to minimize.
[2024-05-31 19:37:38] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 4 ms to minimize.
[2024-05-31 19:37:38] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 3 ms to minimize.
[2024-05-31 19:37:38] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 3 ms to minimize.
[2024-05-31 19:37:38] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:37:38] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:37:38] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:37:39] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:37:39] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:37:39] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:37:39] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 4 ms to minimize.
[2024-05-31 19:37:39] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:37:40] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:42] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 4 ms to minimize.
[2024-05-31 19:37:42] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:37:42] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:37:42] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:37:43] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:37:43] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:37:43] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-31 19:37:44] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:37:44] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:37:44] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-31 19:37:44] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:46] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-31 19:37:46] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:37:47] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 4 ms to minimize.
[2024-05-31 19:37:47] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:37:47] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:48] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:37:48] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:37:49] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-31 19:37:49] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:53] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:37:53] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:55] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:37:56] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-31 19:37:58] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:37:59] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:37:59] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:38:02] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/462 variables, and 73 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: 0/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 51/73 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:38:05] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-31 19:38:06] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/462 variables, 235/310 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 226/536 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:38:10] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-31 19:38:11] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:38:11] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:38:11] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:38:12] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 5/541 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:38:17] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-05-31 19:38:17] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-31 19:38:32] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 544 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 61/61 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in LTL mode , in 1 iterations and 60546 ms. Remains : 235/235 places, 227/227 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 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 147 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 313 steps (0 resets) in 7 ms. (39 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 134 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 144 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-31 19:38:33] [INFO ] Invariant cache hit.
[2024-05-31 19:38:33] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-31 19:38:33] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:38:33] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-31 19:38:33] [INFO ] Computed and/alt/rep : 226/323/226 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-31 19:38:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:38:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-31 19:38:34] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 19:38:34] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-05-31 19:38:34] [INFO ] Computed and/alt/rep : 226/323/226 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-31 19:38:35] [INFO ] Added : 209 causal constraints over 42 iterations in 1439 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1477 reset in 226 ms.
Product exploration explored 100000 steps with 1472 reset in 253 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 227/227 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 235 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 235 transition count 224
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 76 place count 235 transition count 224
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 109 place count 235 transition count 224
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 169 place count 175 transition count 164
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 229 place count 175 transition count 164
Performed 55 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 284 place count 175 transition count 158
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 318 place count 141 transition count 124
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 352 place count 141 transition count 124
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 352 rules in 82 ms. Remains 141 /235 variables (removed 94) and now considering 124/227 (removed 103) transitions.
[2024-05-31 19:38:36] [INFO ] Redundant transitions in 5 ms returned []
Running 123 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 141 cols
[2024-05-31 19:38:36] [INFO ] Computed 22 invariants in 7 ms
[2024-05-31 19:38:36] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-31 19:38:38] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:38:38] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 4 ms to minimize.
[2024-05-31 19:38:38] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:38:38] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:38:38] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-31 19:38:39] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 20/42 constraints. Problems are: Problem set: 64 solved, 59 unsolved
[2024-05-31 19:38:40] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/43 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/43 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 124/265 variables, 141/184 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 21/205 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/205 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/205 constraints. Problems are: Problem set: 68 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 205 constraints, problems are : Problem set: 68 solved, 55 unsolved in 5714 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: 21/21 constraints]
Escalating to Integer solving :Problem set: 68 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 65/137 variables, 20/20 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 21/41 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/41 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 4/141 variables, 2/43 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/43 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 124/265 variables, 141/184 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 21/205 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 55/260 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/260 constraints. Problems are: Problem set: 68 solved, 55 unsolved
[2024-05-31 19:38:45] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/265 variables, 1/261 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/261 constraints. Problems are: Problem set: 68 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/261 constraints. Problems are: Problem set: 68 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 261 constraints, problems are : Problem set: 68 solved, 55 unsolved in 6154 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: 55/123 constraints, Known Traps: 22/22 constraints]
After SMT, in 11924ms problems are : Problem set: 68 solved, 55 unsolved
Search for dead transitions found 68 dead transitions in 11927ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 141/235 places, 56/227 transitions.
Graph (complete) has 186 edges and 141 vertex of which 73 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.3 ms
Discarding 68 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 73 /141 variables (removed 68) and now considering 56/56 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/235 places, 56/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12031 ms. Remains : 73/235 places, 56/227 transitions.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 233 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 233 transition count 225
Applied a total of 4 rules in 16 ms. Remains 233 /235 variables (removed 2) and now considering 225/227 (removed 2) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-31 19:38:48] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 19:38:48] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 19:38:48] [INFO ] Invariant cache hit.
[2024-05-31 19:38:49] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-31 19:38:49] [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:38:52] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 4 ms to minimize.
[2024-05-31 19:38:53] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:38:53] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 3 ms to minimize.
[2024-05-31 19:38:53] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 3 ms to minimize.
[2024-05-31 19:38:53] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 4 ms to minimize.
[2024-05-31 19:38:53] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 4 ms to minimize.
[2024-05-31 19:38:54] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 4 ms to minimize.
[2024-05-31 19:38:54] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:38:54] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:38:54] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:38:54] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:38:54] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-05-31 19:38:54] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:38:55] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 4 ms to minimize.
[2024-05-31 19:38:55] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 3 ms to minimize.
[2024-05-31 19:38:55] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:38:55] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:38:55] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:38:55] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:38:56] [INFO ] Deduced a trap composed of 54 places in 107 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:38:58] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:38:58] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:38:58] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-31 19:38:58] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:38:58] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-31 19:38:58] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:38:59] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:38:59] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:38:59] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 3 ms to minimize.
[2024-05-31 19:39:00] [INFO ] Deduced a trap composed of 51 places in 144 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:39:01] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 4 ms to minimize.
[2024-05-31 19:39:01] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:39:01] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:39:01] [INFO ] Deduced a trap composed of 44 places in 129 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 26770 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:39:22] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-31 19:39:22] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:39:22] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 4 ms to minimize.
[2024-05-31 19:39:23] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:39:23] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:39:23] [INFO ] Deduced a trap composed of 48 places in 112 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:39:28] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 4 ms to minimize.
[2024-05-31 19:39:29] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:39:29] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-31 19:39:29] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:39:30] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:39:30] [INFO ] Deduced a trap composed of 46 places in 98 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:39:38] [INFO ] Deduced a trap composed of 19 places in 97 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 56819ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 56824ms
Starting structural reductions in LTL mode, iteration 1 : 233/235 places, 225/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57322 ms. Remains : 233/235 places, 225/227 transitions.
Treatment of property AutoFlight-PT-03b-LTLCardinality-08 finished in 198593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 239 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 237 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 237 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 236 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 236 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 235 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 235 transition count 229
Applied a total of 21 rules in 24 ms. Remains 235 /245 variables (removed 10) and now considering 229/240 (removed 11) transitions.
// Phase 1: matrix 229 rows 235 cols
[2024-05-31 19:39:46] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 19:39:46] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-31 19:39:46] [INFO ] Invariant cache hit.
[2024-05-31 19:39:46] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-31 19:39:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:39:51] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 4 ms to minimize.
[2024-05-31 19:39:51] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 4 ms to minimize.
[2024-05-31 19:39:51] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 3 ms to minimize.
[2024-05-31 19:39:51] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 4 ms to minimize.
[2024-05-31 19:39:51] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:39:52] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 4 ms to minimize.
[2024-05-31 19:39:52] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:39:52] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 4 ms to minimize.
[2024-05-31 19:39:52] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:39:52] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:39:52] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:39:53] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:39:56] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-31 19:39:56] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:39:57] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:39:57] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:39:57] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:39:57] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:39:57] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:39:57] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:39:58] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:39:58] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-05-31 19:39:58] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:39:58] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:39:58] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-31 19:39:59] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-31 19:39:59] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:39:59] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:39:59] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:40:00] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:40:00] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:40:00] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:01] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:40:01] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:40:01] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:40:01] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:03] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:07] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-31 19:40:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-31 19:40:08] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:40:08] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 229/464 variables, 235/298 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:15] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:40:15] [INFO ] Deduced a trap composed of 57 places in 84 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 464/464 variables, and 300 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 43/65 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:19] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:40:19] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:40:19] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 4 ms to minimize.
[2024-05-31 19:40:20] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:40:21] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:22] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:24] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:40:25] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:27] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:29] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:40:29] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-05-31 19:40:29] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:40:29] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:40:29] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 229/464 variables, 235/314 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 228/542 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-31 19:40:35] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:40:35] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:40:35] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:40:35] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 546 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 61/61 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 235/245 places, 229/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60581 ms. Remains : 235/245 places, 229/240 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-09 finished in 60945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 237 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 237 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 233 transition count 225
Applied a total of 27 rules in 28 ms. Remains 233 /245 variables (removed 12) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-31 19:40:47] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 19:40:47] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-31 19:40:47] [INFO ] Invariant cache hit.
[2024-05-31 19:40:47] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-31 19:40:47] [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:40:50] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 4 ms to minimize.
[2024-05-31 19:40:51] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 4 ms to minimize.
[2024-05-31 19:40:51] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 4 ms to minimize.
[2024-05-31 19:40:51] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 3 ms to minimize.
[2024-05-31 19:40:51] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 4 ms to minimize.
[2024-05-31 19:40:51] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 3 ms to minimize.
[2024-05-31 19:40:51] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:40:52] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:40:52] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:40:52] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:40:52] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 4 ms to minimize.
[2024-05-31 19:40:52] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
[2024-05-31 19:40:52] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:40:53] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:40:53] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:40:53] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:40:53] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:40:53] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:40:53] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:40:53] [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:40:56] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:40:56] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:40:56] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:40:56] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
[2024-05-31 19:40:56] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:40:56] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:40:57] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:40:57] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:40:57] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:40:57] [INFO ] Deduced a trap composed of 51 places in 73 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:40:58] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:40:58] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:40:58] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:40:59] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 4 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 26186 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:41:19] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:41:20] [INFO ] Deduced a trap composed of 48 places in 116 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:41:26] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:41:27] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:41:27] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:41:27] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:41:27] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:41:27] [INFO ] Deduced a trap composed of 46 places in 114 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:41:36] [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
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 30013 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 56231ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 56236ms
Starting structural reductions in LTL mode, iteration 1 : 233/245 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56786 ms. Remains : 233/245 places, 225/240 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 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
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-10 finished in 57211 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 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 238 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 238 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 238 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 237 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 236 transition count 228
Applied a total of 21 rules in 22 ms. Remains 236 /245 variables (removed 9) and now considering 228/240 (removed 12) transitions.
// Phase 1: matrix 228 rows 236 cols
[2024-05-31 19:41:44] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 19:41:44] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-31 19:41:44] [INFO ] Invariant cache hit.
[2024-05-31 19:41:44] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-31 19:41:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:41:49] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 4 ms to minimize.
[2024-05-31 19:41:49] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 4 ms to minimize.
[2024-05-31 19:41:49] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 4 ms to minimize.
[2024-05-31 19:41:49] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 4 ms to minimize.
[2024-05-31 19:41:49] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 4 ms to minimize.
[2024-05-31 19:41:50] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 4 ms to minimize.
[2024-05-31 19:41:50] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 4 ms to minimize.
[2024-05-31 19:41:50] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 4 ms to minimize.
[2024-05-31 19:41:50] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 4 ms to minimize.
[2024-05-31 19:41:50] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:41:51] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 3 ms to minimize.
[2024-05-31 19:41:51] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 4 ms to minimize.
[2024-05-31 19:41:51] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:41:51] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 3 ms to minimize.
[2024-05-31 19:41:51] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-05-31 19:41:52] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:41:52] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:41:52] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 4 ms to minimize.
[2024-05-31 19:41:52] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:41:53] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:41:55] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 3 ms to minimize.
[2024-05-31 19:41:56] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:41:57] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 3 ms to minimize.
[2024-05-31 19:41:58] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:41:58] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:41:58] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:41:58] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-31 19:41:58] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:41:58] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:41:59] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:01] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:04] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:42:04] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:42:04] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:42:04] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:06] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:42:06] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:42:06] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:42:06] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:42:07] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:08] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 4 ms to minimize.
[2024-05-31 19:42:09] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 3 ms to minimize.
[2024-05-31 19:42:09] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:42:09] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:42:09] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:12] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/464 variables, and 68 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:17] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:42:17] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:42:18] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:42:18] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:42:18] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:20] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:42:20] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:42:20] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 228/464 variables, 236/312 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 227/539 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:25] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:42:25] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:42:25] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:42:25] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:42:25] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:42:25] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:42:26] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:42:26] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:42:26] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:42:27] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:42:27] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-31 19:42:27] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:42:31] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 13/552 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:36] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 19:42:43] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(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 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 554 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 69/69 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 236/245 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60599 ms. Remains : 236/245 places, 228/240 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-12
Product exploration explored 100000 steps with 624 reset in 239 ms.
Product exploration explored 100000 steps with 626 reset in 272 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (250 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (25 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7501 steps, run visited all 1 properties in 44 ms. (steps per millisecond=170 )
Probabilistic random walk after 7501 steps, saw 2932 distinct states, run finished after 49 ms. (steps per millisecond=153 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-12 finished in 61631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F((p1&&X((p2 U p3))))))))'
Found a Shortening insensitive property : AutoFlight-PT-03b-LTLCardinality-05
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 5 out of 245 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 244 transition count 161
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 89 rules applied. Total rules applied 167 place count 166 transition count 150
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 174 place count 160 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 159 transition count 149
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 175 place count 159 transition count 117
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 239 place count 127 transition count 117
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 243 place count 123 transition count 113
Iterating global reduction 4 with 4 rules applied. Total rules applied 247 place count 123 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 247 place count 123 transition count 112
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 249 place count 122 transition count 112
Performed 46 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 341 place count 76 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 342 place count 75 transition count 59
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 347 place count 71 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 348 place count 70 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 348 place count 70 transition count 55
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 354 place count 67 transition count 55
Applied a total of 354 rules in 48 ms. Remains 67 /245 variables (removed 178) and now considering 55/240 (removed 185) transitions.
// Phase 1: matrix 55 rows 67 cols
[2024-05-31 19:42:46] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 19:42:46] [INFO ] Implicit Places using invariants in 115 ms returned [28, 40, 51, 56, 60, 66]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 125 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 61/245 places, 55/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 57 transition count 51
Applied a total of 8 rules in 5 ms. Remains 57 /61 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 57 cols
[2024-05-31 19:42:46] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:42:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 19:42:46] [INFO ] Invariant cache hit.
[2024-05-31 19:42:46] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 57/245 places, 51/240 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 382 ms. Remains : 57/245 places, 51/240 transitions.
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-05
Product exploration explored 100000 steps with 11290 reset in 267 ms.
Stack based approach found an accepted trace after 5522 steps with 620 reset with depth 4 and stack size 4 in 16 ms.
Treatment of property AutoFlight-PT-03b-LTLCardinality-05 finished in 976 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
[2024-05-31 19:42:47] [INFO ] Flatten gal took : 26 ms
[2024-05-31 19:42:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-31 19:42:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 245 places, 240 transitions and 580 arcs took 10 ms.
Total runtime 668211 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-03b-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-03b-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717184808514

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-03b-LTLCardinality-05
ltl formula formula --ltl=/tmp/3389/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 245 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.120 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3389/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3389/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3389/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3389/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 247 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 246, there are 298 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): ~163 levels ~10000 states ~23944 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~20000 states ~49612 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~40000 states ~102156 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~80000 states ~205992 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~160000 states ~448108 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~320000 states ~973332 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~640000 states ~1980480 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~1280000 states ~4183272 transitions
pnml2lts-mc( 1/ 4): ~170 levels ~2560000 states ~8144788 transitions
pnml2lts-mc( 1/ 4): ~170 levels ~5120000 states ~16746704 transitions
pnml2lts-mc( 1/ 4): ~170 levels ~10240000 states ~34648428 transitions
pnml2lts-mc( 1/ 4): ~170 levels ~20480000 states ~73692092 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551075
pnml2lts-mc( 0/ 4): unique states count: 33551569
pnml2lts-mc( 0/ 4): unique transitions count: 157632460
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 124078075
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551582
pnml2lts-mc( 0/ 4): - cum. max stack depth: 622
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551582 states 157632487 transitions, fanout: 4.698
pnml2lts-mc( 0/ 4): Total exploration time 196.900 sec (196.880 sec minimum, 196.887 sec on average)
pnml2lts-mc( 0/ 4): States per second: 170399, Transitions per second: 800571
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 271.2MB, 8.5 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/23.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: 271.2MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-03b-LTLCardinality-08
ltl formula formula --ltl=/tmp/3389/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 245 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.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3389/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3389/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3389/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3389/ltl_1_
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 247 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 246, there are 265 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): ~155 levels ~10000 states ~28096 transitions
pnml2lts-mc( 0/ 4): ~155 levels ~20000 states ~58780 transitions
pnml2lts-mc( 0/ 4): ~155 levels ~40000 states ~124576 transitions
pnml2lts-mc( 3/ 4): ~155 levels ~80000 states ~233272 transitions
pnml2lts-mc( 3/ 4): ~155 levels ~160000 states ~473372 transitions
pnml2lts-mc( 3/ 4): ~155 levels ~320000 states ~1020988 transitions
pnml2lts-mc( 3/ 4): ~155 levels ~640000 states ~2027548 transitions
pnml2lts-mc( 3/ 4): ~155 levels ~1280000 states ~4336932 transitions
pnml2lts-mc( 3/ 4): ~155 levels ~2560000 states ~9308488 transitions
pnml2lts-mc( 3/ 4): ~155 levels ~5120000 states ~19174680 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~252!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7519160
pnml2lts-mc( 0/ 4): unique states count: 7519792
pnml2lts-mc( 0/ 4): unique transitions count: 33597568
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 26074215
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 7519810
pnml2lts-mc( 0/ 4): - cum. max stack depth: 741
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7519810 states 33597606 transitions, fanout: 4.468
pnml2lts-mc( 0/ 4): Total exploration time 43.080 sec (43.080 sec minimum, 43.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 174555, Transitions per second: 779889
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 59.9MB, 8.3 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/3.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: 59.9MB (~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="LTLCardinality"
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 LTLCardinality"
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-171620167000099"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;