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-165245689300444.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-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 7.6K Apr 30 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 30 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 30 01:42 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 23K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 113K 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-05b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652661283153

Running Version 202205111006
[2022-05-16 00:34:44] [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 00:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:34:44] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2022-05-16 00:34:44] [INFO ] Transformed 482 places.
[2022-05-16 00:34:44] [INFO ] Transformed 480 transitions.
[2022-05-16 00:34:44] [INFO ] Found NUPN structural information;
[2022-05-16 00:34:44] [INFO ] Parsed PT model containing 482 places and 480 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA AutoFlight-PT-05b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 422 transition count 420
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 422 transition count 420
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 129 place count 422 transition count 411
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 151 place count 400 transition count 389
Iterating global reduction 1 with 22 rules applied. Total rules applied 173 place count 400 transition count 389
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 177 place count 396 transition count 385
Iterating global reduction 1 with 4 rules applied. Total rules applied 181 place count 396 transition count 385
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 182 place count 395 transition count 384
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 395 transition count 384
Applied a total of 183 rules in 158 ms. Remains 395 /482 variables (removed 87) and now considering 384/480 (removed 96) transitions.
// Phase 1: matrix 384 rows 395 cols
[2022-05-16 00:34:45] [INFO ] Computed 34 place invariants in 14 ms
[2022-05-16 00:34:45] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 384 rows 395 cols
[2022-05-16 00:34:45] [INFO ] Computed 34 place invariants in 4 ms
[2022-05-16 00:34:45] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 395 cols
[2022-05-16 00:34:45] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-16 00:34:45] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 395/482 places, 384/480 transitions.
Finished structural reductions, in 1 iterations. Remains : 395/482 places, 384/480 transitions.
Support contains 26 out of 395 places after structural reductions.
[2022-05-16 00:34:45] [INFO ] Flatten gal took : 47 ms
[2022-05-16 00:34:45] [INFO ] Flatten gal took : 20 ms
[2022-05-16 00:34:45] [INFO ] Input system was already deterministic with 384 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 20) seen :11
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 384 rows 395 cols
[2022-05-16 00:34:46] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 00:34:46] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2022-05-16 00:34:46] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:34:46] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-16 00:34:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-05-16 00:34:47] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 00:34:47] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-16 00:34:47] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 3 ms to minimize.
[2022-05-16 00:34:47] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2022-05-16 00:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2022-05-16 00:34:47] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2022-05-16 00:34:47] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2022-05-16 00:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2022-05-16 00:34:47] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2022-05-16 00:34:48] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2022-05-16 00:34:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 201 ms
[2022-05-16 00:34:48] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2022-05-16 00:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-16 00:34:48] [INFO ] After 1132ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 123 ms.
[2022-05-16 00:34:48] [INFO ] After 1438ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 4 properties in 61 ms.
Support contains 7 out of 395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 395/395 places, 384/384 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 395 transition count 251
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 149 rules applied. Total rules applied 282 place count 262 transition count 235
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 292 place count 252 transition count 235
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 292 place count 252 transition count 187
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 388 place count 204 transition count 187
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 394 place count 198 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 400 place count 198 transition count 181
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 400 place count 198 transition count 179
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 404 place count 196 transition count 179
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 552 place count 122 transition count 95
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 572 place count 122 transition count 75
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 592 place count 102 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 101 transition count 74
Reduce places removed 20 places and 0 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 4 with 43 rules applied. Total rules applied 636 place count 81 transition count 51
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 659 place count 58 transition count 51
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 659 place count 58 transition count 38
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 685 place count 45 transition count 38
Applied a total of 685 rules in 43 ms. Remains 45 /395 variables (removed 350) and now considering 38/384 (removed 346) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/395 places, 38/384 transitions.
Finished random walk after 1488 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=165 )
FORMULA AutoFlight-PT-05b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-05b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-05b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 101 stabilizing places and 101 stable transitions
FORMULA AutoFlight-PT-05b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X((G(p0)&&F(p1)))))))'
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 395/395 places, 384/384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 394 transition count 247
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 152 rules applied. Total rules applied 288 place count 258 transition count 231
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 299 place count 248 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 300 place count 247 transition count 230
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 300 place count 247 transition count 182
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 396 place count 199 transition count 182
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 405 place count 190 transition count 173
Iterating global reduction 4 with 9 rules applied. Total rules applied 414 place count 190 transition count 173
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 414 place count 190 transition count 169
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 422 place count 186 transition count 169
Performed 72 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 566 place count 114 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 567 place count 113 transition count 86
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 578 place count 105 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 581 place count 102 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 581 place count 102 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 591 place count 97 transition count 78
Applied a total of 591 rules in 36 ms. Remains 97 /395 variables (removed 298) and now considering 78/384 (removed 306) transitions.
// Phase 1: matrix 78 rows 97 cols
[2022-05-16 00:34:48] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 00:34:48] [INFO ] Implicit Places using invariants in 73 ms returned [39, 56, 73, 78, 82, 86, 90, 96]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 85 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/395 places, 78/384 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 83 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 83 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 82 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 82 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 81 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 81 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 80 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 80 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 79 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 79 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 78 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 78 transition count 67
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 24 place count 77 transition count 66
Applied a total of 24 rules in 12 ms. Remains 77 /89 variables (removed 12) and now considering 66/78 (removed 12) transitions.
// Phase 1: matrix 66 rows 77 cols
[2022-05-16 00:34:48] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-16 00:34:48] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 66 rows 77 cols
[2022-05-16 00:34:48] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-16 00:34:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/395 places, 66/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 77/395 places, 66/384 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s38 1), p0:(EQ s36 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-01 finished in 510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(X(p0))&&X(X(G(p1)))))))'
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 395/395 places, 384/384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 394 transition count 251
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 145 rules applied. Total rules applied 277 place count 262 transition count 238
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 286 place count 254 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 253 transition count 237
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 287 place count 253 transition count 186
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 389 place count 202 transition count 186
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 398 place count 193 transition count 177
Iterating global reduction 4 with 9 rules applied. Total rules applied 407 place count 193 transition count 177
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 407 place count 193 transition count 173
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 415 place count 189 transition count 173
Performed 71 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 557 place count 118 transition count 92
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 559 place count 117 transition count 92
Applied a total of 559 rules in 34 ms. Remains 117 /395 variables (removed 278) and now considering 92/384 (removed 292) transitions.
// Phase 1: matrix 92 rows 117 cols
[2022-05-16 00:34:49] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 00:34:49] [INFO ] Implicit Places using invariants in 68 ms returned [38, 42, 43, 44, 45, 46, 47, 48, 68, 85, 91, 97, 103, 109, 116]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 78 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/395 places, 92/384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 102 transition count 84
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 94 transition count 84
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 89 transition count 79
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 89 transition count 79
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 30 place count 87 transition count 77
Applied a total of 30 rules in 7 ms. Remains 87 /102 variables (removed 15) and now considering 77/92 (removed 15) transitions.
// Phase 1: matrix 77 rows 87 cols
[2022-05-16 00:34:49] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 00:34:49] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 77 rows 87 cols
[2022-05-16 00:34:49] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 00:34:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-16 00:34:49] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/395 places, 77/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/395 places, 77/384 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s58 1), p1:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-03 finished in 344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U (X(p2)&&p3)))'
Support contains 5 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 384/384 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 386 transition count 375
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 386 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 386 transition count 374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 384 transition count 372
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 384 transition count 372
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 382 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 382 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 381 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 381 transition count 369
Applied a total of 29 rules in 26 ms. Remains 381 /395 variables (removed 14) and now considering 369/384 (removed 15) transitions.
// Phase 1: matrix 369 rows 381 cols
[2022-05-16 00:34:49] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 00:34:49] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 369 rows 381 cols
[2022-05-16 00:34:49] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 00:34:49] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
// Phase 1: matrix 369 rows 381 cols
[2022-05-16 00:34:49] [INFO ] Computed 34 place invariants in 6 ms
[2022-05-16 00:34:49] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 381/395 places, 369/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 381/395 places, 369/384 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2) p3), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=p3, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s101 1), p1:(AND (EQ s67 1) (EQ s283 1)), p0:(EQ s81 1), p2:(NEQ s118 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 268 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-05 finished in 735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(!(p0 U p1)))&&F(p0)))'
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 384/384 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 384 transition count 373
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 384 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 384 transition count 372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 380 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 380 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 377 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 377 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 376 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 376 transition count 364
Applied a total of 39 rules in 32 ms. Remains 376 /395 variables (removed 19) and now considering 364/384 (removed 20) transitions.
// Phase 1: matrix 364 rows 376 cols
[2022-05-16 00:34:50] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 00:34:50] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 364 rows 376 cols
[2022-05-16 00:34:50] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 00:34:50] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
// Phase 1: matrix 364 rows 376 cols
[2022-05-16 00:34:50] [INFO ] Computed 34 place invariants in 4 ms
[2022-05-16 00:34:50] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376/395 places, 364/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 376/395 places, 364/384 transitions.
Stuttering acceptance computed with spot in 113 ms :[p1, true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s116 1), p0:(EQ s167 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 237 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-11 finished in 711 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(p1)))'
Support contains 5 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 384/384 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 384 transition count 373
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 384 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 384 transition count 372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 380 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 380 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 377 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 377 transition count 365
Applied a total of 37 rules in 31 ms. Remains 377 /395 variables (removed 18) and now considering 365/384 (removed 19) transitions.
// Phase 1: matrix 365 rows 377 cols
[2022-05-16 00:34:50] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 00:34:51] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 365 rows 377 cols
[2022-05-16 00:34:51] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 00:34:51] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
// Phase 1: matrix 365 rows 377 cols
[2022-05-16 00:34:51] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 00:34:51] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/395 places, 365/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 377/395 places, 365/384 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s156 1) (EQ s301 1) (EQ s46 1)), p1:(AND (EQ s218 1) (EQ s375 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-12 finished in 654 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 395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 395/395 places, 384/384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 394 transition count 247
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 152 rules applied. Total rules applied 288 place count 258 transition count 231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 298 place count 248 transition count 231
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 298 place count 248 transition count 183
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 394 place count 200 transition count 183
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 403 place count 191 transition count 174
Iterating global reduction 3 with 9 rules applied. Total rules applied 412 place count 191 transition count 174
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 412 place count 191 transition count 170
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 420 place count 187 transition count 170
Performed 72 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 564 place count 115 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 114 transition count 87
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 578 place count 105 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 582 place count 101 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 582 place count 101 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 592 place count 96 transition count 78
Applied a total of 592 rules in 22 ms. Remains 96 /395 variables (removed 299) and now considering 78/384 (removed 306) transitions.
// Phase 1: matrix 78 rows 96 cols
[2022-05-16 00:34:51] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 00:34:51] [INFO ] Implicit Places using invariants in 53 ms returned [39, 56, 73, 78, 82, 86, 90, 95]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 54 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/395 places, 78/384 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 77 transition count 67
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 24 place count 76 transition count 66
Applied a total of 24 rules in 11 ms. Remains 76 /88 variables (removed 12) and now considering 66/78 (removed 12) transitions.
// Phase 1: matrix 66 rows 76 cols
[2022-05-16 00:34:51] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 00:34:51] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 66 rows 76 cols
[2022-05-16 00:34:51] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:34:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:34:51] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/395 places, 66/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 76/395 places, 66/384 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 229 ms.
All properties solved by simple procedures.
Total runtime 7340 ms.

BK_STOP 1652661291890

--------------------
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-05b"
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-05b, 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-165245689300444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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