Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729500540.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is AutoFlight-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729500540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 85K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748629350017

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 18:22:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 18:22:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 18:22:31] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-05-30 18:22:31] [INFO ] Transformed 307 places.
[2025-05-30 18:22:31] [INFO ] Transformed 305 transitions.
[2025-05-30 18:22:31] [INFO ] Found NUPN structural information;
[2025-05-30 18:22:31] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
Support contains 59 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 30 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2025-05-30 18:22:31] [INFO ] Computed 76 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:33] [INFO ] Implicit Places using invariants in 2090 ms returned [21, 28, 56, 63, 70, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 182, 232, 238, 244, 250, 256, 262, 268, 274, 280, 292, 298, 304]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 2126 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 278/307 places, 245/245 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 267 transition count 234
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 267 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 266 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 266 transition count 233
Applied a total of 24 rules in 26 ms. Remains 266 /278 variables (removed 12) and now considering 233/245 (removed 12) transitions.
// Phase 1: matrix 233 rows 266 cols
[2025-05-30 18:22:33] [INFO ] Computed 47 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:33] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-05-30 18:22:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:34] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-30 18:22:34] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 266/307 places, 233/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2686 ms. Remains : 266/307 places, 233/245 transitions.
Support contains 59 out of 266 places after structural reductions.
[2025-05-30 18:22:34] [INFO ] Flatten gal took : 37 ms
[2025-05-30 18:22:34] [INFO ] Flatten gal took : 17 ms
[2025-05-30 18:22:34] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 58 out of 266 places (down from 59) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 46 to 45
RANDOM walk for 40000 steps (749 resets) in 1989 ms. (20 steps per ms) remains 6/45 properties
BEST_FIRST walk for 40004 steps (44 resets) in 118 ms. (336 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 98 ms. (404 steps per ms) remains 3/4 properties
[2025-05-30 18:22:35] [INFO ] Invariant cache hit.
[2025-05-30 18:22:35] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 256/266 variables, 44/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 233/499 variables, 266/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 28/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 341 constraints, problems are : Problem set: 0 solved, 3 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 266/266 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 256/266 variables, 44/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:22:35] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 233/499 variables, 266/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 28/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 266/266 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 858ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 21 ms.
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 233/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 266 transition count 187
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 220 transition count 187
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 92 place count 220 transition count 154
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 158 place count 187 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 185 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 185 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 184 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 184 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 183 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 183 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 182 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 182 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 181 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 181 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 180 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 180 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 179 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 179 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 178 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 178 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 177 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 177 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 176 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 176 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 175 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 175 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 174 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 174 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 173 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 173 transition count 140
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 232 place count 150 transition count 117
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 256 place count 150 transition count 93
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 280 place count 126 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 125 transition count 92
Reduce places removed 43 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 3 with 100 rules applied. Total rules applied 381 place count 82 transition count 35
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 438 place count 25 transition count 35
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 438 place count 25 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 446 place count 21 transition count 31
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 457 place count 10 transition count 20
Iterating global reduction 5 with 11 rules applied. Total rules applied 468 place count 10 transition count 20
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 478 place count 10 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 480 place count 9 transition count 9
Applied a total of 480 rules in 95 ms. Remains 9 /266 variables (removed 257) and now considering 9/233 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 9/266 places, 9/233 transitions.
RANDOM walk for 64 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Computed a total of 9 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(!(X(!X(!p0))&&F(X(G(p1))))) U p1)))'
Support contains 2 out of 266 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 266 transition count 187
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 220 transition count 187
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 92 place count 220 transition count 154
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 158 place count 187 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 185 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 185 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 184 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 184 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 183 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 183 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 182 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 182 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 181 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 181 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 180 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 180 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 179 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 179 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 178 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 178 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 177 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 177 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 176 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 176 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 175 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 175 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 174 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 174 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 173 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 173 transition count 140
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 232 place count 150 transition count 117
Applied a total of 232 rules in 63 ms. Remains 150 /266 variables (removed 116) and now considering 117/233 (removed 116) transitions.
// Phase 1: matrix 117 rows 150 cols
[2025-05-30 18:22:37] [INFO ] Computed 47 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:37] [INFO ] Implicit Places using invariants in 118 ms returned [5, 10, 23, 28, 33, 50, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 137, 149]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 119 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/266 places, 117/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 128 transition count 91
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 102 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 101 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 101 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 99 transition count 88
Applied a total of 58 rules in 9 ms. Remains 99 /128 variables (removed 29) and now considering 88/117 (removed 29) transitions.
// Phase 1: matrix 88 rows 99 cols
[2025-05-30 18:22:37] [INFO ] Computed 25 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:37] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-30 18:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-30 18:22:37] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/266 places, 88/233 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 341 ms. Remains : 99/266 places, 88/233 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-00
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-00 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 266 transition count 187
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 220 transition count 187
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 92 place count 220 transition count 154
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 158 place count 187 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 185 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 185 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 184 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 184 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 183 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 183 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 182 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 182 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 181 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 181 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 180 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 180 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 179 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 179 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 178 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 178 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 177 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 177 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 176 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 176 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 175 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 175 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 174 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 174 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 173 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 173 transition count 140
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 232 place count 150 transition count 117
Applied a total of 232 rules in 54 ms. Remains 150 /266 variables (removed 116) and now considering 117/233 (removed 116) transitions.
// Phase 1: matrix 117 rows 150 cols
[2025-05-30 18:22:37] [INFO ] Computed 47 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:37] [INFO ] Implicit Places using invariants in 115 ms returned [5, 10, 23, 28, 33, 51, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 137, 149]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 116 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/266 places, 117/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 128 transition count 92
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 103 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 102 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 102 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 100 transition count 89
Applied a total of 56 rules in 9 ms. Remains 100 /128 variables (removed 28) and now considering 89/117 (removed 28) transitions.
// Phase 1: matrix 89 rows 100 cols
[2025-05-30 18:22:37] [INFO ] Computed 25 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-30 18:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-30 18:22:37] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/266 places, 89/233 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 338 ms. Remains : 100/266 places, 89/233 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-01
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-01 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(((X(p0) U p1) U p2))&&(p3 U p0)))))'
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 245 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 245 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 244 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 244 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 243 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 243 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 242 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 242 transition count 209
Applied a total of 48 rules in 61 ms. Remains 242 /266 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 242 cols
[2025-05-30 18:22:37] [INFO ] Computed 47 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:38] [INFO ] Implicit Places using invariants in 168 ms returned [14, 33, 40, 47, 72, 79, 104, 227, 241]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 169 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/266 places, 209/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 208
Applied a total of 2 rules in 6 ms. Remains 232 /233 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 232 cols
[2025-05-30 18:22:38] [INFO ] Computed 38 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:38] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 18:22:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 18:22:38] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 232/266 places, 208/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 232/266 places, 208/233 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-02 finished in 900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p0 U X(p1)))))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 245 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 245 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 244 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 244 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 243 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 243 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 242 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 242 transition count 209
Applied a total of 48 rules in 53 ms. Remains 242 /266 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 242 cols
[2025-05-30 18:22:38] [INFO ] Computed 47 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:38] [INFO ] Implicit Places using invariants in 168 ms returned [7, 14, 33, 40, 47, 72, 79, 104, 227, 241]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 170 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/266 places, 209/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 230 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 219 transition count 196
Applied a total of 26 rules in 22 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2025-05-30 18:22:38] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:39] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-30 18:22:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:39] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/266 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 540 ms. Remains : 219/266 places, 196/233 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-03
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-03 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 266 transition count 187
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 220 transition count 187
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 92 place count 220 transition count 154
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 158 place count 187 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 185 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 185 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 184 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 184 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 183 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 183 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 182 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 182 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 181 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 181 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 180 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 180 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 179 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 179 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 178 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 178 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 177 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 177 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 176 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 176 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 175 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 175 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 174 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 174 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 173 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 173 transition count 140
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 232 place count 150 transition count 117
Applied a total of 232 rules in 38 ms. Remains 150 /266 variables (removed 116) and now considering 117/233 (removed 116) transitions.
// Phase 1: matrix 117 rows 150 cols
[2025-05-30 18:22:39] [INFO ] Computed 47 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:39] [INFO ] Implicit Places using invariants in 115 ms returned [5, 10, 23, 28, 33, 51, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 137, 149]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 117 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/266 places, 117/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 128 transition count 91
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 102 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 101 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 101 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 99 transition count 88
Applied a total of 58 rules in 18 ms. Remains 99 /128 variables (removed 29) and now considering 88/117 (removed 29) transitions.
// Phase 1: matrix 88 rows 99 cols
[2025-05-30 18:22:39] [INFO ] Computed 25 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-30 18:22:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:39] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-30 18:22:39] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/266 places, 88/233 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 309 ms. Remains : 99/266 places, 88/233 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-04
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-04 finished in 362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&(G(p1) U p2))))))'
Support contains 4 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 219
Applied a total of 28 rules in 28 ms. Remains 252 /266 variables (removed 14) and now considering 219/233 (removed 14) transitions.
// Phase 1: matrix 219 rows 252 cols
[2025-05-30 18:22:39] [INFO ] Computed 47 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:39] [INFO ] Implicit Places using invariants in 180 ms returned [7, 14, 33, 40, 47, 79, 104, 237, 251]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 181 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/266 places, 219/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 242 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 218
Applied a total of 2 rules in 5 ms. Remains 242 /243 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 242 cols
[2025-05-30 18:22:39] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:40] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-30 18:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 18:22:40] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 242/266 places, 218/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 788 ms. Remains : 242/266 places, 218/233 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-05 finished in 1125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0&&X((p0 U (p1||G(p0))))))&&(G(p3)||p2)))))'
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 264 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 245 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 245 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 244 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 244 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 243 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 243 transition count 210
Applied a total of 46 rules in 49 ms. Remains 243 /266 variables (removed 23) and now considering 210/233 (removed 23) transitions.
// Phase 1: matrix 210 rows 243 cols
[2025-05-30 18:22:40] [INFO ] Computed 47 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:41] [INFO ] Implicit Places using invariants in 156 ms returned [7, 14, 33, 40, 47, 79, 104, 227]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 157 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/266 places, 210/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 233 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 233 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 232 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 232 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 231 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 230 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 230 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 229 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 229 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 228 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 228 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 227 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 227 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 226 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 226 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 225 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 225 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 224 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 224 transition count 199
Applied a total of 22 rules in 23 ms. Remains 224 /235 variables (removed 11) and now considering 199/210 (removed 11) transitions.
// Phase 1: matrix 199 rows 224 cols
[2025-05-30 18:22:41] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:41] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 18:22:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 18:22:41] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 224/266 places, 199/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 514 ms. Remains : 224/266 places, 199/233 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (NOT p3), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-06
Product exploration explored 100000 steps with 2020 reset in 297 ms.
Product exploration explored 100000 steps with 2028 reset in 280 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (OR p2 p3))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 70 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 5692 steps (115 resets) in 65 ms. (86 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (OR p2 p3))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 6 factoid took 173 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 224 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2025-05-30 18:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:43] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-30 18:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:22:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 18:22:43] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-05-30 18:22:43] [INFO ] Invariant cache hit.
[2025-05-30 18:22:43] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/423 variables, 224/263 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/423 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 266 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12450 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 224/224 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/423 variables, 224/263 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 198/464 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:01] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:01] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:01] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:01] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:01] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 103 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:02] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:03] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:03] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:07] [INFO ] Deduced a trap composed of 108 places in 55 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:10] [INFO ] Deduced a trap composed of 118 places in 59 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:14] [INFO ] Deduced a trap composed of 116 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:14] [INFO ] Deduced a trap composed of 120 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:14] [INFO ] Deduced a trap composed of 124 places in 59 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:18] [INFO ] Deduced a trap composed of 122 places in 62 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 490 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 224/224 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42503ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 42505ms
Finished structural reductions in LTL mode , in 1 iterations and 42792 ms. Remains : 224/224 places, 199/199 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2041 steps (37 resets) in 19 ms. (102 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2031 reset in 210 ms.
Product exploration explored 100000 steps with 2055 reset in 226 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 199/199 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 224 transition count 199
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 42 place count 224 transition count 211
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 68 place count 224 transition count 211
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 109 place count 183 transition count 170
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 150 place count 183 transition count 170
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 176 place count 183 transition count 170
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 178 place count 181 transition count 168
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 181 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 181 transition count 194
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 181 rules in 41 ms. Remains 181 /224 variables (removed 43) and now considering 194/199 (removed 5) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:23:27] [INFO ] Redundant transitions in 5 ms returned []
Running 180 sub problems to find dead transitions.
// Phase 1: matrix 194 rows 181 cols
[2025-05-30 18:23:27] [INFO ] Computed 39 invariants in 1 ms
[2025-05-30 18:23:27] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/59 constraints. Problems are: Problem set: 29 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:30] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 2 ms to minimize.
Problem TDEAD54 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 TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:23:31] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 17/76 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 194/375 variables, 181/257 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 67/324 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/324 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/375 variables, 0/324 constraints. Problems are: Problem set: 78 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 324 constraints, problems are : Problem set: 78 solved, 102 unsolved in 14347 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 181/181 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 54/181 variables, 39/39 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 37/76 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 194/375 variables, 181/257 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 67/324 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 102/426 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/426 constraints. Problems are: Problem set: 78 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/375 variables, 0/426 constraints. Problems are: Problem set: 78 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 426 constraints, problems are : Problem set: 78 solved, 102 unsolved in 16196 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 181/181 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 102/180 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30616ms problems are : Problem set: 78 solved, 102 unsolved
Search for dead transitions found 78 dead transitions in 30617ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/224 places, 116/199 transitions.
Graph (complete) has 356 edges and 181 vertex of which 128 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.4 ms
Discarding 53 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 128 /181 variables (removed 53) and now considering 116/116 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/224 places, 116/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30685 ms. Remains : 128/224 places, 116/199 transitions.
Built C files in :
/tmp/ltsmin1822334662848924538
[2025-05-30 18:23:58] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1822334662848924538
Running compilation step : cd /tmp/ltsmin1822334662848924538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 408 ms.
Running link step : cd /tmp/ltsmin1822334662848924538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1822334662848924538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7403146618969705941.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 199/199 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 198
Applied a total of 2 rules in 9 ms. Remains 223 /224 variables (removed 1) and now considering 198/199 (removed 1) transitions.
// Phase 1: matrix 198 rows 223 cols
[2025-05-30 18:24:13] [INFO ] Computed 39 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:24:13] [INFO ] Implicit Places using invariants in 112 ms returned [222]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 222/224 places, 198/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 222 /222 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 222/224 places, 198/199 transitions.
Built C files in :
/tmp/ltsmin7781788932990591692
[2025-05-30 18:24:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7781788932990591692
Running compilation step : cd /tmp/ltsmin7781788932990591692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin7781788932990591692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7781788932990591692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased840911621341891310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:24:29] [INFO ] Flatten gal took : 11 ms
[2025-05-30 18:24:29] [INFO ] Flatten gal took : 10 ms
[2025-05-30 18:24:29] [INFO ] Time to serialize gal into /tmp/LTL7763675008614003036.gal : 3 ms
[2025-05-30 18:24:29] [INFO ] Time to serialize properties into /tmp/LTL8361031124228788973.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7763675008614003036.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14649607873198195725.hoa' '-atoms' '/tmp/LTL8361031124228788973.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8361031124228788973.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14649607873198195725.hoa
Detected timeout of ITS tools.
[2025-05-30 18:24:44] [INFO ] Flatten gal took : 9 ms
[2025-05-30 18:24:44] [INFO ] Flatten gal took : 9 ms
[2025-05-30 18:24:44] [INFO ] Time to serialize gal into /tmp/LTL6604139017343988517.gal : 2 ms
[2025-05-30 18:24:44] [INFO ] Time to serialize properties into /tmp/LTL513331047064805481.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6604139017343988517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL513331047064805481.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X((X(("((p77!=1)||(p218!=1))")&&(X(("((p77!=1)||(p218!=1))")U(("((p4==1)&&(p220==1))")||(G("((p77!=1)||(p218!=1))")))))))&&(("((p...210
Formula 0 simplified : XX((!"((p4==0)||(p220==0))" & F!"((p299==0)||(p306==0))") | X(!"((p77!=1)||(p218!=1))" | X(!"((p77!=1)||(p218!=1))" M !"((p4==1)&&(p...167
Detected timeout of ITS tools.
[2025-05-30 18:24:59] [INFO ] Flatten gal took : 14 ms
[2025-05-30 18:24:59] [INFO ] Applying decomposition
[2025-05-30 18:24:59] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10054598366092539613.txt' '-o' '/tmp/graph10054598366092539613.bin' '-w' '/tmp/graph10054598366092539613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10054598366092539613.bin' '-l' '-1' '-v' '-w' '/tmp/graph10054598366092539613.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:24:59] [INFO ] Decomposing Gal with order
[2025-05-30 18:24:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:24:59] [INFO ] Removed a total of 22 redundant transitions.
[2025-05-30 18:24:59] [INFO ] Flatten gal took : 44 ms
[2025-05-30 18:24:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-05-30 18:24:59] [INFO ] Time to serialize gal into /tmp/LTL3281742029909149107.gal : 4 ms
[2025-05-30 18:24:59] [INFO ] Time to serialize properties into /tmp/LTL1095734155745448969.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3281742029909149107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1095734155745448969.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((X(("((i8.u39.p77!=1)||(i10.i1.u61.p218!=1))")&&(X(("((i8.u39.p77!=1)||(i10.i1.u61.p218!=1))")U(("((i15.u1.p4==1)&&(i7.i0.u62.p...314
Formula 0 simplified : XX((!"((i15.u1.p4==0)||(i7.i0.u62.p220==0))" & F!"((i19.u90.p299==0)||(i19.u90.p306==0))") | X(!"((i8.u39.p77!=1)||(i10.i1.u61.p218!...253
Reverse transition relation is NOT exact ! Due to transitions t142, i0.u2.t55, i0.u4.t51, i1.u5.t49, i2.u7.t45, i3.u9.t41, i4.u10.t39, i4.u11.t37, i5.i0.u1...497
Computing Next relation with stutter on 24 deadlock states
5 unique states visited
0 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
86 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.893651,63900,1,0,106734,310,2263,143024,184,675,193944
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-12a-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-12a-LTLFireability-06 finished in 139575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(((p1 U X(p2))&&p0))||F(p3))) U X(p4))))'
Support contains 5 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 218
Applied a total of 30 rules in 42 ms. Remains 251 /266 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 251 cols
[2025-05-30 18:25:00] [INFO ] Computed 47 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:25:00] [INFO ] Implicit Places using invariants in 198 ms returned [7, 14, 33, 40, 47, 72, 79, 104, 250]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 199 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/266 places, 218/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 245 ms. Remains : 242/266 places, 218/233 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p4), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p4), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-07
Stuttering criterion allowed to conclude after 43 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-07 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1))) U X(G(p2))))'
Support contains 5 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 249 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 249 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 248 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 248 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 247 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 247 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 246 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 246 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 245 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 245 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 244 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 244 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 243 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 243 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 242 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 242 transition count 209
Applied a total of 48 rules in 56 ms. Remains 242 /266 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 242 cols
[2025-05-30 18:25:01] [INFO ] Computed 47 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:25:01] [INFO ] Implicit Places using invariants in 184 ms returned [7, 14, 40, 47, 72, 79, 104, 227, 241]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 184 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/266 places, 209/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 231 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 228 transition count 204
Applied a total of 10 rules in 12 ms. Remains 228 /233 variables (removed 5) and now considering 204/209 (removed 5) transitions.
// Phase 1: matrix 204 rows 228 cols
[2025-05-30 18:25:01] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:25:01] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-30 18:25:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:25:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 18:25:01] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/266 places, 204/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 550 ms. Remains : 228/266 places, 204/233 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-08
Product exploration explored 100000 steps with 24978 reset in 276 ms.
Product exploration explored 100000 steps with 25069 reset in 334 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 142 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (749 resets) in 266 ms. (149 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (44 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (42 resets) in 178 ms. (223 steps per ms) remains 1/3 properties
[2025-05-30 18:25:03] [INFO ] Invariant cache hit.
[2025-05-30 18:25:03] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/137 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/228 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/432 variables, 228/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 228/228 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/137 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/228 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/432 variables, 228/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/432 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 228/228 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p2) p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 14 factoid took 358 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
[2025-05-30 18:25:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 18:25:04] [INFO ] [Real]Absence check using 38 positive place invariants in 8 ms returned sat
[2025-05-30 18:25:04] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-30 18:25:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 18:25:04] [INFO ] [Nat]Absence check using 38 positive place invariants in 19 ms returned sat
[2025-05-30 18:25:04] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2025-05-30 18:25:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 18:25:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2025-05-30 18:25:04] [INFO ] Computed and/alt/rep : 202/388/202 causal constraints (skipped 1 transitions) in 12 ms.
[2025-05-30 18:25:05] [INFO ] Added : 196 causal constraints over 40 iterations in 931 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-05-30 18:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:25:05] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-30 18:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:25:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 18:25:06] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 18:25:06] [INFO ] Invariant cache hit.
[2025-05-30 18:25:06] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 204/432 variables, 228/266 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 269 constraints, problems are : Problem set: 0 solved, 203 unsolved in 15229 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 228/228 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 204/432 variables, 228/266 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 203/472 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:29] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:29] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:29] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:29] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:29] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:30] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:31] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 114 places in 61 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 115 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:32] [INFO ] Deduced a trap composed of 116 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:33] [INFO ] Deduced a trap composed of 118 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:34] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:43] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:43] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:43] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:43] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:43] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:43] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:44] [INFO ] Deduced a trap composed of 109 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:45] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:45] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:46] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:46] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 503 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 228/228 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45263ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 45264ms
Finished structural reductions in LTL mode , in 1 iterations and 45572 ms. Remains : 228/228 places, 204/204 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 163 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (718 resets) in 135 ms. (294 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 59 ms. (666 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2025-05-30 18:25:51] [INFO ] Invariant cache hit.
[2025-05-30 18:25:51] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/137 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/228 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/432 variables, 228/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 228/228 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/137 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/228 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/432 variables, 228/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/432 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 228/228 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 272 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=136 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p2) p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 14 factoid took 396 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
[2025-05-30 18:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 18:25:53] [INFO ] [Real]Absence check using 38 positive place invariants in 7 ms returned sat
[2025-05-30 18:25:53] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-30 18:25:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 18:25:53] [INFO ] [Nat]Absence check using 38 positive place invariants in 19 ms returned sat
[2025-05-30 18:25:53] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2025-05-30 18:25:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 18:25:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 26 ms returned sat
[2025-05-30 18:25:53] [INFO ] Computed and/alt/rep : 202/388/202 causal constraints (skipped 1 transitions) in 9 ms.
[2025-05-30 18:25:54] [INFO ] Added : 196 causal constraints over 40 iterations in 935 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24988 reset in 281 ms.
Product exploration explored 100000 steps with 24932 reset in 305 ms.
Applying partial POR strategy [true, false, false, true, true, true, false]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p2) (NOT p1)), false, (NOT p2), true, (NOT p2), (AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1))]
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 228 transition count 204
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 59 place count 228 transition count 204
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 228 transition count 204
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 119 place count 183 transition count 159
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 164 place count 183 transition count 159
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 189 place count 183 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 192 place count 180 transition count 156
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 195 place count 180 transition count 156
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 195 rules in 16 ms. Remains 180 /228 variables (removed 48) and now considering 156/204 (removed 48) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:25:56] [INFO ] Redundant transitions in 4 ms returned []
Running 155 sub problems to find dead transitions.
// Phase 1: matrix 156 rows 180 cols
[2025-05-30 18:25:56] [INFO ] Computed 38 invariants in 1 ms
[2025-05-30 18:25:56] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/58 constraints. Problems are: Problem set: 19 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 6 ms to minimize.
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:25:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 16/74 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/74 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 156/336 variables, 180/254 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 39/293 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/293 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/293 constraints. Problems are: Problem set: 51 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 293 constraints, problems are : Problem set: 51 solved, 104 unsolved in 8530 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 180/180 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 52/180 variables, 38/38 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 36/74 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/74 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 156/336 variables, 180/254 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 39/293 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 104/397 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/397 constraints. Problems are: Problem set: 51 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/397 constraints. Problems are: Problem set: 51 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 397 constraints, problems are : Problem set: 51 solved, 104 unsolved in 26885 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 180/180 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 104/155 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35430ms problems are : Problem set: 51 solved, 104 unsolved
Search for dead transitions found 51 dead transitions in 35430ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/228 places, 105/204 transitions.
Graph (complete) has 328 edges and 180 vertex of which 129 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 129 /180 variables (removed 51) and now considering 105/105 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/228 places, 105/204 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35465 ms. Remains : 129/228 places, 105/204 transitions.
Built C files in :
/tmp/ltsmin11055737995307620125
[2025-05-30 18:26:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11055737995307620125
Running compilation step : cd /tmp/ltsmin11055737995307620125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin11055737995307620125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11055737995307620125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9889844432096621001.hoa' '--buchi-type=spotba'
LTSmin run took 126 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 90900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((!p0||X(((p1 U G(p2)) U (!p0&&(p1 U G(p2))))))) U X(p3)))))'
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Applied a total of 22 rules in 32 ms. Remains 255 /266 variables (removed 11) and now considering 222/233 (removed 11) transitions.
// Phase 1: matrix 222 rows 255 cols
[2025-05-30 18:26:32] [INFO ] Computed 47 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:32] [INFO ] Implicit Places using invariants in 181 ms returned [7, 14, 33, 40, 47, 72, 240, 254]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 182 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/266 places, 222/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 221
Applied a total of 2 rules in 7 ms. Remains 246 /247 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 246 cols
[2025-05-30 18:26:32] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:32] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-30 18:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 18:26:32] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 246/266 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 538 ms. Remains : 246/266 places, 221/233 transitions.
Stuttering acceptance computed with spot in 390 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p2) p0), p0, true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3139 steps with 53 reset in 10 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-09 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 266 transition count 187
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 220 transition count 187
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 92 place count 220 transition count 155
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 156 place count 188 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 186 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 186 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 185 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 185 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 184 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 184 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 183 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 183 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 182 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 182 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 181 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 181 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 180 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 180 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 179 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 179 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 178 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 178 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 177 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 177 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 176 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 176 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 175 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 175 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 174 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 174 transition count 141
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 230 place count 151 transition count 118
Applied a total of 230 rules in 29 ms. Remains 151 /266 variables (removed 115) and now considering 118/233 (removed 115) transitions.
// Phase 1: matrix 118 rows 151 cols
[2025-05-30 18:26:32] [INFO ] Computed 47 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:33] [INFO ] Implicit Places using invariants in 123 ms returned [5, 10, 23, 28, 33, 51, 56, 57, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 138, 150]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 124 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/266 places, 118/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 130 transition count 93
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 104 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 104 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 102 transition count 90
Applied a total of 56 rules in 4 ms. Remains 102 /130 variables (removed 28) and now considering 90/118 (removed 28) transitions.
// Phase 1: matrix 90 rows 102 cols
[2025-05-30 18:26:33] [INFO ] Computed 26 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-30 18:26:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-30 18:26:33] [INFO ] Implicit Places using invariants and state equation in 87 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 : 102/266 places, 90/233 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 297 ms. Remains : 102/266 places, 90/233 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-10
Product exploration explored 100000 steps with 4005 reset in 165 ms.
Stack based approach found an accepted trace after 47121 steps with 1861 reset with depth 13 and stack size 13 in 105 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-10 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1)&&X(X(X(p2))))))'
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 220
Applied a total of 26 rules in 33 ms. Remains 253 /266 variables (removed 13) and now considering 220/233 (removed 13) transitions.
// Phase 1: matrix 220 rows 253 cols
[2025-05-30 18:26:33] [INFO ] Computed 47 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:33] [INFO ] Implicit Places using invariants in 196 ms returned [7, 14, 33, 40, 47, 72, 79, 104, 238, 252]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 196 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/266 places, 220/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 219
Applied a total of 2 rules in 6 ms. Remains 242 /243 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 242 cols
[2025-05-30 18:26:33] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:34] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-30 18:26:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:34] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 242/266 places, 219/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 539 ms. Remains : 242/266 places, 219/233 transitions.
Stuttering acceptance computed with spot in 757 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-11
Product exploration explored 100000 steps with 1835 reset in 185 ms.
Stack based approach found an accepted trace after 433 steps with 4 reset with depth 118 and stack size 118 in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-11 finished in 1508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(p0)) U p1))))))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 254 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 254 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 253 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 253 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 252 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 252 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 251 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 251 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 250 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 250 transition count 217
Applied a total of 32 rules in 38 ms. Remains 250 /266 variables (removed 16) and now considering 217/233 (removed 16) transitions.
// Phase 1: matrix 217 rows 250 cols
[2025-05-30 18:26:35] [INFO ] Computed 47 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:35] [INFO ] Implicit Places using invariants in 196 ms returned [7, 14, 33, 40, 47, 72, 79, 104, 235, 249]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 197 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/266 places, 217/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 239 transition count 216
Applied a total of 2 rules in 6 ms. Remains 239 /240 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 239 cols
[2025-05-30 18:26:35] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:35] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-30 18:26:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:35] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/266 places, 216/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 545 ms. Remains : 239/266 places, 216/233 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-12
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-12 finished in 825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)&&(X(p2)||G(p3)))))'
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 260 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 260 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 259 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 259 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 258 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 258 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 257 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 257 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 256 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 256 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 255 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 255 transition count 222
Applied a total of 22 rules in 25 ms. Remains 255 /266 variables (removed 11) and now considering 222/233 (removed 11) transitions.
// Phase 1: matrix 222 rows 255 cols
[2025-05-30 18:26:36] [INFO ] Computed 47 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:36] [INFO ] Implicit Places using invariants in 190 ms returned [7, 14, 33, 40, 47, 72, 104, 240, 254]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 191 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/266 places, 222/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 245 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 245 transition count 221
Applied a total of 2 rules in 6 ms. Remains 245 /246 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 245 cols
[2025-05-30 18:26:36] [INFO ] Computed 38 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:36] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 18:26:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 18:26:36] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 245/266 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 545 ms. Remains : 245/266 places, 221/233 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1236 steps with 27 reset in 9 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-13 finished in 816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(p2||G(p3)))))'
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 263 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 263 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 262 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 262 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 261 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 261 transition count 228
Applied a total of 10 rules in 14 ms. Remains 261 /266 variables (removed 5) and now considering 228/233 (removed 5) transitions.
// Phase 1: matrix 228 rows 261 cols
[2025-05-30 18:26:36] [INFO ] Computed 47 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:37] [INFO ] Implicit Places using invariants in 199 ms returned [7, 14, 33, 47, 72, 79, 104, 246, 260]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 199 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 252/266 places, 228/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 251 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 227
Applied a total of 2 rules in 7 ms. Remains 251 /252 variables (removed 1) and now considering 227/228 (removed 1) transitions.
// Phase 1: matrix 227 rows 251 cols
[2025-05-30 18:26:37] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:37] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-30 18:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 18:26:37] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 251/266 places, 227/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 555 ms. Remains : 251/266 places, 227/233 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-14 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||X(X(p2))))))))'
Support contains 5 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 265 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 232
Applied a total of 2 rules in 9 ms. Remains 265 /266 variables (removed 1) and now considering 232/233 (removed 1) transitions.
// Phase 1: matrix 232 rows 265 cols
[2025-05-30 18:26:37] [INFO ] Computed 47 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:37] [INFO ] Implicit Places using invariants in 207 ms returned [7, 33, 40, 72, 79, 104, 250, 264]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 208 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/266 places, 232/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 256 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 256 transition count 231
Applied a total of 2 rules in 8 ms. Remains 256 /257 variables (removed 1) and now considering 231/232 (removed 1) transitions.
// Phase 1: matrix 231 rows 256 cols
[2025-05-30 18:26:37] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:37] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-05-30 18:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 18:26:38] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 256/266 places, 231/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 762 ms. Remains : 256/266 places, 231/233 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-15
Product exploration explored 100000 steps with 7220 reset in 260 ms.
Product exploration explored 100000 steps with 7012 reset in 286 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1985 steps (29 resets) in 15 ms. (124 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 231/231 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2025-05-30 18:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:40] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-30 18:26:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:26:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 18:26:40] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2025-05-30 18:26:40] [INFO ] Invariant cache hit.
[2025-05-30 18:26:40] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/487 variables, 256/295 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/487 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 303 constraints, problems are : Problem set: 0 solved, 230 unsolved in 21681 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 256/256 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/487 variables, 256/295 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 230/533 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:10] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:12] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 103 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:13] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/553 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:27:31] [INFO ] Deduced a trap composed of 111 places in 62 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 554 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 256/256 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51724ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 51725ms
Finished structural reductions in LTL mode , in 1 iterations and 52286 ms. Remains : 256/256 places, 231/231 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 2171 steps (37 resets) in 21 ms. (98 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7199 reset in 239 ms.
Product exploration explored 100000 steps with 7252 reset in 258 ms.
Built C files in :
/tmp/ltsmin4384592548148774705
[2025-05-30 18:27:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4384592548148774705
Running compilation step : cd /tmp/ltsmin4384592548148774705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 344 ms.
Running link step : cd /tmp/ltsmin4384592548148774705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4384592548148774705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18110937268527268804.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 231/231 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2025-05-30 18:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:27:49] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-30 18:27:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:27:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 18:27:49] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2025-05-30 18:27:49] [INFO ] Invariant cache hit.
[2025-05-30 18:27:49] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/487 variables, 256/295 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/487 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 303 constraints, problems are : Problem set: 0 solved, 230 unsolved in 21707 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 256/256 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/487 variables, 256/295 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 230/533 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:19] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:21] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 103 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:22] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/553 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:28:40] [INFO ] Deduced a trap composed of 111 places in 59 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 554 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 256/256 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51739ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 51740ms
Finished structural reductions in LTL mode , in 1 iterations and 52274 ms. Remains : 256/256 places, 231/231 transitions.
Built C files in :
/tmp/ltsmin1960946172098568708
[2025-05-30 18:28:41] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1960946172098568708
Running compilation step : cd /tmp/ltsmin1960946172098568708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 351 ms.
Running link step : cd /tmp/ltsmin1960946172098568708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1960946172098568708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12229687840232127569.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 18:28:56] [INFO ] Flatten gal took : 17 ms
[2025-05-30 18:28:56] [INFO ] Flatten gal took : 8 ms
[2025-05-30 18:28:56] [INFO ] Time to serialize gal into /tmp/LTL10087938592980990899.gal : 1 ms
[2025-05-30 18:28:56] [INFO ] Time to serialize properties into /tmp/LTL15962819367340245615.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10087938592980990899.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3232875364150838542.hoa' '-atoms' '/tmp/LTL15962819367340245615.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15962819367340245615.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3232875364150838542.hoa
Detected timeout of ITS tools.
[2025-05-30 18:29:11] [INFO ] Flatten gal took : 8 ms
[2025-05-30 18:29:11] [INFO ] Flatten gal took : 7 ms
[2025-05-30 18:29:11] [INFO ] Time to serialize gal into /tmp/LTL12166196983972458360.gal : 1 ms
[2025-05-30 18:29:11] [INFO ] Time to serialize properties into /tmp/LTL10693829741582437266.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12166196983972458360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10693829741582437266.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G(("(p48==1)")||(X(X("((((p49==1)&&(p214==1))||(p14==0))||(p185==0))")))))||("((p49==1)&&(p214==1))")))))
Formula 0 simplified : G(F(!"(p48==1)" & XX!"((((p49==1)&&(p214==1))||(p14==0))||(p185==0))") & FG!"((p49==1)&&(p214==1))")
Detected timeout of ITS tools.
[2025-05-30 18:29:26] [INFO ] Flatten gal took : 7 ms
[2025-05-30 18:29:26] [INFO ] Applying decomposition
[2025-05-30 18:29:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph711645958921831430.txt' '-o' '/tmp/graph711645958921831430.bin' '-w' '/tmp/graph711645958921831430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph711645958921831430.bin' '-l' '-1' '-v' '-w' '/tmp/graph711645958921831430.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:29:26] [INFO ] Decomposing Gal with order
[2025-05-30 18:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:29:26] [INFO ] Removed a total of 27 redundant transitions.
[2025-05-30 18:29:26] [INFO ] Flatten gal took : 13 ms
[2025-05-30 18:29:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-05-30 18:29:26] [INFO ] Time to serialize gal into /tmp/LTL15687731349928890978.gal : 4 ms
[2025-05-30 18:29:26] [INFO ] Time to serialize properties into /tmp/LTL4368485313957421134.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15687731349928890978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4368485313957421134.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G(("(i5.u14.p48==1)")||(X(X("((((i12.i0.u38.p49==1)&&(i14.i1.u73.p214==1))||(i12.i1.u4.p14==0))||(i12.i1.u61.p185==0))")))))||...206
Formula 0 simplified : G(F(!"(i5.u14.p48==1)" & XX!"((((i12.i0.u38.p49==1)&&(i14.i1.u73.p214==1))||(i12.i1.u4.p14==0))||(i12.i1.u61.p185==0))") & FG!"((i12...195
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t59, i0.u1.t57, i1.u2.t55, i1.u5.t51, i2.u7.t47, i2.u8.t45, i3.i0.u9.t43, i3.i0.u11.t39...518
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 184080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||X(X(p2))))))))'
[2025-05-30 18:29:41] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17548492821597368623
[2025-05-30 18:29:41] [INFO ] Applying decomposition
[2025-05-30 18:29:41] [INFO ] Computing symmetric may disable matrix : 233 transitions.
[2025-05-30 18:29:41] [INFO ] Flatten gal took : 7 ms
[2025-05-30 18:29:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:29:41] [INFO ] Computing symmetric may enable matrix : 233 transitions.
[2025-05-30 18:29:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12632636660409508728.txt' '-o' '/tmp/graph12632636660409508728.bin' '-w' '/tmp/graph12632636660409508728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12632636660409508728.bin' '-l' '-1' '-v' '-w' '/tmp/graph12632636660409508728.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:29:41] [INFO ] Decomposing Gal with order
[2025-05-30 18:29:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:29:41] [INFO ] Computing Do-Not-Accords matrix : 233 transitions.
[2025-05-30 18:29:41] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:29:41] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17548492821597368623
Running compilation step : cd /tmp/ltsmin17548492821597368623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 18:29:41] [INFO ] Removed a total of 32 redundant transitions.
[2025-05-30 18:29:41] [INFO ] Flatten gal took : 24 ms
[2025-05-30 18:29:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 18:29:41] [INFO ] Time to serialize gal into /tmp/LTLFireability1171980859304750931.gal : 3 ms
[2025-05-30 18:29:41] [INFO ] Time to serialize properties into /tmp/LTLFireability9963466701480777257.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1171980859304750931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9963466701480777257.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i13.u39.p49==1)&&(i5.i1.u73.p214==1))")||(G(("(i18.u14.p48==1)")||(X(X("((((i13.u39.p49==1)&&(i5.i1.u73.p214==1))||(i12.i1....196
Formula 0 simplified : G(F(!"(i18.u14.p48==1)" & XX!"((((i13.u39.p49==1)&&(i5.i1.u73.p214==1))||(i12.i1.u4.p14==0))||(i13.u62.p185==0))") & FG!"((i13.u39.p...185
Compilation finished in 426 ms.
Running link step : cd /tmp/ltsmin17548492821597368623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17548492821597368623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t86, t121, i0.u1.t57, i1.u10.t41, i2.u12.t37, i3.u16.t29, i4.u20.t21, i8.u0.t59, i9.i0.u7.t47...505
Computing Next relation with stutter on 24 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: LTL layer: formula: [](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 5/ 8), 0.004: "[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: There are 237 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 267, there are 243 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.101: [Blue] ~11 levels ~960 states ~3992 transitions
pins2lts-mc-linux64( 0/ 8), 0.124: [Blue] ~32 levels ~1920 states ~8568 transitions
pins2lts-mc-linux64( 0/ 8), 0.151: [Blue] ~41 levels ~3840 states ~14184 transitions
pins2lts-mc-linux64( 4/ 8), 0.194: [Blue] ~42 levels ~7680 states ~32976 transitions
pins2lts-mc-linux64( 4/ 8), 0.280: [Blue] ~42 levels ~15360 states ~70240 transitions
pins2lts-mc-linux64( 3/ 8), 0.452: [Blue] ~553 levels ~30720 states ~71608 transitions
pins2lts-mc-linux64( 3/ 8), 0.732: [Blue] ~879 levels ~61440 states ~182856 transitions
pins2lts-mc-linux64( 3/ 8), 1.332: [Blue] ~879 levels ~122880 states ~462192 transitions
pins2lts-mc-linux64( 3/ 8), 2.399: [Blue] ~879 levels ~245760 states ~1100864 transitions
pins2lts-mc-linux64( 1/ 8), 4.308: [Blue] ~41 levels ~491520 states ~3158568 transitions
pins2lts-mc-linux64( 5/ 8), 6.774: [Blue] ~41 levels ~983040 states ~7381520 transitions
pins2lts-mc-linux64( 5/ 8), 12.612: [Blue] ~44 levels ~1966080 states ~14769712 transitions
pins2lts-mc-linux64( 5/ 8), 24.576: [Blue] ~44 levels ~3932160 states ~31408096 transitions
pins2lts-mc-linux64( 5/ 8), 48.516: [Blue] ~44 levels ~7864320 states ~66281448 transitions
pins2lts-mc-linux64( 3/ 8), 96.131: [Blue] ~2728 levels ~15728640 states ~111698696 transitions
pins2lts-mc-linux64( 3/ 8), 195.579: [Blue] ~3837 levels ~31457280 states ~240691736 transitions
pins2lts-mc-linux64( 6/ 8), 321.061: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 321.130:
pins2lts-mc-linux64( 0/ 8), 321.130: Explored 46615067 states 466618532 transitions, fanout: 10.010
pins2lts-mc-linux64( 0/ 8), 321.130: Total exploration time 321.060 sec (320.990 sec minimum, 321.021 sec on average)
pins2lts-mc-linux64( 0/ 8), 321.130: States per second: 145191, Transitions per second: 1453369
pins2lts-mc-linux64( 0/ 8), 321.130:
pins2lts-mc-linux64( 0/ 8), 321.130: State space has 46612643 states, 19306892 are accepting
pins2lts-mc-linux64( 0/ 8), 321.130: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 321.130: blue states: 46615067 (100.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 321.130: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 321.130: all-red states: 31428989 (67.43%), bogus 5545 (0.01%)
pins2lts-mc-linux64( 0/ 8), 321.130:
pins2lts-mc-linux64( 0/ 8), 321.130: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 321.130:
pins2lts-mc-linux64( 0/ 8), 321.130: Queue width: 8B, total height: 6056, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 321.131: Tree memory: 611.6MB, 13.8 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 321.131: Tree fill ratio (roots/leafs): 34.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 321.131: Stored 233 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 321.131: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 321.131: Est. total memory use: 611.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17548492821597368623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17548492821597368623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 18:52:06] [INFO ] Applying decomposition
[2025-05-30 18:52:06] [INFO ] Flatten gal took : 176 ms
[2025-05-30 18:52:06] [INFO ] Decomposing Gal with order
[2025-05-30 18:52:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:52:07] [INFO ] Removed a total of 44 redundant transitions.
[2025-05-30 18:52:07] [INFO ] Flatten gal took : 128 ms
[2025-05-30 18:52:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 166 ms.
[2025-05-30 18:52:07] [INFO ] Time to serialize gal into /tmp/LTLFireability9553553572486937037.gal : 30 ms
[2025-05-30 18:52:07] [INFO ] Time to serialize properties into /tmp/LTLFireability4007206360872636669.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9553553572486937037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4007206360872636669.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u21.p49==1)&&(u62.p214==1))")||(G(("(u20.p48==1)")||(X(X("((((u21.p49==1)&&(u62.p214==1))||(u6.p14==0))||(u62.p185==0))")))...161
Formula 0 simplified : G(F(!"(u20.p48==1)" & XX!"((((u21.p49==1)&&(u62.p214==1))||(u6.p14==0))||(u62.p185==0))") & FG!"((u21.p49==1)&&(u62.p214==1))")
Reverse transition relation is NOT exact ! Due to transitions t97, t98, t121, u1.t59, u2.t57, u4.t55, u5.t53, u7.t51, u8.t49, u10.t47, u11.t45, u13.t43, u1...388
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
[2025-05-30 19:14:33] [INFO ] Flatten gal took : 171 ms
[2025-05-30 19:14:34] [INFO ] Input system was already deterministic with 233 transitions.
[2025-05-30 19:14:34] [INFO ] Transformed 266 places.
[2025-05-30 19:14:34] [INFO ] Transformed 233 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 19:14:34] [INFO ] Time to serialize gal into /tmp/LTLFireability6871571268360940197.gal : 7 ms
[2025-05-30 19:14:34] [INFO ] Time to serialize properties into /tmp/LTLFireability2846165172852565541.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6871571268360940197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2846165172852565541.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p49==1)&&(p214==1))")||(G(("(p48==1)")||(X(X("((((p49==1)&&(p214==1))||(p14==0))||(p185==0))")))))))))
Formula 0 simplified : G(F(!"(p48==1)" & XX!"((((p49==1)&&(p214==1))||(p14==0))||(p185==0))") & FG!"((p49==1)&&(p214==1))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729500540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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