Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166000156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r025-smll-171620166000156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 23:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 23:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-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 1716290770388

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:26:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:26:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:26:12] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-21 11:26:12] [INFO ] Transformed 307 places.
[2024-05-21 11:26:12] [INFO ] Transformed 305 transitions.
[2024-05-21 11:26:12] [INFO ] Found NUPN structural information;
[2024-05-21 11:26:12] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 75 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 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 73 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2024-05-21 11:26:13] [INFO ] Computed 76 invariants in 32 ms
[2024-05-21 11:26:13] [INFO ] Implicit Places using invariants in 918 ms returned [7, 21, 35, 56, 63, 70, 77, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 182, 232, 238, 244, 256, 262, 268, 274, 280, 292, 298, 304, 306]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 971 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/307 places, 245/245 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 264 transition count 234
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 264 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 263 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 263 transition count 233
Applied a total of 24 rules in 40 ms. Remains 263 /275 variables (removed 12) and now considering 233/245 (removed 12) transitions.
// Phase 1: matrix 233 rows 263 cols
[2024-05-21 11:26:14] [INFO ] Computed 44 invariants in 4 ms
[2024-05-21 11:26:14] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 11:26:14] [INFO ] Invariant cache hit.
[2024-05-21 11:26:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:26:14] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/307 places, 233/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1662 ms. Remains : 263/307 places, 233/245 transitions.
Support contains 50 out of 263 places after structural reductions.
[2024-05-21 11:26:14] [INFO ] Flatten gal took : 71 ms
[2024-05-21 11:26:14] [INFO ] Flatten gal took : 27 ms
[2024-05-21 11:26:15] [INFO ] Input system was already deterministic with 233 transitions.
RANDOM walk for 40000 steps (739 resets) in 1541 ms. (25 steps per ms) remains 2/37 properties
BEST_FIRST walk for 40004 steps (44 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
[2024-05-21 11:26:15] [INFO ] Invariant cache hit.
[2024-05-21 11:26:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/263 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 11:26:16] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 233/496 variables, 263/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 20/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 263/263 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/263 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 233/496 variables, 263/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 20/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/496 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 330 constraints, problems are : Problem set: 0 solved, 2 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 263/263 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1041ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 12 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(X(F((p1 U (p2||G(p1)))))))||G(F((p1 U (p2||G(p1))))))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 190 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 11:26:17] [INFO ] Computed 44 invariants in 3 ms
[2024-05-21 11:26:17] [INFO ] Implicit Places using invariants in 177 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 179 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 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
Applied a total of 22 rules in 57 ms. Remains 221 /232 variables (removed 11) and now considering 198/209 (removed 11) transitions.
// Phase 1: matrix 198 rows 221 cols
[2024-05-21 11:26:17] [INFO ] Computed 37 invariants in 2 ms
[2024-05-21 11:26:17] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 11:26:17] [INFO ] Invariant cache hit.
[2024-05-21 11:26:18] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 221/263 places, 198/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 812 ms. Remains : 221/263 places, 198/233 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-00
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-00 finished in 1296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X(X(X((X(p1)&&F(p2)))))))))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Applied a total of 42 rules in 124 ms. Remains 242 /263 variables (removed 21) and now considering 212/233 (removed 21) transitions.
// Phase 1: matrix 212 rows 242 cols
[2024-05-21 11:26:18] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 11:26:18] [INFO ] Implicit Places using invariants in 188 ms returned [13, 26, 39, 46, 77, 202, 228]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 189 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/263 places, 212/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 233 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 233 transition count 210
Applied a total of 4 rules in 18 ms. Remains 233 /235 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 233 cols
[2024-05-21 11:26:18] [INFO ] Computed 37 invariants in 4 ms
[2024-05-21 11:26:18] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 11:26:18] [INFO ] Invariant cache hit.
[2024-05-21 11:26:19] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 233/263 places, 210/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 716 ms. Remains : 233/263 places, 210/233 transitions.
Stuttering acceptance computed with spot in 2912 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-02
Stuttering criterion allowed to conclude after 1079 steps with 15 reset in 16 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-02 finished in 3707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&X(G(p1)))) U p2))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Applied a total of 22 rules in 39 ms. Remains 252 /263 variables (removed 11) and now considering 222/233 (removed 11) transitions.
// Phase 1: matrix 222 rows 252 cols
[2024-05-21 11:26:22] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 11:26:22] [INFO ] Implicit Places using invariants in 169 ms returned [13, 26, 39, 46, 77, 212]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 178 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/263 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
[2024-05-21 11:26:22] [INFO ] Computed 38 invariants in 2 ms
[2024-05-21 11:26:22] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 11:26:22] [INFO ] Invariant cache hit.
[2024-05-21 11:26:22] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 245/263 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 655 ms. Remains : 245/263 places, 221/233 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p0), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-03 finished in 809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (F(p0)&&p1)))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 77 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 11:26:23] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 11:26:23] [INFO ] Implicit Places using invariants in 201 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 202 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 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 31 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2024-05-21 11:26:23] [INFO ] Computed 37 invariants in 2 ms
[2024-05-21 11:26:23] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 11:26:23] [INFO ] Invariant cache hit.
[2024-05-21 11:26:23] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 734 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-05
Product exploration explored 100000 steps with 25029 reset in 628 ms.
Product exploration explored 100000 steps with 24916 reset in 566 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
RANDOM walk for 2403 steps (46 resets) in 35 ms. (66 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
[2024-05-21 11:26:26] [INFO ] Invariant cache hit.
[2024-05-21 11:26:26] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2024-05-21 11:26:26] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-21 11:26:26] [INFO ] Computed and/alt/rep : 194/377/194 causal constraints (skipped 1 transitions) in 23 ms.
[2024-05-21 11:26:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:26:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2024-05-21 11:26:26] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-21 11:26:26] [INFO ] Computed and/alt/rep : 194/377/194 causal constraints (skipped 1 transitions) in 29 ms.
[2024-05-21 11:26:27] [INFO ] Added : 178 causal constraints over 36 iterations in 879 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 11:26:27] [INFO ] Invariant cache hit.
[2024-05-21 11:26:27] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2024-05-21 11:26:27] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-21 11:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:26:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2024-05-21 11:26:28] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-21 11:26:28] [INFO ] Computed and/alt/rep : 194/377/194 causal constraints (skipped 1 transitions) in 18 ms.
[2024-05-21 11:26:28] [INFO ] Added : 184 causal constraints over 37 iterations in 843 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-21 11:26:28] [INFO ] Invariant cache hit.
[2024-05-21 11:26:29] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 11:26:29] [INFO ] Invariant cache hit.
[2024-05-21 11:26:29] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-21 11:26:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 196/415 variables, 219/256 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 0/415 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 256 constraints, problems are : Problem set: 0 solved, 195 unsolved in 8700 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 196/415 variables, 219/256 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 195/451 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 11:26:43] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 11:26:51] [INFO ] Deduced a trap composed of 109 places in 78 ms of which 3 ms to minimize.
[2024-05-21 11:26:51] [INFO ] Deduced a trap composed of 117 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/415 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 454 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 3/3 constraints]
After SMT, in 38802ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 38808ms
Finished structural reductions in LTL mode , in 1 iterations and 39199 ms. Remains : 219/219 places, 196/196 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
RANDOM walk for 2603 steps (44 resets) in 87 ms. (29 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
[2024-05-21 11:27:09] [INFO ] Invariant cache hit.
[2024-05-21 11:27:09] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2024-05-21 11:27:09] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-21 11:27:09] [INFO ] Computed and/alt/rep : 194/377/194 causal constraints (skipped 1 transitions) in 18 ms.
[2024-05-21 11:27:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:27:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2024-05-21 11:27:09] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-21 11:27:09] [INFO ] Computed and/alt/rep : 194/377/194 causal constraints (skipped 1 transitions) in 15 ms.
[2024-05-21 11:27:10] [INFO ] Added : 178 causal constraints over 36 iterations in 862 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 11:27:10] [INFO ] Invariant cache hit.
[2024-05-21 11:27:10] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2024-05-21 11:27:10] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 11:27:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:27:11] [INFO ] [Nat]Absence check using 37 positive place invariants in 13 ms returned sat
[2024-05-21 11:27:11] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-21 11:27:11] [INFO ] Computed and/alt/rep : 194/377/194 causal constraints (skipped 1 transitions) in 15 ms.
[2024-05-21 11:27:12] [INFO ] Added : 184 causal constraints over 37 iterations in 819 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
Entered a terminal (fully accepting) state of product in 85485 steps with 21285 reset in 392 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-05 finished in 49719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 257 transition count 143
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 168 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 185 place count 167 transition count 142
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 185 place count 167 transition count 129
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 223 place count 142 transition count 129
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 235 place count 142 transition count 117
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 247 place count 130 transition count 117
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 305 place count 101 transition count 88
Applied a total of 305 rules in 67 ms. Remains 101 /263 variables (removed 162) and now considering 88/233 (removed 145) transitions.
// Phase 1: matrix 88 rows 101 cols
[2024-05-21 11:27:12] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 11:27:12] [INFO ] Implicit Places using invariants in 179 ms returned [80, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 196 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/263 places, 88/233 transitions.
Applied a total of 0 rules in 14 ms. Remains 99 /99 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 99/263 places, 88/233 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-06
Product exploration explored 100000 steps with 3188 reset in 257 ms.
Stack based approach found an accepted trace after 1732 steps with 53 reset with depth 56 and stack size 56 in 6 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-06 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1&&F(p2)))))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 180 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 11:27:13] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 11:27:13] [INFO ] Implicit Places using invariants in 285 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 288 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 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 46 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2024-05-21 11:27:13] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 11:27:14] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 11:27:14] [INFO ] Invariant cache hit.
[2024-05-21 11:27:14] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1262 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-07
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-07 finished in 1484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1))&&(p2 U p3))))'
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 99 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 11:27:14] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 11:27:15] [INFO ] Implicit Places using invariants in 310 ms returned [13, 39, 46, 77, 225]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 322 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 234/263 places, 209/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 232 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 232 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 231 transition count 206
Applied a total of 6 rules in 9 ms. Remains 231 /234 variables (removed 3) and now considering 206/209 (removed 3) transitions.
// Phase 1: matrix 206 rows 231 cols
[2024-05-21 11:27:15] [INFO ] Computed 39 invariants in 1 ms
[2024-05-21 11:27:15] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-21 11:27:15] [INFO ] Invariant cache hit.
[2024-05-21 11:27:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 11:27:15] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 231/263 places, 206/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1069 ms. Remains : 231/263 places, 206/233 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-08
Stuttering criterion allowed to conclude after 68 steps with 9 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 1362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 166 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 11:27:16] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 11:27:16] [INFO ] Implicit Places using invariants in 299 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 301 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 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 77 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2024-05-21 11:27:16] [INFO ] Computed 37 invariants in 2 ms
[2024-05-21 11:27:16] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 11:27:16] [INFO ] Invariant cache hit.
[2024-05-21 11:27:17] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1011 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-09
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-09 finished in 1165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&F(p2)&&p0)))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 87 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 11:27:17] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 11:27:17] [INFO ] Implicit Places using invariants in 177 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 202 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 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 30 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2024-05-21 11:27:17] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 11:27:18] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-21 11:27:18] [INFO ] Invariant cache hit.
[2024-05-21 11:27:18] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1100 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-11 finished in 1294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(p0)) U p1))))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Applied a total of 30 rules in 68 ms. Remains 248 /263 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 248 cols
[2024-05-21 11:27:18] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 11:27:18] [INFO ] Implicit Places using invariants in 177 ms returned [13, 26, 39, 46, 77, 208, 234]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 192 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/263 places, 218/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 216
Applied a total of 4 rules in 6 ms. Remains 239 /241 variables (removed 2) and now considering 216/218 (removed 2) transitions.
// Phase 1: matrix 216 rows 239 cols
[2024-05-21 11:27:18] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 11:27:19] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 11:27:19] [INFO ] Invariant cache hit.
[2024-05-21 11:27:19] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/263 places, 216/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 685 ms. Remains : 239/263 places, 216/233 transitions.
Stuttering acceptance computed with spot in 247 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 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-12 finished in 951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)&&(X(p2)||G(p3)))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Applied a total of 20 rules in 34 ms. Remains 253 /263 variables (removed 10) and now considering 223/233 (removed 10) transitions.
// Phase 1: matrix 223 rows 253 cols
[2024-05-21 11:27:19] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 11:27:19] [INFO ] Implicit Places using invariants in 176 ms returned [13, 26, 39, 46, 213, 239]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 192 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/263 places, 223/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 245 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 245 transition count 221
Applied a total of 4 rules in 7 ms. Remains 245 /247 variables (removed 2) and now considering 221/223 (removed 2) transitions.
// Phase 1: matrix 221 rows 245 cols
[2024-05-21 11:27:19] [INFO ] Computed 38 invariants in 4 ms
[2024-05-21 11:27:19] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 11:27:19] [INFO ] Invariant cache hit.
[2024-05-21 11:27:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 11:27:20] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 245/263 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 717 ms. Remains : 245/263 places, 221/233 transitions.
Stuttering acceptance computed with spot in 220 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 352 steps with 6 reset in 2 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-13 finished in 964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(p2||G(p3)))))'
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Applied a total of 8 rules in 14 ms. Remains 259 /263 variables (removed 4) and now considering 229/233 (removed 4) transitions.
// Phase 1: matrix 229 rows 259 cols
[2024-05-21 11:27:20] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 11:27:20] [INFO ] Implicit Places using invariants in 177 ms returned [13, 26, 46, 77, 219, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 207 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 253/263 places, 229/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 251 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 227
Applied a total of 4 rules in 7 ms. Remains 251 /253 variables (removed 2) and now considering 227/229 (removed 2) transitions.
// Phase 1: matrix 227 rows 251 cols
[2024-05-21 11:27:20] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 11:27:20] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 11:27:20] [INFO ] Invariant cache hit.
[2024-05-21 11:27:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 11:27:21] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 251/263 places, 227/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 710 ms. Remains : 251/263 places, 227/233 transitions.
Stuttering acceptance computed with spot in 335 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 1065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||X(X(p2))))))))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 263 /263 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 263 cols
[2024-05-21 11:27:21] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 11:27:21] [INFO ] Implicit Places using invariants in 153 ms returned [26, 39, 77, 223, 249]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 170 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/263 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 256 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 231
Applied a total of 4 rules in 7 ms. Remains 256 /258 variables (removed 2) and now considering 231/233 (removed 2) transitions.
// Phase 1: matrix 231 rows 256 cols
[2024-05-21 11:27:21] [INFO ] Computed 39 invariants in 1 ms
[2024-05-21 11:27:21] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 11:27:21] [INFO ] Invariant cache hit.
[2024-05-21 11:27:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 11:27:22] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 256/263 places, 231/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 696 ms. Remains : 256/263 places, 231/233 transitions.
Stuttering acceptance computed with spot in 224 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 7187 reset in 595 ms.
Product exploration explored 100000 steps with 7111 reset in 549 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 186 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 270 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 3663 steps (67 resets) in 56 ms. (64 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 (NOT (OR p0 p2))), (F (NOT p2)), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 281 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 213 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 165 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 3 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-21 11:27:24] [INFO ] Invariant cache hit.
[2024-05-21 11:27:25] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 11:27:25] [INFO ] Invariant cache hit.
[2024-05-21 11:27:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 11:27:25] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-21 11:27:25] [INFO ] Invariant cache hit.
[2024-05-21 11:27:25] [INFO ] State equation strengthened by 8 read => feed constraints.
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 14916 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]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
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
[2024-05-21 11:27:48] [INFO ] Deduced a trap composed of 102 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 11:27:54] [INFO ] Deduced a trap composed of 125 places in 86 ms of which 3 ms to minimize.
[2024-05-21 11:27:54] [INFO ] Deduced a trap composed of 123 places in 83 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 11:28:00] [INFO ] Deduced a trap composed of 121 places in 74 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 11:28:07] [INFO ] Deduced a trap composed of 119 places in 80 ms of which 3 ms to minimize.
[2024-05-21 11:28:07] [INFO ] Deduced a trap composed of 117 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 539 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30022 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: 6/6 constraints]
After SMT, in 45021ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 45025ms
Finished structural reductions in LTL mode , in 1 iterations and 45577 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 106 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 157 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 2086 steps (35 resets) in 22 ms. (90 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 (NOT (OR p0 p2))), (F (NOT p2)), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 234 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 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))]
Stuttering acceptance computed with spot in 167 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 255 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 7240 reset in 341 ms.
Product exploration explored 100000 steps with 7132 reset in 375 ms.
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 3 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-21 11:28:12] [INFO ] Invariant cache hit.
[2024-05-21 11:28:12] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 11:28:12] [INFO ] Invariant cache hit.
[2024-05-21 11:28:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 11:28:13] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-21 11:28:13] [INFO ] Invariant cache hit.
[2024-05-21 11:28:13] [INFO ] State equation strengthened by 8 read => feed constraints.
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 15514 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]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
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
[2024-05-21 11:28:37] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 125 places in 84 ms of which 2 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 123 places in 88 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 11:28:49] [INFO ] Deduced a trap composed of 121 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 119 places in 85 ms of which 2 ms to minimize.
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 117 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 539 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30016 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: 6/6 constraints]
After SMT, in 45579ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 45582ms
Finished structural reductions in LTL mode , in 1 iterations and 46262 ms. Remains : 256/256 places, 231/231 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 97370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||X(X(p2))))))))'
[2024-05-21 11:28:59] [INFO ] Flatten gal took : 21 ms
[2024-05-21 11:28:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 11:28:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 263 places, 233 transitions and 673 arcs took 11 ms.
Total runtime 166974 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutoFlight-PT-12a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 263
TRANSITIONS: 233
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.003s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1611
MODEL NAME: /home/mcc/execution/414/model
263 places, 233 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
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 r025-smll-171620166000156"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;