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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.0K Apr 30 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 30 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 01:34 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.6K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 43K 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-06a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652661525130

Running Version 202205111006
[2022-05-16 00:38:46] [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:38:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:38:46] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2022-05-16 00:38:46] [INFO ] Transformed 157 places.
[2022-05-16 00:38:46] [INFO ] Transformed 155 transitions.
[2022-05-16 00:38:46] [INFO ] Found NUPN structural information;
[2022-05-16 00:38:46] [INFO ] Parsed PT model containing 157 places and 155 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
FORMULA AutoFlight-PT-06a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 125/125 transitions.
Applied a total of 0 rules in 33 ms. Remains 157 /157 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 157 cols
[2022-05-16 00:38:47] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-16 00:38:47] [INFO ] Implicit Places using invariants in 288 ms returned [14, 21, 28, 45, 48, 51, 54, 57, 60, 92, 118, 124, 130, 136, 148, 154]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 358 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 141/157 places, 125/125 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 136 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 136 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 135 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 135 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 134 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 134 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 133 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 133 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 132 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 132 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 131 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 131 transition count 115
Applied a total of 20 rules in 40 ms. Remains 131 /141 variables (removed 10) and now considering 115/125 (removed 10) transitions.
// Phase 1: matrix 115 rows 131 cols
[2022-05-16 00:38:47] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-16 00:38:47] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 115 rows 131 cols
[2022-05-16 00:38:47] [INFO ] Computed 24 place invariants in 3 ms
[2022-05-16 00:38:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 00:38:47] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/157 places, 115/125 transitions.
Finished structural reductions, in 2 iterations. Remains : 131/157 places, 115/125 transitions.
Support contains 34 out of 131 places after structural reductions.
[2022-05-16 00:38:47] [INFO ] Flatten gal took : 29 ms
[2022-05-16 00:38:47] [INFO ] Flatten gal took : 13 ms
[2022-05-16 00:38:47] [INFO ] Input system was already deterministic with 115 transitions.
Incomplete random walk after 10000 steps, including 290 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 115 rows 131 cols
[2022-05-16 00:38:48] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-16 00:38:48] [INFO ] [Real]Absence check using 24 positive place invariants in 4 ms returned sat
[2022-05-16 00:38:48] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 00:38:48] [INFO ] [Nat]Absence check using 24 positive place invariants in 5 ms returned sat
[2022-05-16 00:38:48] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 00:38:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 00:38:48] [INFO ] After 19ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-16 00:38:48] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2022-05-16 00:38:48] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 131/131 places, 115/115 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 0 with 22 rules applied. Total rules applied 22 place count 131 transition count 93
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 109 transition count 93
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 44 place count 109 transition count 76
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 78 place count 92 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 91 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 91 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 90 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 90 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 89 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 89 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 88 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 88 transition count 72
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 108 place count 77 transition count 61
Free-agglomeration rule applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 77 transition count 49
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 132 place count 65 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 64 transition count 48
Reduce places removed 20 places and 0 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 3 with 44 rules applied. Total rules applied 177 place count 44 transition count 24
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 201 place count 20 transition count 24
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 201 place count 20 transition count 19
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 211 place count 15 transition count 19
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 216 place count 10 transition count 14
Iterating global reduction 5 with 5 rules applied. Total rules applied 221 place count 10 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 225 place count 10 transition count 10
Applied a total of 225 rules in 29 ms. Remains 10 /131 variables (removed 121) and now considering 10/115 (removed 105) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/131 places, 10/115 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=5 )
Computed a total of 4 stabilizing places and 1 stable transitions
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 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 107
Applied a total of 16 rules in 11 ms. Remains 123 /131 variables (removed 8) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 123 cols
[2022-05-16 00:38:49] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:38:49] [INFO ] Implicit Places using invariants in 77 ms returned [7, 32, 39, 112, 122]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 78 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/131 places, 107/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 111 transition count 100
Applied a total of 14 rules in 22 ms. Remains 111 /118 variables (removed 7) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 111 cols
[2022-05-16 00:38:49] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:38:49] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 100 rows 111 cols
[2022-05-16 00:38:49] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:38:49] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/131 places, 100/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 111/131 places, 100/115 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-02 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 s17 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 2 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-02 finished in 533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G((G(p2)&&p1))))||(p0 U p3)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 129 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 129 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 108
Applied a total of 14 rules in 14 ms. Remains 124 /131 variables (removed 7) and now considering 108/115 (removed 7) transitions.
// Phase 1: matrix 108 rows 124 cols
[2022-05-16 00:38:49] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:38:49] [INFO ] Implicit Places using invariants in 48 ms returned [7, 32, 39, 112]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/131 places, 108/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 117 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 117 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 116 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 114 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 113 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 113 transition count 101
Applied a total of 14 rules in 22 ms. Remains 113 /120 variables (removed 7) and now considering 101/108 (removed 7) transitions.
// Phase 1: matrix 101 rows 113 cols
[2022-05-16 00:38:49] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 00:38:49] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 101 rows 113 cols
[2022-05-16 00:38:49] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/131 places, 101/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 113/131 places, 101/115 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s102 1) (EQ s112 1)), p3:(EQ s30 1), p1:(AND (EQ s102 1) (EQ s112 1)), p2:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-03 finished in 525 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 107
Applied a total of 16 rules in 6 ms. Remains 123 /131 variables (removed 8) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 123 cols
[2022-05-16 00:38:50] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants in 42 ms returned [7, 32, 39, 112, 122]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 43 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/131 places, 107/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 115 transition count 104
Applied a total of 6 rules in 2 ms. Remains 115 /118 variables (removed 3) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 115 cols
[2022-05-16 00:38:50] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 104 rows 115 cols
[2022-05-16 00:38:50] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/131 places, 104/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 115/131 places, 104/115 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s64 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 65 steps with 1 reset in 5 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-04 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 107
Applied a total of 16 rules in 7 ms. Remains 123 /131 variables (removed 8) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 123 cols
[2022-05-16 00:38:50] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants in 62 ms returned [7, 32, 39, 112, 122]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/131 places, 107/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 111 transition count 100
Applied a total of 14 rules in 10 ms. Remains 111 /118 variables (removed 7) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 111 cols
[2022-05-16 00:38:50] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 100 rows 111 cols
[2022-05-16 00:38:50] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/131 places, 100/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 111/131 places, 100/115 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s28 0) (EQ s84 0))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 215 steps with 5 reset in 1 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-05 finished in 250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(X(p0))&&X(p1)) U !F(p2)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 110
Applied a total of 10 rules in 3 ms. Remains 126 /131 variables (removed 5) and now considering 110/115 (removed 5) transitions.
// Phase 1: matrix 110 rows 126 cols
[2022-05-16 00:38:50] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants in 62 ms returned [7, 39, 115, 125]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/131 places, 110/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 109
Applied a total of 2 rules in 1 ms. Remains 121 /122 variables (removed 1) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 121 cols
[2022-05-16 00:38:50] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 109 rows 121 cols
[2022-05-16 00:38:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:38:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 00:38:50] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/131 places, 109/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 121/131 places, 109/115 transitions.
Stuttering acceptance computed with spot in 110 ms :[p2, (AND p0 p1), (AND p0 p2 p1), p0, (AND p0 p2 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s81 1), p1:(AND (EQ s31 1) (EQ s73 1)), p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33501 reset in 344 ms.
Product exploration explored 100000 steps with 33262 reset in 255 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p1 p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 424 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[p2, (AND (NOT p2) p0 p1), p0, (AND p0 p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 305 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 121 cols
[2022-05-16 00:38:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:38:52] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-16 00:38:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p1 p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2)), (F p2), (F (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))]
Knowledge based reduction with 11 factoid took 534 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[p2, (AND p0 p1), p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 117 ms :[p2, (AND p0 p1), p0, (AND p0 p2)]
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 109/109 transitions.
Applied a total of 0 rules in 0 ms. Remains 121 /121 variables (removed 0) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 121 cols
[2022-05-16 00:38:53] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 00:38:53] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 109 rows 121 cols
[2022-05-16 00:38:53] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 00:38:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 00:38:53] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 121 cols
[2022-05-16 00:38:53] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 00:38:53] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 109/109 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 403 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 122 ms :[p2, (AND p0 p1), p0, (AND p0 p2)]
Incomplete random walk after 10000 steps, including 279 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :3
Finished Best-First random walk after 2295 steps, including 7 resets, run visited all 2 properties in 3 ms. (steps per millisecond=765 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p2 p0)), (F p2), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 681 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 172 ms :[p2, (AND p0 p1), p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 176 ms :[p2, (AND p0 p1), p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 192 ms :[p2, (AND p0 p1), p0, (AND p0 p2)]
Product exploration explored 100000 steps with 2948 reset in 340 ms.
Stack based approach found an accepted trace after 718 steps with 23 reset with depth 93 and stack size 82 in 2 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-06 finished in 4653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(F(p1)||p2))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 107
Applied a total of 16 rules in 10 ms. Remains 123 /131 variables (removed 8) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 123 cols
[2022-05-16 00:38:55] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:38:55] [INFO ] Implicit Places using invariants in 82 ms returned [7, 32, 39, 112, 122]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 83 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/131 places, 107/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 111 transition count 100
Applied a total of 14 rules in 7 ms. Remains 111 /118 variables (removed 7) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 111 cols
[2022-05-16 00:38:55] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:38:55] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 100 rows 111 cols
[2022-05-16 00:38:55] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:38:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/131 places, 100/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 111/131 places, 100/115 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s9 0) (EQ s90 0)), p2:(AND (EQ s9 1) (EQ s90 1)), p1:(EQ s18 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20062 steps with 554 reset in 85 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-07 finished in 535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(X(X(p0)))) U (X(p2)&&p1))||p3)))'
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 107
Applied a total of 16 rules in 15 ms. Remains 123 /131 variables (removed 8) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 123 cols
[2022-05-16 00:38:56] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-16 00:38:56] [INFO ] Implicit Places using invariants in 85 ms returned [32, 39, 112, 122]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/131 places, 107/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 106
Applied a total of 2 rules in 4 ms. Remains 118 /119 variables (removed 1) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 118 cols
[2022-05-16 00:38:56] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:38:56] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 106 rows 118 cols
[2022-05-16 00:38:56] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:38:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 00:38:56] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 118/131 places, 106/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 118/131 places, 106/115 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p3:(EQ s41 1), p1:(AND (EQ s41 1) (EQ s47 1)), p2:(EQ s49 1), p0:(AND (EQ s7 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) (NOT p1))))
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-06a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06a-LTLFireability-09 finished in 1309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U G(p1))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 127 transition count 80
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 71 place count 93 transition count 80
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 71 place count 93 transition count 67
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 103 place count 74 transition count 67
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 103 place count 74 transition count 61
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 68 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 66 transition count 59
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 66 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 143 place count 54 transition count 47
Applied a total of 143 rules in 21 ms. Remains 54 /131 variables (removed 77) and now considering 47/115 (removed 68) transitions.
// Phase 1: matrix 47 rows 54 cols
[2022-05-16 00:38:57] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants in 46 ms returned [47, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/131 places, 47/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 46
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 4 place count 50 transition count 45
Applied a total of 4 rules in 5 ms. Remains 50 /52 variables (removed 2) and now considering 45/47 (removed 2) transitions.
// Phase 1: matrix 45 rows 50 cols
[2022-05-16 00:38:57] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 45 rows 50 cols
[2022-05-16 00:38:57] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/131 places, 45/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 50/131 places, 45/115 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s23 1) (EQ s36 1)), p0:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-10 finished in 278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 107
Applied a total of 16 rules in 11 ms. Remains 123 /131 variables (removed 8) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 123 cols
[2022-05-16 00:38:57] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants in 60 ms returned [7, 32, 39, 112, 122]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 61 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/131 places, 107/115 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 111 transition count 100
Applied a total of 14 rules in 8 ms. Remains 111 /118 variables (removed 7) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 111 cols
[2022-05-16 00:38:57] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 100 rows 111 cols
[2022-05-16 00:38:57] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/131 places, 100/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 111/131 places, 100/115 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s23 1), p1:(EQ s11 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][false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-11 finished in 273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((F(p0)&&F(p1))))&&F(G(p2))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 131 transition count 96
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 112 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 111 transition count 95
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 40 place count 111 transition count 78
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 74 place count 94 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 92 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 92 transition count 76
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 100 place count 81 transition count 65
Applied a total of 100 rules in 13 ms. Remains 81 /131 variables (removed 50) and now considering 65/115 (removed 50) transitions.
// Phase 1: matrix 65 rows 81 cols
[2022-05-16 00:38:57] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants in 50 ms returned [5, 23, 28, 29, 30, 31, 32, 33, 34, 80]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 52 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/131 places, 65/115 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 0 with 6 rules applied. Total rules applied 6 place count 71 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 65 transition count 53
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 59 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 59 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 58 transition count 52
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 3 with 4 rules applied. Total rules applied 30 place count 56 transition count 50
Applied a total of 30 rules in 6 ms. Remains 56 /71 variables (removed 15) and now considering 50/65 (removed 15) transitions.
// Phase 1: matrix 50 rows 56 cols
[2022-05-16 00:38:57] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 50 rows 56 cols
[2022-05-16 00:38:57] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:38:57] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 00:38:57] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/131 places, 50/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 56/131 places, 50/115 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-13 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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s33 1), p1:(AND (EQ s33 0) (OR (EQ s50 0) (EQ s55 0))), p2:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-13 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(G(p0))) U p1)))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 127 transition count 80
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 71 place count 93 transition count 80
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 71 place count 93 transition count 67
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 103 place count 74 transition count 67
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 103 place count 74 transition count 61
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 68 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 66 transition count 59
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 66 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 143 place count 54 transition count 47
Applied a total of 143 rules in 13 ms. Remains 54 /131 variables (removed 77) and now considering 47/115 (removed 68) transitions.
// Phase 1: matrix 47 rows 54 cols
[2022-05-16 00:38:58] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-16 00:38:58] [INFO ] Implicit Places using invariants in 38 ms returned [47, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/131 places, 47/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 46
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 4 place count 50 transition count 45
Applied a total of 4 rules in 6 ms. Remains 50 /52 variables (removed 2) and now considering 45/47 (removed 2) transitions.
// Phase 1: matrix 45 rows 50 cols
[2022-05-16 00:38:58] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:38:58] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 45 rows 50 cols
[2022-05-16 00:38:58] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:38:58] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/131 places, 45/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 50/131 places, 45/115 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s19 1), p0:(AND (EQ s0 1) (EQ s25 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 26 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-14 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((G(p0)||F(p1)))||G(p2)))))'
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 114
Applied a total of 2 rules in 2 ms. Remains 130 /131 variables (removed 1) and now considering 114/115 (removed 1) transitions.
// Phase 1: matrix 114 rows 130 cols
[2022-05-16 00:38:58] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:38:58] [INFO ] Implicit Places using invariants in 79 ms returned [7, 32, 119, 129]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 80 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 114/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 113
Applied a total of 2 rules in 2 ms. Remains 125 /126 variables (removed 1) and now considering 113/114 (removed 1) transitions.
// Phase 1: matrix 113 rows 125 cols
[2022-05-16 00:38:58] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 00:38:58] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 113 rows 125 cols
[2022-05-16 00:38:58] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:38:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 00:38:58] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 125/131 places, 113/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 125/131 places, 113/115 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s46 0) (EQ s118 0)), p0:(AND (EQ s37 1) (EQ s81 1)), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 530 steps with 32 reset in 3 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-15 finished in 452 ms.
All properties solved by simple procedures.
Total runtime 12534 ms.

BK_STOP 1652661538980

--------------------
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-06a"
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-06a, 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-165245689300452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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