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.r009-oct2-167813597900468.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 ltsminxred
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 r009-oct2-167813597900468
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:21:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:21:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:21:00] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-12 14:21:00] [INFO ] Transformed 307 places.
[2023-03-12 14:21:00] [INFO ] Transformed 305 transitions.
[2023-03-12 14:21:00] [INFO ] Found NUPN structural information;
[2023-03-12 14:21:00] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 53 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2023-03-12 14:21:00] [INFO ] Computed 76 place invariants in 16 ms
[2023-03-12 14:21:03] [INFO ] Implicit Places using invariants in 2426 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 2459 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 29 ms. Remains 263 /276 variables (removed 13) and now considering 232/245 (removed 13) transitions.
// Phase 1: matrix 232 rows 263 cols
[2023-03-12 14:21:03] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-12 14:21:03] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-12 14:21:03] [INFO ] Invariant cache hit.
[2023-03-12 14:21:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 14:21:04] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 757 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 3299 ms. Remains : 263/307 places, 232/245 transitions.
Support contains 41 out of 263 places after structural reductions.
[2023-03-12 14:21:04] [INFO ] Flatten gal took : 90 ms
[2023-03-12 14:21:04] [INFO ] Flatten gal took : 19 ms
[2023-03-12 14:21:04] [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 178 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 26) seen :25
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-12 14:21:04] [INFO ] Invariant cache hit.
[2023-03-12 14:21:05] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:21:05] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-12 14:21:05] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:21:05] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 14:21:05] [INFO ] After 54ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:21:05] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-12 14:21:05] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
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 193 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-12 14:21:06] [INFO ] Computed 45 place invariants in 4 ms
[2023-03-12 14:21:06] [INFO ] Implicit Places using invariants in 229 ms returned [7, 14, 21, 40, 47, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 232 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 39 ms. Remains 221 /233 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 221 cols
[2023-03-12 14:21:06] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-12 14:21:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 14:21:06] [INFO ] Invariant cache hit.
[2023-03-12 14:21:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:21:06] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 321 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 786 ms. Remains : 221/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 336 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 600 ms.
Product exploration explored 100000 steps with 50000 reset in 437 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 283 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 2609 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 4 ms. Remains 263 /263 variables (removed 0) and now considering 232/232 (removed 0) transitions.
// Phase 1: matrix 232 rows 263 cols
[2023-03-12 14:21:08] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-12 14:21:08] [INFO ] Implicit Places using invariants in 228 ms returned [14, 40, 47, 60, 89, 102]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 244 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 2 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 251 ms. Remains : 257/263 places, 232/232 transitions.
Stuttering acceptance computed with spot in 375 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 149 steps with 1 reset in 6 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-02 finished in 651 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 173 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-12 14:21:09] [INFO ] Computed 45 place invariants in 5 ms
[2023-03-12 14:21:09] [INFO ] Implicit Places using invariants in 165 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 168 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 20 ms. Remains 224 /231 variables (removed 7) and now considering 201/208 (removed 7) transitions.
// Phase 1: matrix 201 rows 224 cols
[2023-03-12 14:21:09] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-12 14:21:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 14:21:09] [INFO ] Invariant cache hit.
[2023-03-12 14:21:09] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 265 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 626 ms. Remains : 224/263 places, 201/232 transitions.
Stuttering acceptance computed with spot in 238 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 1845 reset in 287 ms.
Product exploration explored 100000 steps with 1866 reset in 275 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 428 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 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 192 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:21:11] [INFO ] Invariant cache hit.
[2023-03-12 14:21:11] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:21:11] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2023-03-12 14:21:11] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:21:11] [INFO ] Deduced a trap composed of 112 places in 166 ms of which 2 ms to minimize.
[2023-03-12 14:21:12] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 0 ms to minimize.
[2023-03-12 14:21:12] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 1 ms to minimize.
[2023-03-12 14:21:12] [INFO ] Deduced a trap composed of 108 places in 269 ms of which 1 ms to minimize.
[2023-03-12 14:21:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 812 ms
[2023-03-12 14:21:12] [INFO ] After 925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-12 14:21:12] [INFO ] After 1037ms 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 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 56 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 56 ms. Remains : 4/224 places, 4/201 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
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 327 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 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 253 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 3 ms. Remains 224 /224 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-12 14:21:13] [INFO ] Invariant cache hit.
[2023-03-12 14:21:13] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-12 14:21:13] [INFO ] Invariant cache hit.
[2023-03-12 14:21:13] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-12 14:21:13] [INFO ] Invariant cache hit.
[2023-03-12 14:21:14] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 824 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 332 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 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 173 resets, run finished after 112 ms. (steps per millisecond=89 ) 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-12 14:21:14] [INFO ] Invariant cache hit.
[2023-03-12 14:21:15] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:21:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2023-03-12 14:21:15] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:21:15] [INFO ] Deduced a trap composed of 112 places in 227 ms of which 8 ms to minimize.
[2023-03-12 14:21:15] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 1 ms to minimize.
[2023-03-12 14:21:15] [INFO ] Deduced a trap composed of 103 places in 182 ms of which 1 ms to minimize.
[2023-03-12 14:21:16] [INFO ] Deduced a trap composed of 108 places in 340 ms of which 0 ms to minimize.
[2023-03-12 14:21:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 967 ms
[2023-03-12 14:21:16] [INFO ] After 1078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 14:21:16] [INFO ] After 1204ms 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 22 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 22 ms. Remains : 4/224 places, 4/201 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
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 385 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 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1862 reset in 278 ms.
Product exploration explored 100000 steps with 1846 reset in 236 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 165 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 0 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 1 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 64 ms. Remains 174 /224 variables (removed 50) and now considering 151/201 (removed 50) transitions.
[2023-03-12 14:21:18] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 151 rows 174 cols
[2023-03-12 14:21:18] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:21:18] [INFO ] Dead Transitions using invariants and state equation in 171 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 261 ms. Remains : 174/224 places, 151/201 transitions.
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.
// Phase 1: matrix 201 rows 224 cols
[2023-03-12 14:21:18] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:21:18] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-12 14:21:18] [INFO ] Invariant cache hit.
[2023-03-12 14:21:19] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-12 14:21:19] [INFO ] Invariant cache hit.
[2023-03-12 14:21:19] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 963 ms. Remains : 224/224 places, 201/201 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-04 finished in 10458 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 42 ms. Remains 258 /263 variables (removed 5) and now considering 227/232 (removed 5) transitions.
// Phase 1: matrix 227 rows 258 cols
[2023-03-12 14:21:19] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-12 14:21:19] [INFO ] Implicit Places using invariants in 144 ms returned [7, 14, 21, 47, 60, 89, 102]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 145 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 4 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 191 ms. Remains : 251/263 places, 227/232 transitions.
Stuttering acceptance computed with spot in 298 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 516 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 75 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-12 14:21:20] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-12 14:21:20] [INFO ] Implicit Places using invariants in 695 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 697 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 38 ms. Remains 219 /231 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-12 14:21:20] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:21:21] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-12 14:21:21] [INFO ] Invariant cache hit.
[2023-03-12 14:21:21] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 661 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 1471 ms. Remains : 219/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 423 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 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 1910 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 112 ms. Remains 241 /263 variables (removed 22) and now considering 210/232 (removed 22) transitions.
// Phase 1: matrix 210 rows 241 cols
[2023-03-12 14:21:22] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-12 14:21:22] [INFO ] Implicit Places using invariants in 447 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 450 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 3 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 565 ms. Remains : 233/263 places, 210/232 transitions.
Stuttering acceptance computed with spot in 371 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 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-09 finished in 974 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 124 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-12 14:21:23] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-12 14:21:23] [INFO ] Implicit Places using invariants in 344 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 348 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 22 ms. Remains 219 /231 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-12 14:21:23] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:21:24] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-12 14:21:24] [INFO ] Invariant cache hit.
[2023-03-12 14:21:24] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 892 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 1386 ms. Remains : 219/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 390 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 16639 reset in 363 ms.
Product exploration explored 100000 steps with 16604 reset in 376 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 200 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 340 ms :[false, false, false, p0, p0, true]
Finished random walk after 613 steps, including 12 resets, run visited all 1 properties in 4 ms. (steps per millisecond=153 )
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 300 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 378 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 380 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 2 ms. Remains 219 /219 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-12 14:21:27] [INFO ] Invariant cache hit.
[2023-03-12 14:21:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 14:21:27] [INFO ] Invariant cache hit.
[2023-03-12 14:21:27] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-12 14:21:27] [INFO ] Invariant cache hit.
[2023-03-12 14:21:27] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 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 235 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 439 ms :[false, false, false, p0, p0, true]
Finished random walk after 7548 steps, including 151 resets, run visited all 1 properties in 44 ms. (steps per millisecond=171 )
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 347 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 394 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 475 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 467 ms :[false, false, false, p0, p0, true]
Product exploration explored 100000 steps with 16637 reset in 305 ms.
Product exploration explored 100000 steps with 16631 reset in 294 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 380 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 0 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 58 ms. Remains 171 /219 variables (removed 48) and now considering 148/196 (removed 48) transitions.
[2023-03-12 14:21:31] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 148 rows 171 cols
[2023-03-12 14:21:31] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:21:31] [INFO ] Dead Transitions using invariants and state equation in 179 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 250 ms. Remains : 171/219 places, 148/196 transitions.
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 4 ms. Remains 219 /219 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-12 14:21:31] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:21:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-12 14:21:31] [INFO ] Invariant cache hit.
[2023-03-12 14:21:32] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-12 14:21:32] [INFO ] Invariant cache hit.
[2023-03-12 14:21:32] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 219/219 places, 196/196 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-10 finished in 9282 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 58 ms. Remains 243 /263 variables (removed 20) and now considering 212/232 (removed 20) transitions.
// Phase 1: matrix 212 rows 243 cols
[2023-03-12 14:21:32] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-12 14:21:32] [INFO ] Implicit Places using invariants in 168 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 170 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 2 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 231 ms. Remains : 235/263 places, 212/232 transitions.
Stuttering acceptance computed with spot in 186 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 321 ms.
Product exploration explored 100000 steps with 50000 reset in 292 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 541 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 1596 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 0 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 103 ms. Remains 145 /263 variables (removed 118) and now considering 114/232 (removed 118) transitions.
// Phase 1: matrix 114 rows 145 cols
[2023-03-12 14:21:34] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-12 14:21:34] [INFO ] Implicit Places using invariants in 205 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 206 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 5 ms. Remains 99 /125 variables (removed 26) and now considering 88/114 (removed 26) transitions.
// Phase 1: matrix 88 rows 99 cols
[2023-03-12 14:21:34] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-12 14:21:34] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-12 14:21:34] [INFO ] Invariant cache hit.
[2023-03-12 14:21:34] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-12 14:21:34] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 390 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 704 ms. Remains : 99/263 places, 88/232 transitions.
Stuttering acceptance computed with spot in 73 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 183 ms.
Product exploration explored 100000 steps with 50000 reset in 333 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 180 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 1508 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 30 ms. Remains 148 /263 variables (removed 115) and now considering 117/232 (removed 115) transitions.
// Phase 1: matrix 117 rows 148 cols
[2023-03-12 14:21:35] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-12 14:21:35] [INFO ] Implicit Places using invariants in 195 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 196 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 4 ms. Remains 107 /130 variables (removed 23) and now considering 94/117 (removed 23) transitions.
// Phase 1: matrix 94 rows 107 cols
[2023-03-12 14:21:35] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 14:21:35] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 14:21:35] [INFO ] Invariant cache hit.
[2023-03-12 14:21:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-12 14:21:36] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 517 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 748 ms. Remains : 107/263 places, 94/232 transitions.
Stuttering acceptance computed with spot in 144 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 925 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-12 14:21:36] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-12 14:21:37] [INFO ] Implicit Places using invariants in 654 ms returned [7, 21, 40, 60, 89, 102]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 657 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 3 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 666 ms. Remains : 256/263 places, 231/232 transitions.
Stuttering acceptance computed with spot in 303 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 7127 reset in 456 ms.
Product exploration explored 100000 steps with 7173 reset in 346 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 275 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 220 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1097 steps, including 20 resets, run visited all 3 properties in 41 ms. (steps per millisecond=26 )
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 336 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 417 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 234 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 6 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 256 cols
[2023-03-12 14:21:39] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-12 14:21:40] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-12 14:21:40] [INFO ] Invariant cache hit.
[2023-03-12 14:21:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 14:21:41] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2023-03-12 14:21:41] [INFO ] Invariant cache hit.
[2023-03-12 14:21:41] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1904 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 177 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 308 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 810 steps, including 17 resets, run visited all 3 properties in 21 ms. (steps per millisecond=38 )
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 471 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 379 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 398 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 325 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 7116 reset in 308 ms.
Product exploration explored 100000 steps with 7085 reset in 297 ms.
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 231/231 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2023-03-12 14:21:44] [INFO ] Invariant cache hit.
[2023-03-12 14:21:45] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2023-03-12 14:21:45] [INFO ] Invariant cache hit.
[2023-03-12 14:21:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 14:21:46] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
[2023-03-12 14:21:46] [INFO ] Invariant cache hit.
[2023-03-12 14:21:46] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1783 ms. Remains : 256/256 places, 231/231 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 9997 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)))))'
Found a Lengthening insensitive property : AutoFlight-PT-12a-LTLFireability-04
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 254 transition count 140
Reduce places removed 91 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 92 rules applied. Total rules applied 191 place count 163 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 162 transition count 139
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 192 place count 162 transition count 126
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 230 place count 137 transition count 126
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 242 place count 137 transition count 114
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 254 place count 125 transition count 114
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 5 with 50 rules applied. Total rules applied 304 place count 100 transition count 89
Applied a total of 304 rules in 32 ms. Remains 100 /263 variables (removed 163) and now considering 89/232 (removed 143) transitions.
// Phase 1: matrix 89 rows 100 cols
[2023-03-12 14:21:46] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-12 14:21:46] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-12 14:21:46] [INFO ] Invariant cache hit.
[2023-03-12 14:21:47] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-12 14:21:47] [INFO ] Invariant cache hit.
[2023-03-12 14:21:47] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/263 places, 89/232 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 688 ms. Remains : 100/263 places, 89/232 transitions.
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 s49 0), p1:(EQ s31 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3158 reset in 161 ms.
Product exploration explored 100000 steps with 3153 reset in 243 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 350 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 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:21:48] [INFO ] Invariant cache hit.
[2023-03-12 14:21:48] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:21:48] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2023-03-12 14:21:48] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:21:48] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 14:21:48] [INFO ] After 339ms 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 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 89/89 transitions.
Free-agglomeration rule applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 100 transition count 51
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t84.t59.t217 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 44 edges and 38 vertex of which 11 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 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 0 with 23 rules applied. Total rules applied 61 place count 28 transition count 29
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 101 place count 8 transition count 9
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 7 transition count 8
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 7 transition count 8
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 105 place count 6 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 4 transition count 4
Applied a total of 110 rules in 7 ms. Remains 4 /100 variables (removed 96) and now considering 4/89 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 4/100 places, 4/89 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 (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 458 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 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-12 14:21:49] [INFO ] Invariant cache hit.
[2023-03-12 14:21:49] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-12 14:21:49] [INFO ] Invariant cache hit.
[2023-03-12 14:21:49] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-12 14:21:49] [INFO ] Invariant cache hit.
[2023-03-12 14:21:50] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 100/100 places, 89/89 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 331 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 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 310 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:21:50] [INFO ] Invariant cache hit.
[2023-03-12 14:21:50] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:21:50] [INFO ] [Nat]Absence check using 25 positive place invariants in 46 ms returned sat
[2023-03-12 14:21:50] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:21:50] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 14:21:50] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 89/89 transitions.
Free-agglomeration rule applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 100 transition count 51
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t84.t59.t217 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 44 edges and 38 vertex of which 11 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 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 0 with 23 rules applied. Total rules applied 61 place count 28 transition count 29
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 101 place count 8 transition count 9
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 7 transition count 8
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 7 transition count 8
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 105 place count 6 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 4 transition count 4
Applied a total of 110 rules in 8 ms. Remains 4 /100 variables (removed 96) and now considering 4/89 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 4/100 places, 4/89 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 (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 274 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 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3170 reset in 199 ms.
Product exploration explored 100000 steps with 3190 reset in 180 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-12 14:21:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 14:21:52] [INFO ] Invariant cache hit.
[2023-03-12 14:21:52] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 100/100 places, 89/89 transitions.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-12 14:21:52] [INFO ] Invariant cache hit.
[2023-03-12 14:21:53] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-12 14:21:53] [INFO ] Invariant cache hit.
[2023-03-12 14:21:53] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-12 14:21:53] [INFO ] Invariant cache hit.
[2023-03-12 14:21:53] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 100/100 places, 89/89 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-04 finished in 7143 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)))))))'
Found a Lengthening insensitive property : AutoFlight-PT-12a-LTLFireability-10
Stuttering acceptance computed with spot in 370 ms :[false, false, false, p0, p0, true]
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 254 transition count 137
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 196 place count 160 transition count 137
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 196 place count 160 transition count 125
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 232 place count 136 transition count 125
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 244 place count 136 transition count 113
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 256 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 257 place count 123 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 123 transition count 112
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 4 with 50 rules applied. Total rules applied 308 place count 98 transition count 87
Applied a total of 308 rules in 19 ms. Remains 98 /263 variables (removed 165) and now considering 87/232 (removed 145) transitions.
// Phase 1: matrix 87 rows 98 cols
[2023-03-12 14:21:53] [INFO ] Computed 25 place invariants in 19 ms
[2023-03-12 14:21:54] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-12 14:21:54] [INFO ] Invariant cache hit.
[2023-03-12 14:21:54] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-12 14:21:54] [INFO ] Invariant cache hit.
[2023-03-12 14:21:55] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 98/263 places, 87/232 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1756 ms. Remains : 98/263 places, 87/232 transitions.
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 s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4867 steps with 805 reset in 12 ms.
Treatment of property AutoFlight-PT-12a-LTLFireability-10 finished in 2277 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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-12 14:21:55] [INFO ] Flatten gal took : 13 ms
[2023-03-12 14:21:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 14:21:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 263 places, 232 transitions and 680 arcs took 3 ms.
Total runtime 55450 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1801/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1801/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1801/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-12a-LTLFireability-04
Could not compute solution for formula : AutoFlight-PT-12a-LTLFireability-10
Could not compute solution for formula : AutoFlight-PT-12a-LTLFireability-15

BK_STOP 1678630916864

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-12a-LTLFireability-04
ltl formula formula --ltl=/tmp/1801/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 263 places, 232 transitions and 680 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1801/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1801/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1801/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1801/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutoFlight-PT-12a-LTLFireability-10
ltl formula formula --ltl=/tmp/1801/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 263 places, 232 transitions and 680 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1801/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1801/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1801/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1801/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5628a36f73f4]
1: pnml2lts-mc(+0xa2496) [0x5628a36f7496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5d7e3a9140]
3: pnml2lts-mc(+0x405be5) [0x5628a3a5abe5]
4: pnml2lts-mc(+0x16b3f9) [0x5628a37c03f9]
5: pnml2lts-mc(+0x164ac4) [0x5628a37b9ac4]
6: pnml2lts-mc(+0x272e0a) [0x5628a38c7e0a]
7: pnml2lts-mc(+0xb61f0) [0x5628a370b1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f5d7e1fc4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f5d7e1fc67a]
10: pnml2lts-mc(+0xa1581) [0x5628a36f6581]
11: pnml2lts-mc(+0xa1910) [0x5628a36f6910]
12: pnml2lts-mc(+0xa32a2) [0x5628a36f82a2]
13: pnml2lts-mc(+0xa50f4) [0x5628a36fa0f4]
14: pnml2lts-mc(+0xa516b) [0x5628a36fa16b]
15: pnml2lts-mc(+0x3f34b3) [0x5628a3a484b3]
16: pnml2lts-mc(+0x7c63d) [0x5628a36d163d]
17: pnml2lts-mc(+0x67d86) [0x5628a36bcd86]
18: pnml2lts-mc(+0x60a8a) [0x5628a36b5a8a]
19: pnml2lts-mc(+0x5eb15) [0x5628a36b3b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f5d7e1e4d0a]
21: pnml2lts-mc(+0x6075e) [0x5628a36b575e]
ltl formula name AutoFlight-PT-12a-LTLFireability-15
ltl formula formula --ltl=/tmp/1801/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 263 places, 232 transitions and 680 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.030 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1801/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1801/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1801/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1801/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r009-oct2-167813597900468"
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 ;