Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689400476.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689400476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K Apr 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 01:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 01:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 266K May 10 09:33 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-12b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652663114158

Running Version 202205111006
[2022-05-16 01:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:05:16] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-05-16 01:05:16] [INFO ] Transformed 1126 places.
[2022-05-16 01:05:16] [INFO ] Transformed 1124 transitions.
[2022-05-16 01:05:16] [INFO ] Found NUPN structural information;
[2022-05-16 01:05:16] [INFO ] Parsed PT model containing 1126 places and 1124 transitions in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-12b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 153 places :
Symmetric choice reduction at 0 with 153 rule applications. Total rules 153 place count 973 transition count 971
Iterating global reduction 0 with 153 rules applied. Total rules applied 306 place count 973 transition count 971
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 330 place count 973 transition count 947
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 395 place count 908 transition count 882
Iterating global reduction 1 with 65 rules applied. Total rules applied 460 place count 908 transition count 882
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 472 place count 896 transition count 870
Iterating global reduction 1 with 12 rules applied. Total rules applied 484 place count 896 transition count 870
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 494 place count 886 transition count 860
Iterating global reduction 1 with 10 rules applied. Total rules applied 504 place count 886 transition count 860
Applied a total of 504 rules in 334 ms. Remains 886 /1126 variables (removed 240) and now considering 860/1124 (removed 264) transitions.
// Phase 1: matrix 860 rows 886 cols
[2022-05-16 01:05:17] [INFO ] Computed 76 place invariants in 48 ms
[2022-05-16 01:05:17] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 860 rows 886 cols
[2022-05-16 01:05:17] [INFO ] Computed 76 place invariants in 9 ms
[2022-05-16 01:05:18] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
// Phase 1: matrix 860 rows 886 cols
[2022-05-16 01:05:18] [INFO ] Computed 76 place invariants in 15 ms
[2022-05-16 01:05:18] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 886/1126 places, 860/1124 transitions.
Finished structural reductions, in 1 iterations. Remains : 886/1126 places, 860/1124 transitions.
Support contains 37 out of 886 places after structural reductions.
[2022-05-16 01:05:18] [INFO ] Flatten gal took : 82 ms
[2022-05-16 01:05:19] [INFO ] Flatten gal took : 41 ms
[2022-05-16 01:05:19] [INFO ] Input system was already deterministic with 860 transitions.
Support contains 35 out of 886 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 860 rows 886 cols
[2022-05-16 01:05:19] [INFO ] Computed 76 place invariants in 5 ms
[2022-05-16 01:05:20] [INFO ] [Real]Absence check using 75 positive place invariants in 30 ms returned sat
[2022-05-16 01:05:20] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 01:05:20] [INFO ] After 568ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2022-05-16 01:05:21] [INFO ] Deduced a trap composed of 54 places in 250 ms of which 6 ms to minimize.
[2022-05-16 01:05:21] [INFO ] Deduced a trap composed of 136 places in 267 ms of which 2 ms to minimize.
[2022-05-16 01:05:21] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 1 ms to minimize.
[2022-05-16 01:05:22] [INFO ] Deduced a trap composed of 146 places in 239 ms of which 2 ms to minimize.
[2022-05-16 01:05:22] [INFO ] Deduced a trap composed of 144 places in 197 ms of which 1 ms to minimize.
[2022-05-16 01:05:22] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 1 ms to minimize.
[2022-05-16 01:05:22] [INFO ] Deduced a trap composed of 131 places in 296 ms of which 0 ms to minimize.
[2022-05-16 01:05:23] [INFO ] Deduced a trap composed of 139 places in 362 ms of which 2 ms to minimize.
[2022-05-16 01:05:23] [INFO ] Deduced a trap composed of 134 places in 305 ms of which 1 ms to minimize.
[2022-05-16 01:05:24] [INFO ] Deduced a trap composed of 151 places in 278 ms of which 1 ms to minimize.
[2022-05-16 01:05:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3160 ms
[2022-05-16 01:05:24] [INFO ] Deduced a trap composed of 62 places in 268 ms of which 0 ms to minimize.
[2022-05-16 01:05:24] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 1 ms to minimize.
[2022-05-16 01:05:25] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 1 ms to minimize.
[2022-05-16 01:05:25] [INFO ] Deduced a trap composed of 112 places in 293 ms of which 1 ms to minimize.
[2022-05-16 01:05:25] [INFO ] Deduced a trap composed of 93 places in 208 ms of which 1 ms to minimize.
[2022-05-16 01:05:25] [INFO ] Deduced a trap composed of 85 places in 206 ms of which 0 ms to minimize.
[2022-05-16 01:05:26] [INFO ] Deduced a trap composed of 120 places in 267 ms of which 0 ms to minimize.
[2022-05-16 01:05:26] [INFO ] Deduced a trap composed of 120 places in 186 ms of which 0 ms to minimize.
[2022-05-16 01:05:26] [INFO ] Deduced a trap composed of 112 places in 197 ms of which 1 ms to minimize.
[2022-05-16 01:05:26] [INFO ] Deduced a trap composed of 112 places in 182 ms of which 1 ms to minimize.
[2022-05-16 01:05:27] [INFO ] Deduced a trap composed of 114 places in 211 ms of which 1 ms to minimize.
[2022-05-16 01:05:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3015 ms
[2022-05-16 01:05:27] [INFO ] After 7048ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 01:05:27] [INFO ] After 7462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 01:05:27] [INFO ] [Nat]Absence check using 75 positive place invariants in 42 ms returned sat
[2022-05-16 01:05:27] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:05:28] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-16 01:05:28] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 0 ms to minimize.
[2022-05-16 01:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2022-05-16 01:05:29] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 1 ms to minimize.
[2022-05-16 01:05:29] [INFO ] Deduced a trap composed of 121 places in 247 ms of which 1 ms to minimize.
[2022-05-16 01:05:29] [INFO ] Deduced a trap composed of 82 places in 246 ms of which 1 ms to minimize.
[2022-05-16 01:05:29] [INFO ] Deduced a trap composed of 143 places in 210 ms of which 1 ms to minimize.
[2022-05-16 01:05:30] [INFO ] Deduced a trap composed of 93 places in 215 ms of which 1 ms to minimize.
[2022-05-16 01:05:30] [INFO ] Deduced a trap composed of 96 places in 194 ms of which 0 ms to minimize.
[2022-05-16 01:05:30] [INFO ] Deduced a trap composed of 142 places in 217 ms of which 1 ms to minimize.
[2022-05-16 01:05:30] [INFO ] Deduced a trap composed of 80 places in 222 ms of which 0 ms to minimize.
[2022-05-16 01:05:31] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 1 ms to minimize.
[2022-05-16 01:05:31] [INFO ] Deduced a trap composed of 153 places in 206 ms of which 0 ms to minimize.
[2022-05-16 01:05:31] [INFO ] Deduced a trap composed of 135 places in 198 ms of which 1 ms to minimize.
[2022-05-16 01:05:31] [INFO ] Deduced a trap composed of 149 places in 172 ms of which 1 ms to minimize.
[2022-05-16 01:05:32] [INFO ] Deduced a trap composed of 142 places in 212 ms of which 2 ms to minimize.
[2022-05-16 01:05:32] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 0 ms to minimize.
[2022-05-16 01:05:32] [INFO ] Deduced a trap composed of 92 places in 212 ms of which 1 ms to minimize.
[2022-05-16 01:05:32] [INFO ] Deduced a trap composed of 149 places in 149 ms of which 1 ms to minimize.
[2022-05-16 01:05:32] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 1 ms to minimize.
[2022-05-16 01:05:33] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 1 ms to minimize.
[2022-05-16 01:05:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4336 ms
[2022-05-16 01:05:33] [INFO ] Deduced a trap composed of 151 places in 233 ms of which 1 ms to minimize.
[2022-05-16 01:05:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2022-05-16 01:05:33] [INFO ] Deduced a trap composed of 114 places in 192 ms of which 1 ms to minimize.
[2022-05-16 01:05:33] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 1 ms to minimize.
[2022-05-16 01:05:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
[2022-05-16 01:05:34] [INFO ] After 6219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 605 ms.
[2022-05-16 01:05:34] [INFO ] After 7242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 5 properties in 255 ms.
Support contains 2 out of 886 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 886/886 places, 860/860 transitions.
Drop transitions removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 886 transition count 543
Reduce places removed 317 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 353 rules applied. Total rules applied 670 place count 569 transition count 507
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 694 place count 545 transition count 507
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 694 place count 545 transition count 402
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 904 place count 440 transition count 402
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 909 place count 435 transition count 397
Iterating global reduction 3 with 5 rules applied. Total rules applied 914 place count 435 transition count 397
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 914 place count 435 transition count 396
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 916 place count 434 transition count 396
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 1258 place count 263 transition count 201
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 48 times.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1306 place count 263 transition count 153
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1354 place count 215 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1355 place count 214 transition count 152
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 4 with 149 rules applied. Total rules applied 1504 place count 158 transition count 59
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 5 with 93 rules applied. Total rules applied 1597 place count 65 transition count 59
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 1597 place count 65 transition count 40
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 1635 place count 46 transition count 40
Applied a total of 1635 rules in 215 ms. Remains 46 /886 variables (removed 840) and now considering 40/860 (removed 820) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/886 places, 40/860 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Computed a total of 219 stabilizing places and 219 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X(G(X(G(p1))))))'
Support contains 2 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 876 transition count 850
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 873 transition count 847
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 873 transition count 847
Applied a total of 26 rules in 132 ms. Remains 873 /886 variables (removed 13) and now considering 847/860 (removed 13) transitions.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:35] [INFO ] Computed 76 place invariants in 11 ms
[2022-05-16 01:05:36] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:36] [INFO ] Computed 76 place invariants in 5 ms
[2022-05-16 01:05:36] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:37] [INFO ] Computed 76 place invariants in 12 ms
[2022-05-16 01:05:37] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/886 places, 847/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 873/886 places, 847/860 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s299 1) (EQ s122 1)), p0:(NEQ s299 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 296 steps with 0 reset in 10 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-00 finished in 2068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U G((X((p1 U p2))||!p0)))))'
Support contains 4 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 876 transition count 850
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 873 transition count 847
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 873 transition count 847
Applied a total of 26 rules in 111 ms. Remains 873 /886 variables (removed 13) and now considering 847/860 (removed 13) transitions.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:37] [INFO ] Computed 76 place invariants in 7 ms
[2022-05-16 01:05:38] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:38] [INFO ] Computed 76 place invariants in 4 ms
[2022-05-16 01:05:38] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:38] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:05:39] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/886 places, 847/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 873/886 places, 847/860 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s394 1), p2:(AND (EQ s313 1) (EQ s626 1)), p1:(EQ s386 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 182 reset in 385 ms.
Product exploration explored 100000 steps with 182 reset in 318 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 347 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:40] [INFO ] Computed 76 place invariants in 8 ms
[2022-05-16 01:05:40] [INFO ] [Real]Absence check using 75 positive place invariants in 34 ms returned sat
[2022-05-16 01:05:40] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-16 01:05:41] [INFO ] After 424ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 01:05:41] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 1 ms to minimize.
[2022-05-16 01:05:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2022-05-16 01:05:41] [INFO ] After 737ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:05:41] [INFO ] After 955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:05:41] [INFO ] [Nat]Absence check using 75 positive place invariants in 27 ms returned sat
[2022-05-16 01:05:41] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:05:42] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 01:05:42] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2022-05-16 01:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-16 01:05:42] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-16 01:05:42] [INFO ] After 781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 194 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=48 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F p0), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 303 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 51 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 20 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:42] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:05:43] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:43] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:05:43] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:43] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:05:44] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 873/873 places, 847/847 transitions.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:05:44] [INFO ] Computed 76 place invariants in 6 ms
[2022-05-16 01:05:44] [INFO ] [Real]Absence check using 75 positive place invariants in 32 ms returned sat
[2022-05-16 01:05:44] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 01:05:45] [INFO ] After 396ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 01:05:45] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 1 ms to minimize.
[2022-05-16 01:05:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2022-05-16 01:05:45] [INFO ] After 716ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:05:45] [INFO ] After 949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:05:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 25 ms returned sat
[2022-05-16 01:05:45] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 01:05:46] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 01:05:46] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2022-05-16 01:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2022-05-16 01:05:46] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-16 01:05:46] [INFO ] After 839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 217 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=54 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 301 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 248 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 182 reset in 305 ms.
Product exploration explored 100000 steps with 182 reset in 355 ms.
Built C files in :
/tmp/ltsmin1700965489081735558
[2022-05-16 01:05:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1700965489081735558
Running compilation step : cd /tmp/ltsmin1700965489081735558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1528 ms.
Running link step : cd /tmp/ltsmin1700965489081735558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin1700965489081735558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1678774999396658523.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 37 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:06:03] [INFO ] Computed 76 place invariants in 6 ms
[2022-05-16 01:06:03] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:06:03] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:06:04] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:06:04] [INFO ] Computed 76 place invariants in 6 ms
[2022-05-16 01:06:04] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 873/873 places, 847/847 transitions.
Built C files in :
/tmp/ltsmin803068401075985340
[2022-05-16 01:06:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin803068401075985340
Running compilation step : cd /tmp/ltsmin803068401075985340;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1471 ms.
Running link step : cd /tmp/ltsmin803068401075985340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin803068401075985340;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17982787469322909917.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:06:19] [INFO ] Flatten gal took : 32 ms
[2022-05-16 01:06:19] [INFO ] Flatten gal took : 26 ms
[2022-05-16 01:06:19] [INFO ] Time to serialize gal into /tmp/LTL13661527239914161475.gal : 5 ms
[2022-05-16 01:06:19] [INFO ] Time to serialize properties into /tmp/LTL5095117030507821738.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13661527239914161475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5095117030507821738.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1366152...267
Read 1 LTL properties
Checking formula 0 : !((F(("(p602==1)")U(G((X(("(p594==1)")U("((p486==1)&&(p866==1))")))||("(p602!=1)"))))))
Formula 0 simplified : !F("(p602==1)" U G("(p602!=1)" | X("(p594==1)" U "((p486==1)&&(p866==1))")))
Detected timeout of ITS tools.
[2022-05-16 01:06:34] [INFO ] Flatten gal took : 28 ms
[2022-05-16 01:06:34] [INFO ] Applying decomposition
[2022-05-16 01:06:34] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6912710759920416209.txt' '-o' '/tmp/graph6912710759920416209.bin' '-w' '/tmp/graph6912710759920416209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6912710759920416209.bin' '-l' '-1' '-v' '-w' '/tmp/graph6912710759920416209.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:06:35] [INFO ] Decomposing Gal with order
[2022-05-16 01:06:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:06:35] [INFO ] Removed a total of 166 redundant transitions.
[2022-05-16 01:06:35] [INFO ] Flatten gal took : 143 ms
[2022-05-16 01:06:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-16 01:06:35] [INFO ] Time to serialize gal into /tmp/LTL15165800692823157717.gal : 15 ms
[2022-05-16 01:06:35] [INFO ] Time to serialize properties into /tmp/LTL18179119152031619865.ltl : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15165800692823157717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18179119152031619865.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1516580...247
Read 1 LTL properties
Checking formula 0 : !((F(("(i1.u166.p602==1)")U(G((X(("(i15.u164.p594==1)")U("((i14.u135.p486==1)&&(i14.u264.p866==1))")))||("(i1.u166.p602!=1)"))))))
Formula 0 simplified : !F("(i1.u166.p602==1)" U G("(i1.u166.p602!=1)" | X("(i15.u164.p594==1)" U "((i14.u135.p486==1)&&(i14.u264.p866==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14735591999334264328
[2022-05-16 01:06:50] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14735591999334264328
Running compilation step : cd /tmp/ltsmin14735591999334264328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1451 ms.
Running link step : cd /tmp/ltsmin14735591999334264328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin14735591999334264328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true) U []((X(((LTLAPp1==true) U (LTLAPp2==true)))||!(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-12b-LTLFireability-01 finished in 87985 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 886 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 885 transition count 543
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 352 rules applied. Total rules applied 668 place count 569 transition count 507
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 692 place count 545 transition count 507
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 692 place count 545 transition count 402
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 902 place count 440 transition count 402
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 909 place count 433 transition count 395
Iterating global reduction 3 with 7 rules applied. Total rules applied 916 place count 433 transition count 395
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 916 place count 433 transition count 394
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 918 place count 432 transition count 394
Performed 169 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 1256 place count 263 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1257 place count 262 transition count 200
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 32 rules applied. Total rules applied 1289 place count 240 transition count 190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1299 place count 230 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1299 place count 230 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1323 place count 218 transition count 178
Applied a total of 1323 rules in 96 ms. Remains 218 /886 variables (removed 668) and now considering 178/860 (removed 682) transitions.
// Phase 1: matrix 178 rows 218 cols
[2022-05-16 01:07:05] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-16 01:07:06] [INFO ] Implicit Places using invariants in 159 ms returned [182, 187, 191, 195, 199, 203, 207, 211, 217]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 161 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/886 places, 178/860 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 202 transition count 171
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 202 transition count 171
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 195 transition count 164
Applied a total of 28 rules in 10 ms. Remains 195 /209 variables (removed 14) and now considering 164/178 (removed 14) transitions.
// Phase 1: matrix 164 rows 195 cols
[2022-05-16 01:07:06] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-16 01:07:06] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 164 rows 195 cols
[2022-05-16 01:07:06] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-16 01:07:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:07:06] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 195/886 places, 164/860 transitions.
Finished structural reductions, in 2 iterations. Remains : 195/886 places, 164/860 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2433 reset in 338 ms.
Product exploration explored 100000 steps with 2433 reset in 445 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/195 stabilizing places and 4/164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 164/164 transitions.
Applied a total of 0 rules in 11 ms. Remains 195 /195 variables (removed 0) and now considering 164/164 (removed 0) transitions.
// Phase 1: matrix 164 rows 195 cols
[2022-05-16 01:07:07] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-16 01:07:07] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 164 rows 195 cols
[2022-05-16 01:07:07] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-16 01:07:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:07:08] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-05-16 01:07:08] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 164 rows 195 cols
[2022-05-16 01:07:08] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-16 01:07:08] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 164/164 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/195 stabilizing places and 4/164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2436 reset in 302 ms.
Stack based approach found an accepted trace after 8068 steps with 195 reset with depth 37 and stack size 37 in 29 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-04 finished in 3159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(F(p1))))))'
Support contains 2 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 877 transition count 851
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 877 transition count 851
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 875 transition count 849
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 875 transition count 849
Applied a total of 22 rules in 93 ms. Remains 875 /886 variables (removed 11) and now considering 849/860 (removed 11) transitions.
// Phase 1: matrix 849 rows 875 cols
[2022-05-16 01:07:09] [INFO ] Computed 76 place invariants in 5 ms
[2022-05-16 01:07:09] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 849 rows 875 cols
[2022-05-16 01:07:09] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:09] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
// Phase 1: matrix 849 rows 875 cols
[2022-05-16 01:07:09] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:10] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 875/886 places, 849/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 875/886 places, 849/860 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s93 1), p1:(NEQ s228 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 607 ms.
Product exploration explored 100000 steps with 33333 reset in 599 ms.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Detected a total of 212/875 stabilizing places and 212/849 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-12b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLFireability-05 finished in 2975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(X(X(p0)))))))'
Support contains 1 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 875 transition count 849
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 875 transition count 849
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 872 transition count 846
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 872 transition count 846
Applied a total of 28 rules in 77 ms. Remains 872 /886 variables (removed 14) and now considering 846/860 (removed 14) transitions.
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:12] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:12] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:12] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:12] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:12] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:13] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/886 places, 846/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 872/886 places, 846/860 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s839 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 536 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-06 finished in 1627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 2 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 876 transition count 850
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 874 transition count 848
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 874 transition count 848
Applied a total of 24 rules in 87 ms. Remains 874 /886 variables (removed 12) and now considering 848/860 (removed 12) transitions.
// Phase 1: matrix 848 rows 874 cols
[2022-05-16 01:07:13] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:13] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 848 rows 874 cols
[2022-05-16 01:07:13] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:14] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
// Phase 1: matrix 848 rows 874 cols
[2022-05-16 01:07:14] [INFO ] Computed 76 place invariants in 5 ms
[2022-05-16 01:07:14] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 874/886 places, 848/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 874/886 places, 848/860 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-07 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=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s379 1), p1:(EQ s837 1)], nbAcceptance=0, 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 3353 reset in 302 ms.
Product exploration explored 100000 steps with 3353 reset in 285 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/874 stabilizing places and 210/848 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
// Phase 1: matrix 848 rows 874 cols
[2022-05-16 01:07:16] [INFO ] Computed 76 place invariants in 8 ms
[2022-05-16 01:07:16] [INFO ] [Real]Absence check using 75 positive place invariants in 48 ms returned sat
[2022-05-16 01:07:16] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 01:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:17] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2022-05-16 01:07:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:07:17] [INFO ] [Nat]Absence check using 75 positive place invariants in 27 ms returned sat
[2022-05-16 01:07:17] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:18] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2022-05-16 01:07:19] [INFO ] Computed and/alt/rep : 845/1177/845 causal constraints (skipped 2 transitions) in 49 ms.
[2022-05-16 01:07:32] [INFO ] Added : 832 causal constraints over 167 iterations in 13321 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 874 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 873 transition count 536
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 344 rules applied. Total rules applied 655 place count 562 transition count 503
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 678 place count 540 transition count 502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 679 place count 539 transition count 502
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 679 place count 539 transition count 398
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 887 place count 435 transition count 398
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1229 place count 264 transition count 203
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1231 place count 263 transition count 203
Applied a total of 1231 rules in 51 ms. Remains 263 /874 variables (removed 611) and now considering 203/848 (removed 645) transitions.
// Phase 1: matrix 203 rows 263 cols
[2022-05-16 01:07:32] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:07:32] [INFO ] Implicit Places using invariants in 235 ms returned [85, 86, 87, 88, 89, 90, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 149, 187, 193, 199, 205, 211, 217, 223, 229, 235, 249, 255, 262]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 238 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 226/874 places, 203/848 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 226 transition count 180
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 203 transition count 180
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 58 place count 191 transition count 168
Iterating global reduction 2 with 12 rules applied. Total rules applied 70 place count 191 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 190 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 190 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 189 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 189 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 188 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 188 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 187 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 187 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 186 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 186 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 185 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 185 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 184 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 184 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 183 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 183 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 182 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 182 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 181 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 181 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 180 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 180 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 179 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 179 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 177 transition count 154
Applied a total of 98 rules in 46 ms. Remains 177 /226 variables (removed 49) and now considering 154/203 (removed 49) transitions.
// Phase 1: matrix 154 rows 177 cols
[2022-05-16 01:07:32] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 01:07:32] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 154 rows 177 cols
[2022-05-16 01:07:32] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 01:07:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-16 01:07:32] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/874 places, 154/848 transitions.
Finished structural reductions, in 2 iterations. Remains : 177/874 places, 154/848 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/177 stabilizing places and 4/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
// Phase 1: matrix 154 rows 177 cols
[2022-05-16 01:07:33] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 01:07:33] [INFO ] [Real]Absence check using 39 positive place invariants in 6 ms returned sat
[2022-05-16 01:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:33] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-16 01:07:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:07:33] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2022-05-16 01:07:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:33] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-16 01:07:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-16 01:07:33] [INFO ] [Nat]Added 37 Read/Feed constraints in 6 ms returned sat
[2022-05-16 01:07:33] [INFO ] Computed and/alt/rep : 138/434/138 causal constraints (skipped 14 transitions) in 11 ms.
[2022-05-16 01:07:34] [INFO ] Added : 111 causal constraints over 23 iterations in 349 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 65 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4030 reset in 374 ms.
Stack based approach found an accepted trace after 82095 steps with 3307 reset with depth 20 and stack size 20 in 241 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-07 finished in 21181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (p1||G(p0))))))))'
Support contains 2 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 875 transition count 849
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 875 transition count 849
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 872 transition count 846
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 872 transition count 846
Applied a total of 28 rules in 151 ms. Remains 872 /886 variables (removed 14) and now considering 846/860 (removed 14) transitions.
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:34] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:35] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:35] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:35] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:35] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:36] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/886 places, 846/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 872/886 places, 846/860 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s206 1), p1:(EQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 572 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-08 finished in 1527 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 875 transition count 849
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 875 transition count 849
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 872 transition count 846
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 872 transition count 846
Applied a total of 28 rules in 62 ms. Remains 872 /886 variables (removed 14) and now considering 846/860 (removed 14) transitions.
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:36] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:36] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:36] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:37] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:07:37] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:37] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/886 places, 846/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 872/886 places, 846/860 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s462 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-09 finished in 1328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X(p1)&&(!(p1 U p2)||G(p3))))'
Support contains 4 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 878 transition count 852
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 878 transition count 852
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 875 transition count 849
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 875 transition count 849
Applied a total of 22 rules in 62 ms. Remains 875 /886 variables (removed 11) and now considering 849/860 (removed 11) transitions.
// Phase 1: matrix 849 rows 875 cols
[2022-05-16 01:07:37] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:37] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 849 rows 875 cols
[2022-05-16 01:07:37] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:38] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
// Phase 1: matrix 849 rows 875 cols
[2022-05-16 01:07:38] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:07:38] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 875/886 places, 849/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 875/886 places, 849/860 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), true, p2, (NOT p3), (AND p2 (NOT p3)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=0 dest: 4}, { cond=(OR (NOT p2) p3), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p3), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}]], initial=0, aps=[p2:(EQ s167 1), p3:(EQ s736 0), p1:(EQ s92 1), p0:(EQ s300 0)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-10 finished in 1286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)||X(p2)||G(F(p3))))'
Support contains 5 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 876 transition count 850
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 873 transition count 847
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 873 transition count 847
Applied a total of 26 rules in 52 ms. Remains 873 /886 variables (removed 13) and now considering 847/860 (removed 13) transitions.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:07:38] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:39] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:07:39] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:39] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:07:39] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:07:40] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/886 places, 847/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 873/886 places, 847/860 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s82 1), p1:(EQ s426 1), p3:(OR (EQ s473 0) (EQ s844 0)), p2:(EQ s15 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]]
Product exploration explored 100000 steps with 223 reset in 229 ms.
Product exploration explored 100000 steps with 218 reset in 270 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Detected a total of 211/873 stabilizing places and 211/847 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 479 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p3), (NOT p3)]
Finished random walk after 1689 steps, including 3 resets, run visited all 1 properties in 6 ms. (steps per millisecond=281 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 11 factoid took 321 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p3), (NOT p3)]
Support contains 2 out of 873 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 872 transition count 535
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 347 rules applied. Total rules applied 658 place count 561 transition count 499
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 682 place count 537 transition count 499
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 682 place count 537 transition count 396
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 888 place count 434 transition count 396
Performed 168 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 1224 place count 266 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1225 place count 265 transition count 203
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 1238 place count 256 transition count 199
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1242 place count 252 transition count 199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 1242 place count 252 transition count 195
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1250 place count 248 transition count 195
Applied a total of 1250 rules in 36 ms. Remains 248 /873 variables (removed 625) and now considering 195/847 (removed 652) transitions.
// Phase 1: matrix 195 rows 248 cols
[2022-05-16 01:07:41] [INFO ] Computed 67 place invariants in 1 ms
[2022-05-16 01:07:41] [INFO ] Implicit Places using invariants in 110 ms returned [106, 144, 182, 188, 194, 200, 206, 212, 218, 224, 228, 232, 236, 242, 247]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 125 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/873 places, 195/847 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 220 transition count 182
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 220 transition count 182
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 0 with 2 rules applied. Total rules applied 28 place count 219 transition count 181
Applied a total of 28 rules in 12 ms. Remains 219 /233 variables (removed 14) and now considering 181/195 (removed 14) transitions.
// Phase 1: matrix 181 rows 219 cols
[2022-05-16 01:07:41] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-16 01:07:42] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 181 rows 219 cols
[2022-05-16 01:07:42] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-16 01:07:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-05-16 01:07:42] [INFO ] Implicit Places using invariants and state equation in 331 ms returned [88, 90, 92, 94, 96, 98]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 444 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 213/873 places, 181/847 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 213 transition count 175
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 207 transition count 175
Applied a total of 12 rules in 4 ms. Remains 207 /213 variables (removed 6) and now considering 175/181 (removed 6) transitions.
// Phase 1: matrix 175 rows 207 cols
[2022-05-16 01:07:42] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-16 01:07:42] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 175 rows 207 cols
[2022-05-16 01:07:42] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-16 01:07:42] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-16 01:07:42] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 207/873 places, 175/847 transitions.
Finished structural reductions, in 3 iterations. Remains : 207/873 places, 175/847 transitions.
Computed a total of 10 stabilizing places and 3 stable transitions
Computed a total of 10 stabilizing places and 3 stable transitions
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p3), (NOT p3)]
Finished random walk after 923 steps, including 19 resets, run visited all 1 properties in 5 ms. (steps per millisecond=184 )
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 2112 reset in 228 ms.
Product exploration explored 100000 steps with 2119 reset in 230 ms.
Built C files in :
/tmp/ltsmin511632855909372632
[2022-05-16 01:07:43] [INFO ] Computing symmetric may disable matrix : 175 transitions.
[2022-05-16 01:07:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:07:43] [INFO ] Computing symmetric may enable matrix : 175 transitions.
[2022-05-16 01:07:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:07:43] [INFO ] Computing Do-Not-Accords matrix : 175 transitions.
[2022-05-16 01:07:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:07:43] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin511632855909372632
Running compilation step : cd /tmp/ltsmin511632855909372632;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 311 ms.
Running link step : cd /tmp/ltsmin511632855909372632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin511632855909372632;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15218455287370391386.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 175/175 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 206 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 205 transition count 173
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 201 transition count 170
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 201 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 200 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 199 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 199 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 198 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 198 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 197 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 197 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 196 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 196 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 195 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 195 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 194 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 194 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 193 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 193 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 192 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 192 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 191 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 191 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 190 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 190 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 189 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 189 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 188 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 188 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 187 transition count 156
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 14 rules applied. Total rules applied 50 place count 180 transition count 149
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 57 place count 173 transition count 149
Applied a total of 57 rules in 88 ms. Remains 173 /207 variables (removed 34) and now considering 149/175 (removed 26) transitions.
// Phase 1: matrix 149 rows 173 cols
[2022-05-16 01:07:58] [INFO ] Computed 38 place invariants in 0 ms
[2022-05-16 01:07:58] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 149 rows 173 cols
[2022-05-16 01:07:58] [INFO ] Computed 38 place invariants in 0 ms
[2022-05-16 01:07:59] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2022-05-16 01:07:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 149 rows 173 cols
[2022-05-16 01:07:59] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 01:07:59] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/207 places, 149/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 173/207 places, 149/175 transitions.
Built C files in :
/tmp/ltsmin3957276844019806774
[2022-05-16 01:07:59] [INFO ] Computing symmetric may disable matrix : 149 transitions.
[2022-05-16 01:07:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:07:59] [INFO ] Computing symmetric may enable matrix : 149 transitions.
[2022-05-16 01:07:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:07:59] [INFO ] Computing Do-Not-Accords matrix : 149 transitions.
[2022-05-16 01:07:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:07:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3957276844019806774
Running compilation step : cd /tmp/ltsmin3957276844019806774;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin3957276844019806774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3957276844019806774;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14658030436699258617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:08:14] [INFO ] Flatten gal took : 14 ms
[2022-05-16 01:08:14] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:08:14] [INFO ] Time to serialize gal into /tmp/LTL3927297653229000907.gal : 2 ms
[2022-05-16 01:08:14] [INFO ] Time to serialize properties into /tmp/LTL8414920073823837677.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3927297653229000907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8414920073823837677.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3927297...266
Read 1 LTL properties
Checking formula 0 : !((((G("(p91==1)"))||(X("(p645==1)")))||((X("(p15==1)"))||(G(F("((p705==0)||(p1095==0))"))))))
Formula 0 simplified : !(G"(p91==1)" | X"(p645==1)" | X"(p15==1)" | GF"((p705==0)||(p1095==0))")
Reverse transition relation is NOT exact ! Due to transitions t315, t318, t47.t317, t658.t659, t328.t331.t341.t344.t354.t357.t369.t372.t384.t387.t397.t400....670
Computing Next relation with stutter on 245760 deadlock states
Detected timeout of ITS tools.
[2022-05-16 01:08:29] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:08:29] [INFO ] Applying decomposition
[2022-05-16 01:08:29] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph305581000186184686.txt' '-o' '/tmp/graph305581000186184686.bin' '-w' '/tmp/graph305581000186184686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph305581000186184686.bin' '-l' '-1' '-v' '-w' '/tmp/graph305581000186184686.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:08:29] [INFO ] Decomposing Gal with order
[2022-05-16 01:08:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:08:29] [INFO ] Removed a total of 20 redundant transitions.
[2022-05-16 01:08:29] [INFO ] Flatten gal took : 13 ms
[2022-05-16 01:08:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-16 01:08:29] [INFO ] Time to serialize gal into /tmp/LTL12584282183193039896.gal : 4 ms
[2022-05-16 01:08:29] [INFO ] Time to serialize properties into /tmp/LTL433896480245100992.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12584282183193039896.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL433896480245100992.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1258428...245
Read 1 LTL properties
Checking formula 0 : !((((G("(i8.u3.p91==1)"))||(X("(i10.u42.p645==1)")))||((X("(i10.u0.p15==1)"))||(G(F("((i11.i2.u43.p705==0)||(i12.u77.p1095==0))"))))))
Formula 0 simplified : !(G"(i8.u3.p91==1)" | X"(i10.u42.p645==1)" | X"(i10.u0.p15==1)" | GF"((i11.i2.u43.p705==0)||(i12.u77.p1095==0))")
Reverse transition relation is NOT exact ! Due to transitions t328_t331_t341_t344_t354_t357_t369_t372_t384_t387_t397_t400_t410_t418_t425_t432_t440_t447_t45...692
Computing Next relation with stutter on 245760 deadlock states
16 unique states visited
0 strongly connected components in search stack
20 transitions explored
11 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.19534,27420,1,0,20028,2088,2932,25125,511,5771,38006
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-12b-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-12b-LTLFireability-11 finished in 50778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 886 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 885 transition count 545
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 664 place count 571 transition count 509
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 689 place count 547 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 546 transition count 508
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 690 place count 546 transition count 403
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 900 place count 441 transition count 403
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 907 place count 434 transition count 396
Iterating global reduction 4 with 7 rules applied. Total rules applied 914 place count 434 transition count 396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 914 place count 434 transition count 395
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 916 place count 433 transition count 395
Performed 169 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1254 place count 264 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1255 place count 263 transition count 201
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1287 place count 241 transition count 191
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1297 place count 231 transition count 191
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1297 place count 231 transition count 179
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1321 place count 219 transition count 179
Applied a total of 1321 rules in 55 ms. Remains 219 /886 variables (removed 667) and now considering 179/860 (removed 681) transitions.
// Phase 1: matrix 179 rows 219 cols
[2022-05-16 01:08:29] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-16 01:08:29] [INFO ] Implicit Places using invariants in 127 ms returned [192, 196, 200, 204, 208, 212, 218]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 128 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/886 places, 179/860 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 174
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 174
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 28 place count 198 transition count 165
Applied a total of 28 rules in 9 ms. Remains 198 /212 variables (removed 14) and now considering 165/179 (removed 14) transitions.
// Phase 1: matrix 165 rows 198 cols
[2022-05-16 01:08:29] [INFO ] Computed 47 place invariants in 0 ms
[2022-05-16 01:08:29] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 165 rows 198 cols
[2022-05-16 01:08:29] [INFO ] Computed 47 place invariants in 1 ms
[2022-05-16 01:08:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:08:30] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/886 places, 165/860 transitions.
Finished structural reductions, in 2 iterations. Remains : 198/886 places, 165/860 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s16 1) (NEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2379 reset in 321 ms.
Product exploration explored 100000 steps with 2381 reset in 336 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 165/165 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 165/165 (removed 0) transitions.
// Phase 1: matrix 165 rows 198 cols
[2022-05-16 01:08:31] [INFO ] Computed 47 place invariants in 1 ms
[2022-05-16 01:08:31] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 165 rows 198 cols
[2022-05-16 01:08:31] [INFO ] Computed 47 place invariants in 1 ms
[2022-05-16 01:08:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:08:31] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2022-05-16 01:08:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 165 rows 198 cols
[2022-05-16 01:08:31] [INFO ] Computed 47 place invariants in 1 ms
[2022-05-16 01:08:31] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 165/165 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2383 reset in 354 ms.
Stack based approach found an accepted trace after 12097 steps with 287 reset with depth 32 and stack size 32 in 40 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-12 finished in 2841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&p1))&&F((p2 U p3))))'
Support contains 5 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 876 transition count 850
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 874 transition count 848
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 874 transition count 848
Applied a total of 24 rules in 81 ms. Remains 874 /886 variables (removed 12) and now considering 848/860 (removed 12) transitions.
// Phase 1: matrix 848 rows 874 cols
[2022-05-16 01:08:32] [INFO ] Computed 76 place invariants in 4 ms
[2022-05-16 01:08:32] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 848 rows 874 cols
[2022-05-16 01:08:32] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:08:33] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
// Phase 1: matrix 848 rows 874 cols
[2022-05-16 01:08:33] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:08:34] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 874/886 places, 848/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 874/886 places, 848/860 transitions.
Stuttering acceptance computed with spot in 466 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p0)), (NOT p3), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s455 1), p0:(EQ s588 1), p1:(OR (EQ s831 0) (EQ s870 0) (EQ s370 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-13 finished in 2108 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(X(G(p1))||X(p2))))'
Support contains 4 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 876 transition count 850
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 873 transition count 847
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 873 transition count 847
Applied a total of 26 rules in 65 ms. Remains 873 /886 variables (removed 13) and now considering 847/860 (removed 13) transitions.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:08:34] [INFO ] Computed 76 place invariants in 5 ms
[2022-05-16 01:08:34] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:08:34] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:08:35] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2022-05-16 01:08:35] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:08:36] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/886 places, 847/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 873/886 places, 847/860 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s481 1), p1:(AND (EQ s355 1) (EQ s700 1)), p0:(EQ s856 0)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-14 finished in 1577 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 875 transition count 849
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 875 transition count 849
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 872 transition count 846
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 872 transition count 846
Applied a total of 28 rules in 53 ms. Remains 872 /886 variables (removed 14) and now considering 846/860 (removed 14) transitions.
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:08:36] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:08:36] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:08:36] [INFO ] Computed 76 place invariants in 5 ms
[2022-05-16 01:08:36] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2022-05-16 01:08:36] [INFO ] Computed 76 place invariants in 6 ms
[2022-05-16 01:08:37] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/886 places, 846/860 transitions.
Finished structural reductions, in 1 iterations. Remains : 872/886 places, 846/860 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s453 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 534 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-15 finished in 1218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U G((X((p1 U p2))||!p0)))))'
Found a SL insensitive property : AutoFlight-PT-12b-LTLFireability-01
Stuttering acceptance computed with spot in 113 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 886 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 886/886 places, 860/860 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 885 transition count 546
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 349 rules applied. Total rules applied 662 place count 572 transition count 510
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 687 place count 548 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 688 place count 547 transition count 509
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 688 place count 547 transition count 405
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 896 place count 443 transition count 405
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 903 place count 436 transition count 398
Iterating global reduction 4 with 7 rules applied. Total rules applied 910 place count 436 transition count 398
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 910 place count 436 transition count 397
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 912 place count 435 transition count 397
Performed 170 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1252 place count 265 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1253 place count 264 transition count 202
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 20 rules applied. Total rules applied 1273 place count 250 transition count 196
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1279 place count 244 transition count 196
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1279 place count 244 transition count 188
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1295 place count 236 transition count 188
Applied a total of 1295 rules in 69 ms. Remains 236 /886 variables (removed 650) and now considering 188/860 (removed 672) transitions.
// Phase 1: matrix 188 rows 236 cols
[2022-05-16 01:08:37] [INFO ] Computed 62 place invariants in 1 ms
[2022-05-16 01:08:37] [INFO ] Implicit Places using invariants in 127 ms returned [100, 138, 176, 182, 188, 194, 200, 205, 209, 213, 217, 221, 225, 229, 235]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 142 ms to find 15 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 221/886 places, 188/860 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 208 transition count 175
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 208 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 207 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 207 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 206 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 206 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 205 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 205 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 204 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 204 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 203 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 203 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 202 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 202 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 201 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 201 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 200 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 200 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 199 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 199 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 198 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 198 transition count 165
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 0 with 2 rules applied. Total rules applied 48 place count 197 transition count 164
Applied a total of 48 rules in 25 ms. Remains 197 /221 variables (removed 24) and now considering 164/188 (removed 24) transitions.
// Phase 1: matrix 164 rows 197 cols
[2022-05-16 01:08:37] [INFO ] Computed 47 place invariants in 1 ms
[2022-05-16 01:08:37] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 164 rows 197 cols
[2022-05-16 01:08:37] [INFO ] Computed 47 place invariants in 1 ms
[2022-05-16 01:08:38] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-16 01:08:38] [INFO ] Implicit Places using invariants and state equation in 345 ms returned [86, 88, 90]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 441 ms to find 3 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 194/886 places, 164/860 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 194 transition count 161
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 191 transition count 161
Applied a total of 6 rules in 7 ms. Remains 191 /194 variables (removed 3) and now considering 161/164 (removed 3) transitions.
// Phase 1: matrix 161 rows 191 cols
[2022-05-16 01:08:38] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-16 01:08:38] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 161 rows 191 cols
[2022-05-16 01:08:38] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-16 01:08:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 01:08:38] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 191/886 places, 161/860 transitions.
Finished structural reductions, in 3 iterations. Remains : 191/886 places, 161/860 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s94 1), p2:(AND (EQ s78 1) (EQ s133 1)), p1:(EQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2169 reset in 292 ms.
Product exploration explored 100000 steps with 2165 reset in 322 ms.
Computed a total of 7 stabilizing places and 2 stable transitions
Computed a total of 7 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), true]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 403 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Finished random walk after 1425 steps, including 31 resets, run visited all 4 properties in 10 ms. (steps per millisecond=142 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), true]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 400 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 161/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 191 cols
[2022-05-16 01:08:40] [INFO ] Computed 44 place invariants in 0 ms
[2022-05-16 01:08:40] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 161 rows 191 cols
[2022-05-16 01:08:40] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-16 01:08:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 01:08:40] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 191 cols
[2022-05-16 01:08:40] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-16 01:08:40] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/191 places, 161/161 transitions.
Computed a total of 7 stabilizing places and 2 stable transitions
Computed a total of 7 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 377 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Finished random walk after 95 steps, including 2 resets, run visited all 4 properties in 6 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), true]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 393 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 2151 reset in 347 ms.
Product exploration explored 100000 steps with 2137 reset in 323 ms.
Built C files in :
/tmp/ltsmin12275417324191331136
[2022-05-16 01:08:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12275417324191331136
Running compilation step : cd /tmp/ltsmin12275417324191331136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 325 ms.
Running link step : cd /tmp/ltsmin12275417324191331136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12275417324191331136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6881793590345664361.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 161/161 transitions.
Applied a total of 0 rules in 3 ms. Remains 191 /191 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 191 cols
[2022-05-16 01:08:57] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-16 01:08:58] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 161 rows 191 cols
[2022-05-16 01:08:58] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-16 01:08:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 01:08:58] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 191 cols
[2022-05-16 01:08:58] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-16 01:08:58] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/191 places, 161/161 transitions.
Built C files in :
/tmp/ltsmin7651640224284629306
[2022-05-16 01:08:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7651640224284629306
Running compilation step : cd /tmp/ltsmin7651640224284629306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 226 ms.
Running link step : cd /tmp/ltsmin7651640224284629306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin7651640224284629306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10397764755129560948.hoa' '--buchi-type=spotba'
LTSmin run took 6327 ms.
Treatment of property AutoFlight-PT-12b-LTLFireability-01 finished in 27621 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-01 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-16 01:09:05] [INFO ] Flatten gal took : 43 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 228677 ms.

BK_STOP 1652663345227

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-12b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12b, 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 r006-tajo-165245689400476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 ;