Execution Chart

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

Trace from the execution

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

--------------------
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 1716271811202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 06:10:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 06:10:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:10:13] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-21 06:10:13] [INFO ] Transformed 307 places.
[2024-05-21 06:10:13] [INFO ] Transformed 305 transitions.
[2024-05-21 06:10:13] [INFO ] Found NUPN structural information;
[2024-05-21 06:10:13] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 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 64 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 06:10:13] [INFO ] Computed 76 invariants in 28 ms
[2024-05-21 06:10:14] [INFO ] Implicit Places using invariants in 1094 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 1157 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 69 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 06:10:14] [INFO ] Computed 44 invariants in 8 ms
[2024-05-21 06:10:15] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 06:10:15] [INFO ] Invariant cache hit.
[2024-05-21 06:10:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 06:10:15] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 810 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 2133 ms. Remains : 263/307 places, 233/245 transitions.
Support contains 50 out of 263 places after structural reductions.
[2024-05-21 06:10:16] [INFO ] Flatten gal took : 70 ms
[2024-05-21 06:10:16] [INFO ] Flatten gal took : 32 ms
[2024-05-21 06:10:16] [INFO ] Input system was already deterministic with 233 transitions.
RANDOM walk for 40000 steps (729 resets) in 2068 ms. (19 steps per ms) remains 2/37 properties
BEST_FIRST walk for 40004 steps (44 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
[2024-05-21 06:10:17] [INFO ] Invariant cache hit.
[2024-05-21 06:10:17] [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 06:10:17] [INFO ] Deduced a trap composed of 105 places in 131 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 658 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 388 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 1080ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 14 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 115 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 06:10:18] [INFO ] Computed 44 invariants in 3 ms
[2024-05-21 06:10:18] [INFO ] Implicit Places using invariants in 171 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 173 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 45 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 06:10:19] [INFO ] Computed 37 invariants in 2 ms
[2024-05-21 06:10:19] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 06:10:19] [INFO ] Invariant cache hit.
[2024-05-21 06:10:19] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 405 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 738 ms. Remains : 221/263 places, 198/233 transitions.
Stuttering acceptance computed with spot in 287 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 9 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-00 finished in 1125 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 82 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 06:10:19] [INFO ] Computed 44 invariants in 4 ms
[2024-05-21 06:10:20] [INFO ] Implicit Places using invariants in 215 ms returned [13, 26, 39, 46, 77, 202, 228]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 223 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 12 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 06:10:20] [INFO ] Computed 37 invariants in 2 ms
[2024-05-21 06:10:20] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 06:10:20] [INFO ] Invariant cache hit.
[2024-05-21 06:10:20] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 464 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 781 ms. Remains : 233/263 places, 210/233 transitions.
Stuttering acceptance computed with spot in 3692 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 83 steps with 1 reset in 2 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-02 finished in 4550 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 48 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 06:10:24] [INFO ] Computed 44 invariants in 4 ms
[2024-05-21 06:10:24] [INFO ] Implicit Places using invariants in 266 ms returned [13, 26, 39, 46, 77, 212]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 268 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 06:10:24] [INFO ] Computed 38 invariants in 2 ms
[2024-05-21 06:10:24] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 06:10:24] [INFO ] Invariant cache hit.
[2024-05-21 06:10:25] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 524 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 846 ms. Remains : 245/263 places, 221/233 transitions.
Stuttering acceptance computed with spot in 169 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 3 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-03 finished in 1035 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 88 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 06:10:25] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 06:10:25] [INFO ] Implicit Places using invariants in 237 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 238 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 33 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 06:10:25] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 06:10:25] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 06:10:25] [INFO ] Invariant cache hit.
[2024-05-21 06:10:26] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 338 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 704 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 204 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 25000 reset in 610 ms.
Stuttering criterion allowed to conclude after 5370 steps with 1342 reset in 32 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-05 finished in 1580 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 48 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 06:10:26] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 06:10:27] [INFO ] Implicit Places using invariants in 91 ms returned [80, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 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 4 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 145 ms. Remains : 99/263 places, 88/233 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-06
Product exploration explored 100000 steps with 3147 reset in 293 ms.
Stack based approach found an accepted trace after 9934 steps with 315 reset with depth 54 and stack size 54 in 32 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-06 finished in 550 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 88 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 06:10:27] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 06:10:27] [INFO ] Implicit Places using invariants in 199 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 33 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 06:10:27] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 06:10:27] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 06:10:27] [INFO ] Invariant cache hit.
[2024-05-21 06:10:28] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 350 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 676 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 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-07 finished in 916 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 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 06:10:28] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 06:10:28] [INFO ] Implicit Places using invariants in 256 ms returned [13, 39, 46, 77, 225]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 257 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 10 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 06:10:28] [INFO ] Computed 39 invariants in 2 ms
[2024-05-21 06:10:29] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-21 06:10:29] [INFO ] Invariant cache hit.
[2024-05-21 06:10:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 06:10:29] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 543 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 898 ms. Remains : 231/263 places, 206/233 transitions.
Stuttering acceptance computed with spot in 201 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 71 steps with 10 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 1119 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 74 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 06:10:29] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 06:10:29] [INFO ] Implicit Places using invariants in 209 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 216 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 43 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 06:10:29] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 06:10:30] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 06:10:30] [INFO ] Invariant cache hit.
[2024-05-21 06:10:30] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 512 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 847 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 195 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 103 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-09 finished in 1059 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 83 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 06:10:30] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 06:10:30] [INFO ] Implicit Places using invariants in 254 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 256 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 33 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 06:10:30] [INFO ] Computed 37 invariants in 2 ms
[2024-05-21 06:10:31] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 06:10:31] [INFO ] Invariant cache hit.
[2024-05-21 06:10:31] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 494 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 869 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 221 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 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-11 finished in 1115 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 79 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 06:10:31] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 06:10:32] [INFO ] Implicit Places using invariants in 224 ms returned [13, 26, 39, 46, 77, 208, 234]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 226 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 9 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 06:10:32] [INFO ] Computed 37 invariants in 2 ms
[2024-05-21 06:10:32] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 06:10:32] [INFO ] Invariant cache hit.
[2024-05-21 06:10:32] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 550 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 864 ms. Remains : 239/263 places, 216/233 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-12
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-12 finished in 1157 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 36 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 06:10:32] [INFO ] Computed 44 invariants in 3 ms
[2024-05-21 06:10:33] [INFO ] Implicit Places using invariants in 175 ms returned [13, 26, 39, 46, 213, 239]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 177 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 6 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 06:10:33] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 06:10:33] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 06:10:33] [INFO ] Invariant cache hit.
[2024-05-21 06:10:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:10:33] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 518 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 737 ms. Remains : 245/263 places, 221/233 transitions.
Stuttering acceptance computed with spot in 259 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 792 steps with 15 reset in 5 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-13 finished in 1031 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 16 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 06:10:33] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 06:10:34] [INFO ] Implicit Places using invariants in 176 ms returned [13, 26, 46, 77, 219, 245]
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 : 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 5 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 06:10:34] [INFO ] Computed 38 invariants in 2 ms
[2024-05-21 06:10:34] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 06:10:34] [INFO ] Invariant cache hit.
[2024-05-21 06:10:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:10:34] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 505 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 705 ms. Remains : 251/263 places, 227/233 transitions.
Stuttering acceptance computed with spot in 207 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 932 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 5 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 06:10:34] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 06:10:35] [INFO ] Implicit Places using invariants in 275 ms returned [26, 39, 77, 223, 249]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 277 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 10 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 06:10:35] [INFO ] Computed 39 invariants in 2 ms
[2024-05-21 06:10:35] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-21 06:10:35] [INFO ] Invariant cache hit.
[2024-05-21 06:10:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 06:10:35] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 787 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 1080 ms. Remains : 256/263 places, 231/233 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-15
Product exploration explored 100000 steps with 7099 reset in 396 ms.
Product exploration explored 100000 steps with 7179 reset in 618 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 135 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 170 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 2409 steps (39 resets) in 25 ms. (92 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 295 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 250 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 173 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
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 06:10:38] [INFO ] Invariant cache hit.
[2024-05-21 06:10:38] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 06:10:38] [INFO ] Invariant cache hit.
[2024-05-21 06:10:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 06:10:38] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-21 06:10:38] [INFO ] Invariant cache hit.
[2024-05-21 06:10:38] [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 16914 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 06:11:05] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 20 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 06:11:11] [INFO ] Deduced a trap composed of 125 places in 88 ms of which 5 ms to minimize.
[2024-05-21 06:11:11] [INFO ] Deduced a trap composed of 123 places in 67 ms of which 2 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 06:11:19] [INFO ] Deduced a trap composed of 121 places in 77 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 537 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30049 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: 4/4 constraints]
After SMT, in 47048ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 47058ms
Finished structural reductions in LTL mode , in 1 iterations and 47680 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 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 300 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 2181 steps (39 resets) in 11 ms. (181 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 345 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 194 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 198 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 220 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 7101 reset in 345 ms.
Product exploration explored 100000 steps with 7115 reset in 512 ms.
Built C files in :
/tmp/ltsmin2634320949544854404
[2024-05-21 06:11:28] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2634320949544854404
Running compilation step : cd /tmp/ltsmin2634320949544854404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 875 ms.
Running link step : cd /tmp/ltsmin2634320949544854404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2634320949544854404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7365642972702343732.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-21 06:11:43] [INFO ] Invariant cache hit.
[2024-05-21 06:11:43] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 06:11:43] [INFO ] Invariant cache hit.
[2024-05-21 06:11:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 06:11:44] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-21 06:11:44] [INFO ] Invariant cache hit.
[2024-05-21 06:11:44] [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 17595 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 06:12:12] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 3 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 06:12:18] [INFO ] Deduced a trap composed of 125 places in 73 ms of which 2 ms to minimize.
[2024-05-21 06:12:18] [INFO ] Deduced a trap composed of 123 places in 79 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 06:12:25] [INFO ] Deduced a trap composed of 121 places in 73 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 1/537 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 537 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30017 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: 4/4 constraints]
After SMT, in 47663ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 47667ms
Finished structural reductions in LTL mode , in 1 iterations and 48241 ms. Remains : 256/256 places, 231/231 transitions.
Built C files in :
/tmp/ltsmin15505350696432866023
[2024-05-21 06:12:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15505350696432866023
Running compilation step : cd /tmp/ltsmin15505350696432866023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 697 ms.
Running link step : cd /tmp/ltsmin15505350696432866023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15505350696432866023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14537466955328796891.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 06:12:47] [INFO ] Flatten gal took : 20 ms
[2024-05-21 06:12:47] [INFO ] Flatten gal took : 18 ms
[2024-05-21 06:12:47] [INFO ] Time to serialize gal into /tmp/LTL2224192522394931027.gal : 6 ms
[2024-05-21 06:12:47] [INFO ] Time to serialize properties into /tmp/LTL1519328707567044110.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2224192522394931027.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12167106704392932181.hoa' '-atoms' '/tmp/LTL1519328707567044110.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1519328707567044110.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12167106704392932181.hoa
Detected timeout of ITS tools.
[2024-05-21 06:13:02] [INFO ] Flatten gal took : 18 ms
[2024-05-21 06:13:02] [INFO ] Flatten gal took : 16 ms
[2024-05-21 06:13:02] [INFO ] Time to serialize gal into /tmp/LTL12520067477269766667.gal : 5 ms
[2024-05-21 06:13:02] [INFO ] Time to serialize properties into /tmp/LTL12932757862808746978.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12520067477269766667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12932757862808746978.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G(("(i16.u13.p48==1)")||(X(X("((((i9.u38.p49==1)&&(i11.u74.p214==1))||(i9.u36.p14==0))||(i9.u62.p185==0))")))))||("((i9.u38.p4...186
Formula 0 simplified : G(F(!"(i16.u13.p48==1)" & XX!"((((i9.u38.p49==1)&&(i11.u74.p214==1))||(i9.u36.p14==0))||(i9.u62.p185==0))") & FG!"((i9.u38.p49==1)&&...175
Reverse transition relation is NOT exact ! Due to transitions i0.u3.t53, i0.u5.t49, i1.u2.t55, i1.u4.t51, i1.u6.t47, i1.u8.t43, i2.u10.t39, i2.u11.t37, i3....478
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 177945 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 06:13:33] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 06:13:33] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin10137020245211844446
[2024-05-21 06:13:33] [INFO ] Computing symmetric may disable matrix : 233 transitions.
[2024-05-21 06:13:33] [INFO ] Flatten gal took : 27 ms
[2024-05-21 06:13:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 06:13:33] [INFO ] Computing symmetric may enable matrix : 233 transitions.
[2024-05-21 06:13:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 06:13:33] [INFO ] Computing Do-Not-Accords matrix : 233 transitions.
[2024-05-21 06:13:33] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 06:13:33] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10137020245211844446
Running compilation step : cd /tmp/ltsmin10137020245211844446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10196923378105076529.txt' '-o' '/tmp/graph10196923378105076529.bin' '-w' '/tmp/graph10196923378105076529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10196923378105076529.bin' '-l' '-1' '-v' '-w' '/tmp/graph10196923378105076529.weights' '-q' '0' '-e' '0.001'
[2024-05-21 06:13:33] [INFO ] Decomposing Gal with order
[2024-05-21 06:13:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 06:13:33] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-21 06:13:33] [INFO ] Flatten gal took : 78 ms
[2024-05-21 06:13:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-21 06:13:33] [INFO ] Time to serialize gal into /tmp/LTLFireability3900371879421125315.gal : 15 ms
[2024-05-21 06:13:33] [INFO ] Time to serialize properties into /tmp/LTLFireability7632576273023015906.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3900371879421125315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7632576273023015906.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i6.i1.u39.p49==1)&&(i12.i2.u73.p214==1))")||(G(("(i3.i1.u13.p48==1)")||(X(X("((((i6.i1.u39.p49==1)&&(i12.i2.u73.p214==1))||...206
Formula 0 simplified : G(F(!"(i3.i1.u13.p48==1)" & XX!"((((i6.i1.u39.p49==1)&&(i12.i2.u73.p214==1))||(i6.i2.u36.p14==0))||(i6.i2.u60.p185==0))") & FG!"((i6...195
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t55, i0.u4.t51, i1.u6.t47, i1.u7.t45, i2.u9.t41, i3.i0.u15.t29, i3.i1.u13.t33, i4.i0.u1...517
Computing Next relation with stutter on 24 deadlock states
Compilation finished in 1119 ms.
Running link step : cd /tmp/ltsmin10137020245211844446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10137020245211844446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: LTL layer: formula: [](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.007: "[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.076: There are 237 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.076: State length is 264, there are 243 groups
pins2lts-mc-linux64( 0/ 8), 0.076: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.076: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.076: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.076: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.187: [Blue] ~21 levels ~960 states ~6088 transitions
pins2lts-mc-linux64( 7/ 8), 0.214: [Blue] ~24 levels ~1920 states ~7864 transitions
pins2lts-mc-linux64( 2/ 8), 0.252: [Blue] ~42 levels ~3840 states ~18392 transitions
pins2lts-mc-linux64( 2/ 8), 0.331: [Blue] ~42 levels ~7680 states ~35568 transitions
pins2lts-mc-linux64( 2/ 8), 0.516: [Blue] ~42 levels ~15360 states ~75864 transitions
pins2lts-mc-linux64( 2/ 8), 0.886: [Blue] ~42 levels ~30720 states ~162576 transitions
pins2lts-mc-linux64( 2/ 8), 1.532: [Blue] ~42 levels ~61440 states ~357512 transitions
pins2lts-mc-linux64( 4/ 8), 2.765: [Blue] ~41 levels ~122880 states ~696720 transitions
pins2lts-mc-linux64( 3/ 8), 4.700: [Blue] ~41 levels ~245760 states ~1514560 transitions
pins2lts-mc-linux64( 3/ 8), 7.941: [Blue] ~41 levels ~491520 states ~3223280 transitions
pins2lts-mc-linux64( 4/ 8), 13.048: [Blue] ~41 levels ~983040 states ~7013624 transitions
pins2lts-mc-linux64( 3/ 8), 21.915: [Blue] ~41 levels ~1966080 states ~15208984 transitions
pins2lts-mc-linux64( 6/ 8), 40.098: [Blue] ~221 levels ~3932160 states ~30354504 transitions
pins2lts-mc-linux64( 6/ 8), 73.965: [Blue] ~665 levels ~7864320 states ~56133528 transitions
pins2lts-mc-linux64( 6/ 8), 144.131: [Blue] ~1552 levels ~15728640 states ~112812376 transitions
pins2lts-mc-linux64( 6/ 8), 288.604: [Blue] ~2883 levels ~31457280 states ~233369264 transitions
pins2lts-mc-linux64( 6/ 8), 590.140: [Blue] ~6213 levels ~62914560 states ~486489160 transitions
pins2lts-mc-linux64( 3/ 8), 665.234: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 665.269:
pins2lts-mc-linux64( 0/ 8), 665.269: Explored 63741242 states 611047688 transitions, fanout: 9.586
pins2lts-mc-linux64( 0/ 8), 665.270: Total exploration time 665.160 sec (665.130 sec minimum, 665.149 sec on average)
pins2lts-mc-linux64( 0/ 8), 665.270: States per second: 95828, Transitions per second: 918648
pins2lts-mc-linux64( 0/ 8), 665.270:
pins2lts-mc-linux64( 0/ 8), 665.270: State space has 63741307 states, 27121151 are accepting
pins2lts-mc-linux64( 0/ 8), 665.270: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 665.270: blue states: 63741242 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 665.270: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 665.270: all-red states: 47653476 (74.76%), bogus 3476 (0.01%)
pins2lts-mc-linux64( 0/ 8), 665.270:
pins2lts-mc-linux64( 0/ 8), 665.270: Total memory used for local state coloring: 0.3MB
pins2lts-mc-linux64( 0/ 8), 665.270:
pins2lts-mc-linux64( 0/ 8), 665.270: Queue width: 8B, total height: 20097, memory: 0.15MB
pins2lts-mc-linux64( 0/ 8), 665.270: Tree memory: 742.3MB, 12.2 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 665.270: Tree fill ratio (roots/leafs): 47.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 665.270: Stored 233 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 665.270: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 665.270: Est. total memory use: 742.5MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10137020245211844446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10137020245211844446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 06:34:40] [INFO ] Applying decomposition
[2024-05-21 06:34:40] [INFO ] Flatten gal took : 11 ms
[2024-05-21 06:34:40] [INFO ] Decomposing Gal with order
[2024-05-21 06:34:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 06:34:40] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-21 06:34:40] [INFO ] Flatten gal took : 24 ms
[2024-05-21 06:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2024-05-21 06:34:40] [INFO ] Time to serialize gal into /tmp/LTLFireability4770537432909698628.gal : 7 ms
[2024-05-21 06:34:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16505907026290326540.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4770537432909698628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16505907026290326540.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p49==1)&&(p214==1))")||(G(("(p48==1)")||(X(X("((((p49==1)&&(p214==1))||(p14==0))||(p185==0))")))))))))
Formula 0 simplified : G(F(!"(p48==1)" & XX!"((((p49==1)&&(p214==1))||(p14==0))||(p185==0))") & FG!"((p49==1)&&(p214==1))")
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49...298
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
Total runtime 3545009 ms.

BK_STOP 1716275358138

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167100156"
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 ;