Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593200468.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r005-oct2-167813593200468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 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 1678514924673

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 06:08:47] [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]
[2023-03-11 06:08:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:08:47] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-11 06:08:47] [INFO ] Transformed 307 places.
[2023-03-11 06:08:47] [INFO ] Transformed 305 transitions.
[2023-03-11 06:08:47] [INFO ] Found NUPN structural information;
[2023-03-11 06:08:47] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 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 41 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2023-03-11 06:08:47] [INFO ] Computed 76 place invariants in 20 ms
[2023-03-11 06:08:49] [INFO ] Implicit Places using invariants in 1462 ms returned [28, 35, 56, 70, 77, 84, 87, 90, 93, 96, 102, 105, 108, 111, 114, 120, 182, 232, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298, 304, 306]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1521 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 276/307 places, 245/245 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 263 transition count 232
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 263 transition count 232
Applied a total of 26 rules in 35 ms. Remains 263 /276 variables (removed 13) and now considering 232/245 (removed 13) transitions.
// Phase 1: matrix 232 rows 263 cols
[2023-03-11 06:08:49] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-11 06:08:49] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-11 06:08:49] [INFO ] Invariant cache hit.
[2023-03-11 06:08:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-11 06:08:49] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/307 places, 232/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2100 ms. Remains : 263/307 places, 232/245 transitions.
Support contains 41 out of 263 places after structural reductions.
[2023-03-11 06:08:50] [INFO ] Flatten gal took : 47 ms
[2023-03-11 06:08:50] [INFO ] Flatten gal took : 23 ms
[2023-03-11 06:08:50] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 40 out of 263 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:08:50] [INFO ] Invariant cache hit.
[2023-03-11 06:08:50] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-11 06:08:50] [INFO ] After 102ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 06:08:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-11 06:08:50] [INFO ] After 13ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-11 06:08:50] [INFO ] After 38ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:08:50] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:08:50] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-11 06:08:50] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:08:50] [INFO ] After 9ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:08:50] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 06:08:50] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 2 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 208
Applied a total of 48 rules in 172 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-11 06:08:51] [INFO ] Computed 45 place invariants in 4 ms
[2023-03-11 06:08:51] [INFO ] Implicit Places using invariants in 149 ms returned [7, 14, 21, 40, 47, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 151 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/263 places, 208/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 231 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 230 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 230 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 229 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 229 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 228 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 228 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 227 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 227 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 226 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 226 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 225 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 225 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 224 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 224 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 223 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 223 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 222 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 222 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 221 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 221 transition count 196
Applied a total of 24 rules in 55 ms. Remains 221 /233 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 221 cols
[2023-03-11 06:08:51] [INFO ] Computed 39 place invariants in 3 ms
[2023-03-11 06:08:51] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-11 06:08:51] [INFO ] Invariant cache hit.
[2023-03-11 06:08:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:08:52] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 221/263 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 221/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s63 1), p2:(AND (NOT (AND (EQ s83 1) (EQ s191 1))) (NOT (AND (EQ s96 1) (EQ s215 1)))), p1:(AND (EQ s96 1) (EQ s215 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 642 ms.
Product exploration explored 100000 steps with 50000 reset in 426 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 p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 (NOT p1))
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-01 finished in 2245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(F(p1))))))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Applied a total of 0 rules in 18 ms. Remains 263 /263 variables (removed 0) and now considering 232/232 (removed 0) transitions.
// Phase 1: matrix 232 rows 263 cols
[2023-03-11 06:08:53] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-11 06:08:53] [INFO ] Implicit Places using invariants in 114 ms returned [14, 40, 47, 60, 89, 102]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 116 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/263 places, 232/232 transitions.
Applied a total of 0 rules in 5 ms. Remains 257 /257 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 257/263 places, 232/232 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s160 1)), p1:(OR (AND (EQ s7 1) (EQ s160 1)) (AND (EQ s20 1) (EQ s102 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-02 finished in 441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 208
Applied a total of 48 rules in 96 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-11 06:08:54] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 06:08:54] [INFO ] Implicit Places using invariants in 146 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 149 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/263 places, 208/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 224 transition count 201
Applied a total of 14 rules in 16 ms. Remains 224 /231 variables (removed 7) and now considering 201/208 (removed 7) transitions.
// Phase 1: matrix 201 rows 224 cols
[2023-03-11 06:08:54] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:08:54] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-11 06:08:54] [INFO ] Invariant cache hit.
[2023-03-11 06:08:54] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 224/263 places, 201/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 627 ms. Remains : 224/263 places, 201/232 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s129 0), p1:(EQ s47 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1823 reset in 303 ms.
Product exploration explored 100000 steps with 1858 reset in 303 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 410 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 182 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1235831 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :{}
Probabilistic random walk after 1235831 steps, saw 143634 distinct states, run finished after 3003 ms. (steps per millisecond=411 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:08:59] [INFO ] Invariant cache hit.
[2023-03-11 06:08:59] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:08:59] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-11 06:08:59] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:08:59] [INFO ] Deduced a trap composed of 112 places in 120 ms of which 2 ms to minimize.
[2023-03-11 06:08:59] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 25 ms to minimize.
[2023-03-11 06:08:59] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2023-03-11 06:09:00] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 7 ms to minimize.
[2023-03-11 06:09:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 551 ms
[2023-03-11 06:09:00] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 06:09:00] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 6 ms.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 201/201 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 224 transition count 141
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 164 transition count 141
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 120 place count 164 transition count 128
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 146 place count 151 transition count 128
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 198 place count 125 transition count 102
Free-agglomeration rule applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 236 place count 125 transition count 64
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 274 place count 87 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 86 transition count 63
Reduce places removed 35 places and 0 transitions.
Graph (trivial) has 58 edges and 51 vertex of which 23 / 51 are part of one of the 1 SCC in 3 ms
Free SCC test removed 22 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 56 rules applied. Total rules applied 331 place count 29 transition count 43
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 384 place count 9 transition count 10
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 385 place count 8 transition count 9
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 388 place count 7 transition count 8
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 391 place count 7 transition count 5
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 395 place count 4 transition count 4
Applied a total of 395 rules in 62 ms. Remains 4 /224 variables (removed 220) and now considering 4/201 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 4/224 places, 4/201 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 409 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-11 06:09:01] [INFO ] Invariant cache hit.
[2023-03-11 06:09:01] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-11 06:09:01] [INFO ] Invariant cache hit.
[2023-03-11 06:09:01] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-11 06:09:01] [INFO ] Invariant cache hit.
[2023-03-11 06:09:01] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 224/224 places, 201/201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 189 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:09:02] [INFO ] Invariant cache hit.
[2023-03-11 06:09:02] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:09:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2023-03-11 06:09:02] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:09:02] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 1 ms to minimize.
[2023-03-11 06:09:02] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 1 ms to minimize.
[2023-03-11 06:09:03] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 1 ms to minimize.
[2023-03-11 06:09:03] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 0 ms to minimize.
[2023-03-11 06:09:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 451 ms
[2023-03-11 06:09:03] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 06:09:03] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 201/201 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 224 transition count 141
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 164 transition count 141
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 120 place count 164 transition count 128
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 146 place count 151 transition count 128
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 198 place count 125 transition count 102
Free-agglomeration rule applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 236 place count 125 transition count 64
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 274 place count 87 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 86 transition count 63
Reduce places removed 35 places and 0 transitions.
Graph (trivial) has 58 edges and 51 vertex of which 23 / 51 are part of one of the 1 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 56 rules applied. Total rules applied 331 place count 29 transition count 43
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 384 place count 9 transition count 10
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 385 place count 8 transition count 9
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 388 place count 7 transition count 8
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 391 place count 7 transition count 5
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 395 place count 4 transition count 4
Applied a total of 395 rules in 17 ms. Remains 4 /224 variables (removed 220) and now considering 4/201 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 4/224 places, 4/201 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1813 reset in 265 ms.
Product exploration explored 100000 steps with 1902 reset in 217 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 201/201 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 224 transition count 201
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 60 place count 224 transition count 201
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 224 transition count 201
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 119 place count 178 transition count 155
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 165 place count 178 transition count 155
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 191 place count 178 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 195 place count 174 transition count 151
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 199 place count 174 transition count 151
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 199 rules in 43 ms. Remains 174 /224 variables (removed 50) and now considering 151/201 (removed 50) transitions.
[2023-03-11 06:09:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 151 rows 174 cols
[2023-03-11 06:09:05] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:09:05] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/224 places, 151/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 174/224 places, 151/201 transitions.
Built C files in :
/tmp/ltsmin8210183263407168438
[2023-03-11 06:09:05] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8210183263407168438
Running compilation step : cd /tmp/ltsmin8210183263407168438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 551 ms.
Running link step : cd /tmp/ltsmin8210183263407168438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin8210183263407168438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14649697783170087527.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 201/201 transitions.
Applied a total of 0 rules in 11 ms. Remains 224 /224 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 224 cols
[2023-03-11 06:09:20] [INFO ] Computed 37 place invariants in 4 ms
[2023-03-11 06:09:20] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-11 06:09:20] [INFO ] Invariant cache hit.
[2023-03-11 06:09:20] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-11 06:09:20] [INFO ] Invariant cache hit.
[2023-03-11 06:09:20] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 224/224 places, 201/201 transitions.
Built C files in :
/tmp/ltsmin10308038853686695190
[2023-03-11 06:09:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10308038853686695190
Running compilation step : cd /tmp/ltsmin10308038853686695190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 329 ms.
Running link step : cd /tmp/ltsmin10308038853686695190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin10308038853686695190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9114006423331725895.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:09:36] [INFO ] Flatten gal took : 18 ms
[2023-03-11 06:09:36] [INFO ] Flatten gal took : 12 ms
[2023-03-11 06:09:36] [INFO ] Time to serialize gal into /tmp/LTL2205236213709224024.gal : 4 ms
[2023-03-11 06:09:36] [INFO ] Time to serialize properties into /tmp/LTL18235913026911359972.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2205236213709224024.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7215944023807057325.hoa' '-atoms' '/tmp/LTL18235913026911359972.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18235913026911359972.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7215944023807057325.hoa
Detected timeout of ITS tools.
[2023-03-11 06:09:51] [INFO ] Flatten gal took : 24 ms
[2023-03-11 06:09:51] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:09:51] [INFO ] Time to serialize gal into /tmp/LTL6838845511907638007.gal : 3 ms
[2023-03-11 06:09:51] [INFO ] Time to serialize properties into /tmp/LTL7154254295757383689.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6838845511907638007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7154254295757383689.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p153==0)")||(F("(p54==0)"))))))
Formula 0 simplified : XF(!"(p153==0)" & G!"(p54==0)")
Detected timeout of ITS tools.
[2023-03-11 06:10:06] [INFO ] Flatten gal took : 10 ms
[2023-03-11 06:10:06] [INFO ] Applying decomposition
[2023-03-11 06:10:06] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14084218981403587527.txt' '-o' '/tmp/graph14084218981403587527.bin' '-w' '/tmp/graph14084218981403587527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14084218981403587527.bin' '-l' '-1' '-v' '-w' '/tmp/graph14084218981403587527.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:10:06] [INFO ] Decomposing Gal with order
[2023-03-11 06:10:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:10:06] [INFO ] Removed a total of 24 redundant transitions.
[2023-03-11 06:10:06] [INFO ] Flatten gal took : 46 ms
[2023-03-11 06:10:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-11 06:10:06] [INFO ] Time to serialize gal into /tmp/LTL5152771024946244773.gal : 4 ms
[2023-03-11 06:10:06] [INFO ] Time to serialize properties into /tmp/LTL2675623387620936138.ltl : 6 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5152771024946244773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2675623387620936138.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i10.i0.u50.p153==0)")||(F("(i18.u15.p54==0)"))))))
Formula 0 simplified : XF(!"(i10.i0.u50.p153==0)" & G!"(i18.u15.p54==0)")
Reverse transition relation is NOT exact ! Due to transitions t200, i0.u2.t55, i0.u4.t51, i1.i0.u3.t53, i1.i1.u5.t49, i2.u9.t41, i3.u16.t27, i3.u17.t25, i4...492
Computing Next relation with stutter on 24 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
28 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.315849,30680,1,0,35357,180,2615,44241,124,287,64354
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-12a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-12a-LTLFireability-04 finished in 73070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))||F(p1)) U X(p2)))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Applied a total of 10 rules in 21 ms. Remains 258 /263 variables (removed 5) and now considering 227/232 (removed 5) transitions.
// Phase 1: matrix 227 rows 258 cols
[2023-03-11 06:10:07] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-11 06:10:07] [INFO ] Implicit Places using invariants in 370 ms returned [7, 14, 21, 47, 60, 89, 102]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 371 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 251/263 places, 227/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 251/263 places, 227/232 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s169 1), p2:(AND (EQ s37 1) (EQ s159 1)), p0:(AND (EQ s82 1) (EQ s220 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-05 finished in 694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0 U (p1||G(p0))))))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 208
Applied a total of 48 rules in 122 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-11 06:10:07] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 06:10:08] [INFO ] Implicit Places using invariants in 294 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 296 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/263 places, 208/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 219 transition count 196
Applied a total of 24 rules in 20 ms. Remains 219 /231 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-11 06:10:08] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:10:08] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 06:10:08] [INFO ] Invariant cache hit.
[2023-03-11 06:10:08] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 628 ms. Remains : 219/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (NOT (AND (EQ s58 1) (EQ s167 1))) (NEQ s78 1)), p0:(NEQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F((p1&&F(p2)))))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Applied a total of 44 rules in 78 ms. Remains 241 /263 variables (removed 22) and now considering 210/232 (removed 22) transitions.
// Phase 1: matrix 210 rows 241 cols
[2023-03-11 06:10:08] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 06:10:09] [INFO ] Implicit Places using invariants in 479 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 493 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/263 places, 210/232 transitions.
Applied a total of 0 rules in 2 ms. Remains 233 /233 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 573 ms. Remains : 233/263 places, 210/232 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s197 1)), p1:(OR (EQ s24 0) (EQ s197 0)), p2:(EQ s120 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-09 finished in 898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(X(!p0)))))))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 208
Applied a total of 48 rules in 72 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-11 06:10:09] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 06:10:09] [INFO ] Implicit Places using invariants in 102 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 103 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/263 places, 208/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 219 transition count 196
Applied a total of 24 rules in 27 ms. Remains 219 /231 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-11 06:10:09] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:10:09] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-11 06:10:09] [INFO ] Invariant cache hit.
[2023-03-11 06:10:10] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 799 ms. Remains : 219/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 339 ms :[false, false, false, p0, p0, true]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16657 reset in 384 ms.
Product exploration explored 100000 steps with 16714 reset in 367 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[false, false, false, p0, p0, true]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1848145 steps, run timeout after 3001 ms. (steps per millisecond=615 ) properties seen :{}
Probabilistic random walk after 1848145 steps, saw 210227 distinct states, run finished after 3001 ms. (steps per millisecond=615 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:10:15] [INFO ] Invariant cache hit.
[2023-03-11 06:10:15] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-11 06:10:15] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 06:10:15] [INFO ] After 197ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 06:10:15] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 297 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 349 ms :[false, false, false, p0, p0, true]
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 196/196 transitions.
Applied a total of 0 rules in 48 ms. Remains 219 /219 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-11 06:10:16] [INFO ] Invariant cache hit.
[2023-03-11 06:10:16] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-11 06:10:16] [INFO ] Invariant cache hit.
[2023-03-11 06:10:16] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-11 06:10:16] [INFO ] Invariant cache hit.
[2023-03-11 06:10:17] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 675 ms. Remains : 219/219 places, 196/196 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[false, false, false, p0, p0, true]
Incomplete random walk after 10000 steps, including 178 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1830625 steps, run timeout after 3001 ms. (steps per millisecond=610 ) properties seen :{}
Probabilistic random walk after 1830625 steps, saw 208512 distinct states, run finished after 3014 ms. (steps per millisecond=607 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:10:20] [INFO ] Invariant cache hit.
[2023-03-11 06:10:20] [INFO ] [Real]Absence check using 37 positive place invariants in 62 ms returned sat
[2023-03-11 06:10:20] [INFO ] After 77ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 06:10:20] [INFO ] After 126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 06:10:20] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 303 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 340 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 288 ms :[false, false, false, p0, p0, true]
Product exploration explored 100000 steps with 16713 reset in 364 ms.
Product exploration explored 100000 steps with 16629 reset in 381 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 391 ms :[false, false, false, p0, p0, true]
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 196/196 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 219 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 58 place count 219 transition count 196
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 219 transition count 196
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 114 place count 175 transition count 152
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 158 place count 175 transition count 152
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 184 place count 175 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 188 place count 171 transition count 148
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 192 place count 171 transition count 148
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 192 rules in 28 ms. Remains 171 /219 variables (removed 48) and now considering 148/196 (removed 48) transitions.
[2023-03-11 06:10:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 148 rows 171 cols
[2023-03-11 06:10:23] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:10:23] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/219 places, 148/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 171/219 places, 148/196 transitions.
Built C files in :
/tmp/ltsmin4478184563310033788
[2023-03-11 06:10:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4478184563310033788
Running compilation step : cd /tmp/ltsmin4478184563310033788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 318 ms.
Running link step : cd /tmp/ltsmin4478184563310033788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4478184563310033788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1816257784528011244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-11 06:10:38] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:10:39] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-11 06:10:39] [INFO ] Invariant cache hit.
[2023-03-11 06:10:39] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2023-03-11 06:10:39] [INFO ] Invariant cache hit.
[2023-03-11 06:10:40] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1295 ms. Remains : 219/219 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin15787380115470028161
[2023-03-11 06:10:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15787380115470028161
Running compilation step : cd /tmp/ltsmin15787380115470028161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 370 ms.
Running link step : cd /tmp/ltsmin15787380115470028161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15787380115470028161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6501137767471502944.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:10:55] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:10:55] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:10:55] [INFO ] Time to serialize gal into /tmp/LTL6037201198921263181.gal : 3 ms
[2023-03-11 06:10:55] [INFO ] Time to serialize properties into /tmp/LTL16417111893612361795.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6037201198921263181.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3731974242515865568.hoa' '-atoms' '/tmp/LTL16417111893612361795.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16417111893612361795.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3731974242515865568.hoa
Detected timeout of ITS tools.
[2023-03-11 06:11:10] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:11:10] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:11:10] [INFO ] Time to serialize gal into /tmp/LTL10018863135855584559.gal : 2 ms
[2023-03-11 06:11:10] [INFO ] Time to serialize properties into /tmp/LTL5707836220078434568.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10018863135855584559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5707836220078434568.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p19==1)")||(X(X("(p19!=1)"))))))))
Formula 0 simplified : XXF(!"(p19==1)" & XX!"(p19!=1)")
Detected timeout of ITS tools.
[2023-03-11 06:11:25] [INFO ] Flatten gal took : 22 ms
[2023-03-11 06:11:25] [INFO ] Applying decomposition
[2023-03-11 06:11:25] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15666641565215247520.txt' '-o' '/tmp/graph15666641565215247520.bin' '-w' '/tmp/graph15666641565215247520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15666641565215247520.bin' '-l' '-1' '-v' '-w' '/tmp/graph15666641565215247520.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:11:25] [INFO ] Decomposing Gal with order
[2023-03-11 06:11:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:11:25] [INFO ] Removed a total of 24 redundant transitions.
[2023-03-11 06:11:25] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:11:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-11 06:11:25] [INFO ] Time to serialize gal into /tmp/LTL10126385265774723238.gal : 3 ms
[2023-03-11 06:11:25] [INFO ] Time to serialize properties into /tmp/LTL10214070298972336695.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10126385265774723238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10214070298972336695.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i16.u5.p19==1)")||(X(X("(i16.u5.p19!=1)"))))))))
Formula 0 simplified : XXF(!"(i16.u5.p19==1)" & XX!"(i16.u5.p19!=1)")
Reverse transition relation is NOT exact ! Due to transitions t145, i0.i0.u7.t45, i0.i1.u9.t41, i1.u6.t47, i1.u8.t43, i2.u13.t33, i3.u15.t29, i4.u16.t27, i...484
Computing Next relation with stutter on 24 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.340224,29476,1,0,32489,179,2469,42584,121,367,60126
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-12a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-12a-LTLFireability-10 finished in 76480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U p2)))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Applied a total of 40 rules in 129 ms. Remains 243 /263 variables (removed 20) and now considering 212/232 (removed 20) transitions.
// Phase 1: matrix 212 rows 243 cols
[2023-03-11 06:11:26] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 06:11:26] [INFO ] Implicit Places using invariants in 142 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 143 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/263 places, 212/232 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 277 ms. Remains : 235/263 places, 212/232 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s118 1), p0:(EQ s33 1), p1:(OR (EQ s20 1) (EQ s21 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 389 ms.
Product exploration explored 100000 steps with 50000 reset in 478 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 4 factoid took 341 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-11 finished in 1678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 263 transition count 174
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 205 transition count 174
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 116 place count 205 transition count 150
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 164 place count 181 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 180 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 180 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 179 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 179 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 178 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 178 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 177 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 177 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 176 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 176 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 175 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 175 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 174 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 174 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 173 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 173 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 172 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 172 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 171 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 171 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 170 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 170 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 169 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 169 transition count 138
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 236 place count 145 transition count 114
Applied a total of 236 rules in 95 ms. Remains 145 /263 variables (removed 118) and now considering 114/232 (removed 118) transitions.
// Phase 1: matrix 114 rows 145 cols
[2023-03-11 06:11:27] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 06:11:27] [INFO ] Implicit Places using invariants in 138 ms returned [5, 10, 15, 28, 33, 42, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 161 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/263 places, 114/232 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 125 transition count 89
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 100 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 99 transition count 88
Applied a total of 52 rules in 12 ms. Remains 99 /125 variables (removed 26) and now considering 88/114 (removed 26) transitions.
// Phase 1: matrix 88 rows 99 cols
[2023-03-11 06:11:27] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-11 06:11:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 06:11:28] [INFO ] Invariant cache hit.
[2023-03-11 06:11:28] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-11 06:11:28] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/263 places, 88/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 643 ms. Remains : 99/263 places, 88/232 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-12 finished in 1423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 263 transition count 176
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 207 transition count 176
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 112 place count 207 transition count 153
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 158 place count 184 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 183 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 183 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 182 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 182 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 181 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 181 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 180 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 180 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 179 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 179 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 178 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 178 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 177 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 177 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 176 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 176 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 175 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 175 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 174 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 174 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 173 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 173 transition count 142
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 230 place count 148 transition count 117
Applied a total of 230 rules in 62 ms. Remains 148 /263 variables (removed 115) and now considering 117/232 (removed 115) transitions.
// Phase 1: matrix 117 rows 148 cols
[2023-03-11 06:11:29] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 06:11:29] [INFO ] Implicit Places using invariants in 284 ms returned [5, 10, 15, 28, 33, 55, 56, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 285 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/263 places, 117/232 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 130 transition count 96
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 109 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 42 place count 109 transition count 95
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 108 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 107 transition count 94
Applied a total of 46 rules in 6 ms. Remains 107 /130 variables (removed 23) and now considering 94/117 (removed 23) transitions.
// Phase 1: matrix 94 rows 107 cols
[2023-03-11 06:11:29] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-11 06:11:29] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-11 06:11:29] [INFO ] Invariant cache hit.
[2023-03-11 06:11:29] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-11 06:11:29] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/263 places, 94/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 643 ms. Remains : 107/263 places, 94/232 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s53 1)), p1:(AND (EQ s50 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-14 finished in 812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Applied a total of 2 rules in 6 ms. Remains 262 /263 variables (removed 1) and now considering 231/232 (removed 1) transitions.
// Phase 1: matrix 231 rows 262 cols
[2023-03-11 06:11:29] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-11 06:11:30] [INFO ] Implicit Places using invariants in 161 ms returned [7, 21, 40, 60, 89, 102]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 169 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 256/263 places, 231/232 transitions.
Applied a total of 0 rules in 2 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 256/263 places, 231/232 transitions.
Stuttering acceptance computed with spot in 346 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(EQ s43 1), p0:(AND (EQ s44 1) (EQ s189 1)), p2:(OR (AND (EQ s44 1) (EQ s189 1)) (EQ s13 0) (EQ s160 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7229 reset in 284 ms.
Product exploration explored 100000 steps with 7083 reset in 318 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 (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 248 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 200 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))]
Finished random walk after 2568 steps, including 50 resets, run visited all 3 properties in 14 ms. (steps per millisecond=183 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 3 factoid took 238 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))]
Stuttering acceptance computed with spot in 327 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 2 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 256 cols
[2023-03-11 06:11:32] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-11 06:11:32] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-11 06:11:32] [INFO ] Invariant cache hit.
[2023-03-11 06:11:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 06:11:33] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2023-03-11 06:11:33] [INFO ] Invariant cache hit.
[2023-03-11 06:11:33] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1217 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 (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 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 267 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))]
Finished random walk after 180 steps, including 2 resets, run visited all 3 properties in 18 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 3 factoid took 260 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 304 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 306 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 264 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 7185 reset in 293 ms.
Product exploration explored 100000 steps with 7262 reset in 315 ms.
Built C files in :
/tmp/ltsmin2832265324478302152
[2023-03-11 06:11:36] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2832265324478302152
Running compilation step : cd /tmp/ltsmin2832265324478302152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 402 ms.
Running link step : cd /tmp/ltsmin2832265324478302152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2832265324478302152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11704846855859236745.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 4 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2023-03-11 06:11:51] [INFO ] Invariant cache hit.
[2023-03-11 06:11:51] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-11 06:11:51] [INFO ] Invariant cache hit.
[2023-03-11 06:11:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 06:11:51] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-11 06:11:51] [INFO ] Invariant cache hit.
[2023-03-11 06:11:51] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 256/256 places, 231/231 transitions.
Built C files in :
/tmp/ltsmin13901888651898200305
[2023-03-11 06:11:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13901888651898200305
Running compilation step : cd /tmp/ltsmin13901888651898200305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 337 ms.
Running link step : cd /tmp/ltsmin13901888651898200305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin13901888651898200305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2981865164558153027.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:12:06] [INFO ] Flatten gal took : 19 ms
[2023-03-11 06:12:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:12:06] [INFO ] Time to serialize gal into /tmp/LTL10942811189219329291.gal : 2 ms
[2023-03-11 06:12:06] [INFO ] Time to serialize properties into /tmp/LTL12839767454182497482.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10942811189219329291.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7795355725769033239.hoa' '-atoms' '/tmp/LTL12839767454182497482.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12839767454182497482.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7795355725769033239.hoa
Detected timeout of ITS tools.
[2023-03-11 06:12:21] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:12:21] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:12:22] [INFO ] Time to serialize gal into /tmp/LTL14514748809151048910.gal : 2 ms
[2023-03-11 06:12:22] [INFO ] Time to serialize properties into /tmp/LTL3190060770517021793.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14514748809151048910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3190060770517021793.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
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.
[2023-03-11 06:12:37] [INFO ] Flatten gal took : 25 ms
[2023-03-11 06:12:37] [INFO ] Applying decomposition
[2023-03-11 06:12:37] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph6946681915023212712.txt' '-o' '/tmp/graph6946681915023212712.bin' '-w' '/tmp/graph6946681915023212712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6946681915023212712.bin' '-l' '-1' '-v' '-w' '/tmp/graph6946681915023212712.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:12:37] [INFO ] Decomposing Gal with order
[2023-03-11 06:12:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:12:37] [INFO ] Removed a total of 27 redundant transitions.
[2023-03-11 06:12:37] [INFO ] Flatten gal took : 32 ms
[2023-03-11 06:12:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-11 06:12:37] [INFO ] Time to serialize gal into /tmp/LTL10735778242046056758.gal : 8 ms
[2023-03-11 06:12:37] [INFO ] Time to serialize properties into /tmp/LTL1981163445291441902.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10735778242046056758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1981163445291441902.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G(("(i2.i1.u13.p48==1)")||(X(X("((((i7.i0.u38.p49==1)&&(i15.i1.u75.p214==1))||(i7.i1.u36.p14==0))||(i7.i1.u63.p185==0))")))))|...206
Formula 0 simplified : G(F(!"(i2.i1.u13.p48==1)" & XX!"((((i7.i0.u38.p49==1)&&(i15.i1.u75.p214==1))||(i7.i1.u36.p14==0))||(i7.i1.u63.p185==0))") & FG!"((i7...195
Reverse transition relation is NOT exact ! Due to transitions i0.u4.t51, i0.u5.t49, i1.u7.t45, i2.i0.u11.t37, i2.i1.u13.t33, i3.u14.t31, i3.u16.t27, i4.u15...506
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15142734746587874852
[2023-03-11 06:12:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15142734746587874852
Running compilation step : cd /tmp/ltsmin15142734746587874852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 325 ms.
Running link step : cd /tmp/ltsmin15142734746587874852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin15142734746587874852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](((LTLAPp0==true)||X(X((LTLAPp1==true)))))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 97481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||X(X(p2))))))))'
[2023-03-11 06:13:07] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4386349718840736021
[2023-03-11 06:13:07] [INFO ] Computing symmetric may disable matrix : 232 transitions.
[2023-03-11 06:13:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:13:07] [INFO ] Computing symmetric may enable matrix : 232 transitions.
[2023-03-11 06:13:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:13:07] [INFO ] Applying decomposition
[2023-03-11 06:13:07] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15683175505642098488.txt' '-o' '/tmp/graph15683175505642098488.bin' '-w' '/tmp/graph15683175505642098488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15683175505642098488.bin' '-l' '-1' '-v' '-w' '/tmp/graph15683175505642098488.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:13:07] [INFO ] Decomposing Gal with order
[2023-03-11 06:13:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:13:07] [INFO ] Computing Do-Not-Accords matrix : 232 transitions.
[2023-03-11 06:13:07] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:13:07] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4386349718840736021
Running compilation step : cd /tmp/ltsmin4386349718840736021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 06:13:07] [INFO ] Removed a total of 33 redundant transitions.
[2023-03-11 06:13:07] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-11 06:13:07] [INFO ] Time to serialize gal into /tmp/LTLFireability14581370496529728859.gal : 4 ms
[2023-03-11 06:13:07] [INFO ] Time to serialize properties into /tmp/LTLFireability3323571064175469364.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14581370496529728859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3323571064175469364.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i10.i0.u40.p49==1)&&(i10.i0.u78.p214==1))")||(G(("(i16.u14.p48==1)")||(X(X("((((i10.i0.u40.p49==1)&&(i10.i0.u78.p214==1))||...200
Formula 0 simplified : G(F(!"(i16.u14.p48==1)" & XX!"((((i10.i0.u40.p49==1)&&(i10.i0.u78.p214==1))||(i4.u65.p14==0))||(i4.u66.p185==0))") & FG!"((i10.i0.u4...189
Compilation finished in 404 ms.
Running link step : cd /tmp/ltsmin4386349718840736021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin4386349718840736021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u10.t41, i0.i2.u12.t37, i1.u18.t25, i4.t121, i4.t85, i5.i0.u0.t59, i5.i1.u3.t55, i5.i1....491
Computing Next relation with stutter on 24 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: LTL layer: formula: [](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 7/ 8), 0.004: "[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.097: There are 236 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.097: State length is 264, there are 242 groups
pins2lts-mc-linux64( 0/ 8), 0.097: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.097: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.097: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.097: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.161: [Blue] ~15 levels ~960 states ~4616 transitions
pins2lts-mc-linux64( 2/ 8), 0.184: [Blue] ~18 levels ~1920 states ~6968 transitions
pins2lts-mc-linux64( 7/ 8), 0.206: [Blue] ~41 levels ~3840 states ~16488 transitions
pins2lts-mc-linux64( 7/ 8), 0.240: [Blue] ~41 levels ~7680 states ~34136 transitions
pins2lts-mc-linux64( 1/ 8), 0.334: [Blue] ~41 levels ~15360 states ~64792 transitions
pins2lts-mc-linux64( 1/ 8), 0.493: [Blue] ~41 levels ~30720 states ~152232 transitions
pins2lts-mc-linux64( 7/ 8), 0.864: [Blue] ~1763 levels ~61440 states ~200088 transitions
pins2lts-mc-linux64( 6/ 8), 1.430: [Blue] ~130 levels ~122880 states ~560640 transitions
pins2lts-mc-linux64( 6/ 8), 2.464: [Blue] ~130 levels ~245760 states ~1313064 transitions
pins2lts-mc-linux64( 6/ 8), 4.183: [Blue] ~203 levels ~491520 states ~2748600 transitions
pins2lts-mc-linux64( 6/ 8), 7.194: [Blue] ~277 levels ~983040 states ~5955728 transitions
pins2lts-mc-linux64( 6/ 8), 12.505: [Blue] ~425 levels ~1966080 states ~12220784 transitions
pins2lts-mc-linux64( 6/ 8), 23.007: [Blue] ~646 levels ~3932160 states ~25675224 transitions
pins2lts-mc-linux64( 6/ 8), 44.891: [Blue] ~1165 levels ~7864320 states ~53653056 transitions
pins2lts-mc-linux64( 6/ 8), 88.433: [Blue] ~2052 levels ~15728640 states ~112772280 transitions
pins2lts-mc-linux64( 6/ 8), 177.924: [Blue] ~3900 levels ~31457280 states ~236463368 transitions
pins2lts-mc-linux64( 6/ 8), 364.158: [Blue] ~6639 levels ~62914560 states ~502827400 transitions
pins2lts-mc-linux64( 3/ 8), 623.455: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 623.536:
pins2lts-mc-linux64( 0/ 8), 623.536: Explored 91505574 states 886443277 transitions, fanout: 9.687
pins2lts-mc-linux64( 0/ 8), 623.536: Total exploration time 623.430 sec (623.350 sec minimum, 623.385 sec on average)
pins2lts-mc-linux64( 0/ 8), 623.536: States per second: 146778, Transitions per second: 1421881
pins2lts-mc-linux64( 0/ 8), 623.536:
pins2lts-mc-linux64( 0/ 8), 623.536: State space has 91459686 states, 38881681 are accepting
pins2lts-mc-linux64( 0/ 8), 623.536: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 623.536: blue states: 91505574 (100.05%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 623.536: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 623.536: all-red states: 72098441 (78.83%), bogus 40401 (0.04%)
pins2lts-mc-linux64( 0/ 8), 623.536:
pins2lts-mc-linux64( 0/ 8), 623.536: Total memory used for local state coloring: 0.6MB
pins2lts-mc-linux64( 0/ 8), 623.536:
pins2lts-mc-linux64( 0/ 8), 623.536: Queue width: 8B, total height: 38869, memory: 0.30MB
pins2lts-mc-linux64( 0/ 8), 623.536: Tree memory: 953.8MB, 10.9 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 623.536: Tree fill ratio (roots/leafs): 68.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 623.536: Stored 232 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 623.536: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 623.536: Est. total memory use: 954.1MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4386349718840736021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4386349718840736021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-11 06:34:34] [INFO ] Applying decomposition
[2023-03-11 06:34:34] [INFO ] Flatten gal took : 21 ms
[2023-03-11 06:34:34] [INFO ] Decomposing Gal with order
[2023-03-11 06:34:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:34:34] [INFO ] Removed a total of 44 redundant transitions.
[2023-03-11 06:34:34] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:34:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2023-03-11 06:34:34] [INFO ] Time to serialize gal into /tmp/LTLFireability11773665326145112850.gal : 2 ms
[2023-03-11 06:34:34] [INFO ] Time to serialize properties into /tmp/LTLFireability16012708590364430740.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11773665326145112850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16012708590364430740.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u21.p49==1)&&(u62.p214==1))")||(G(("(u20.p48==1)")||(X(X("((((u21.p49==1)&&(u62.p214==1))||(u6.p14==0))||(u62.p185==0))")))...161
Formula 0 simplified : G(F(!"(u20.p48==1)" & XX!"((((u21.p49==1)&&(u62.p214==1))||(u6.p14==0))||(u62.p185==0))") & FG!"((u21.p49==1)&&(u62.p214==1))")
Reverse transition relation is NOT exact ! Due to transitions t97, t121, u1.t59, u2.t57, u4.t55, u5.t53, u7.t51, u8.t49, u10.t47, u11.t45, u13.t43, u14.t41...383
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
[2023-03-11 06:56:16] [INFO ] Flatten gal took : 452 ms
[2023-03-11 06:56:18] [INFO ] Input system was already deterministic with 232 transitions.
[2023-03-11 06:56:18] [INFO ] Transformed 263 places.
[2023-03-11 06:56:18] [INFO ] Transformed 232 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
[2023-03-11 06:56:18] [INFO ] Time to serialize gal into /tmp/LTLFireability9117140154637166105.gal : 18 ms
[2023-03-11 06:56:18] [INFO ] Time to serialize properties into /tmp/LTLFireability3027512490489711518.ltl : 14 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9117140154637166105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3027512490489711518.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p49==1)&&(p214==1))")||(G(("(p48==1)")||(X(X("((((p49==1)&&(p214==1))||(p14==0))||(p185==0))")))))))))
Formula 0 simplified : G(F(!"(p48==1)" & XX!"((((p49==1)&&(p214==1))||(p14==0))||(p185==0))") & FG!"((p49==1)&&(p214==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9565404 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097416 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-5348"
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 r005-oct2-167813593200468"
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 ;