Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180000063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutoFlight-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180000063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 22:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 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-03b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716275512915

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 07:11:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 07:11:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:11:55] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-21 07:11:55] [INFO ] Transformed 298 places.
[2024-05-21 07:11:55] [INFO ] Transformed 296 transitions.
[2024-05-21 07:11:55] [INFO ] Found NUPN structural information;
[2024-05-21 07:11:55] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-03b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 265 transition count 263
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 265 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 265 transition count 259
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 86 place count 249 transition count 243
Iterating global reduction 1 with 16 rules applied. Total rules applied 102 place count 249 transition count 243
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 247 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 247 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 246 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 246 transition count 240
Applied a total of 108 rules in 117 ms. Remains 246 /298 variables (removed 52) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 246 cols
[2024-05-21 07:11:56] [INFO ] Computed 22 invariants in 36 ms
[2024-05-21 07:11:56] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-21 07:11:56] [INFO ] Invariant cache hit.
[2024-05-21 07:11:56] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2024-05-21 07:11:56] [INFO ] Invariant cache hit.
[2024-05-21 07:11:57] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 246/298 places, 240/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1293 ms. Remains : 246/298 places, 240/296 transitions.
Support contains 36 out of 246 places after structural reductions.
[2024-05-21 07:11:57] [INFO ] Flatten gal took : 70 ms
[2024-05-21 07:11:57] [INFO ] Flatten gal took : 29 ms
[2024-05-21 07:11:57] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 35 out of 246 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 07:11:58] [INFO ] Invariant cache hit.
[2024-05-21 07:11:58] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-21 07:11:58] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-21 07:11:58] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 07:11:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-21 07:11:58] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:11:59] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 07:11:59] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 8 ms to minimize.
[2024-05-21 07:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-05-21 07:11:59] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-21 07:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2024-05-21 07:11:59] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-21 07:11:59] [INFO ] After 774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 126 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=18 )
Parikh walk visited 4 properties in 13 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(F(p1)))))))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 30 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 07:12:00] [INFO ] Computed 22 invariants in 6 ms
[2024-05-21 07:12:00] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 07:12:00] [INFO ] Invariant cache hit.
[2024-05-21 07:12:00] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-21 07:12:00] [INFO ] Invariant cache hit.
[2024-05-21 07:12:00] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 233/246 places, 225/240 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s51 1), p0:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 154 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-00 finished in 1132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 245 transition count 151
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 101 rules applied. Total rules applied 189 place count 157 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 195 place count 151 transition count 138
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 195 place count 151 transition count 107
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 257 place count 120 transition count 107
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 263 place count 114 transition count 101
Iterating global reduction 3 with 6 rules applied. Total rules applied 269 place count 114 transition count 101
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 269 place count 114 transition count 98
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 111 transition count 98
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 355 place count 71 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 70 transition count 53
Reduce places removed 6 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 3 with 9 rules applied. Total rules applied 365 place count 64 transition count 50
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 368 place count 61 transition count 50
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 368 place count 61 transition count 47
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 374 place count 58 transition count 47
Applied a total of 374 rules in 52 ms. Remains 58 /246 variables (removed 188) and now considering 47/240 (removed 193) transitions.
// Phase 1: matrix 47 rows 58 cols
[2024-05-21 07:12:01] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 07:12:01] [INFO ] Implicit Places using invariants in 84 ms returned [22, 33, 44, 48, 52, 57]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/246 places, 47/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 45 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 45 transition count 40
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 16 place count 44 transition count 39
Applied a total of 16 rules in 9 ms. Remains 44 /52 variables (removed 8) and now considering 39/47 (removed 8) transitions.
// Phase 1: matrix 39 rows 44 cols
[2024-05-21 07:12:01] [INFO ] Computed 10 invariants in 0 ms
[2024-05-21 07:12:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 07:12:01] [INFO ] Invariant cache hit.
[2024-05-21 07:12:01] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/246 places, 39/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 44/246 places, 39/240 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-01 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((p1||F(p2)))))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 245 transition count 158
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 90 rules applied. Total rules applied 171 place count 164 transition count 149
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 176 place count 161 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 159 transition count 147
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 178 place count 159 transition count 115
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 242 place count 127 transition count 115
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 247 place count 122 transition count 110
Iterating global reduction 4 with 5 rules applied. Total rules applied 252 place count 122 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 252 place count 122 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 258 place count 119 transition count 107
Performed 41 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 340 place count 78 transition count 62
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 342 place count 77 transition count 62
Applied a total of 342 rules in 33 ms. Remains 77 /246 variables (removed 169) and now considering 62/240 (removed 178) transitions.
// Phase 1: matrix 62 rows 77 cols
[2024-05-21 07:12:01] [INFO ] Computed 22 invariants in 3 ms
[2024-05-21 07:12:01] [INFO ] Implicit Places using invariants in 93 ms returned [26, 30, 31, 32, 33, 57, 63, 69, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 94 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/246 places, 62/240 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 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 58
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 64 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 61 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 61 transition count 55
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 18 place count 59 transition count 53
Applied a total of 18 rules in 7 ms. Remains 59 /68 variables (removed 9) and now considering 53/62 (removed 9) transitions.
// Phase 1: matrix 53 rows 59 cols
[2024-05-21 07:12:01] [INFO ] Computed 13 invariants in 3 ms
[2024-05-21 07:12:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 07:12:01] [INFO ] Invariant cache hit.
[2024-05-21 07:12:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 07:12:01] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/246 places, 53/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 59/246 places, 53/240 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s12 0), p1:(AND (EQ s49 1) (EQ s27 1)), p2:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 30521 reset in 491 ms.
Product exploration explored 100000 steps with 30444 reset in 343 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Finished random walk after 561 steps, including 26 resets, run visited all 5 properties in 8 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-21 07:12:03] [INFO ] Invariant cache hit.
[2024-05-21 07:12:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 07:12:03] [INFO ] Invariant cache hit.
[2024-05-21 07:12:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 07:12:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-21 07:12:03] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 07:12:03] [INFO ] Invariant cache hit.
[2024-05-21 07:12:03] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 59/59 places, 53/53 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 698 steps, including 33 resets, run visited all 5 properties in 5 ms. (steps per millisecond=139 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 30457 reset in 392 ms.
Product exploration explored 100000 steps with 30434 reset in 575 ms.
Built C files in :
/tmp/ltsmin8581536546591124293
[2024-05-21 07:12:05] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-21 07:12:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:12:06] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-21 07:12:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:12:06] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-21 07:12:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:12:06] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8581536546591124293
Running compilation step : cd /tmp/ltsmin8581536546591124293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 518 ms.
Running link step : cd /tmp/ltsmin8581536546591124293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin8581536546591124293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16925649340165765257.hoa' '--buchi-type=spotba'
LTSmin run took 545 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLFireability-02 finished in 5628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 245 transition count 150
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 102 rules applied. Total rules applied 191 place count 156 transition count 137
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 197 place count 150 transition count 137
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 197 place count 150 transition count 108
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 255 place count 121 transition count 108
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 261 place count 115 transition count 102
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 115 transition count 102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 267 place count 115 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 273 place count 112 transition count 99
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 353 place count 72 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 354 place count 71 transition count 54
Reduce places removed 6 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 3 with 9 rules applied. Total rules applied 363 place count 65 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 366 place count 62 transition count 51
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 366 place count 62 transition count 48
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 372 place count 59 transition count 48
Applied a total of 372 rules in 26 ms. Remains 59 /246 variables (removed 187) and now considering 48/240 (removed 192) transitions.
// Phase 1: matrix 48 rows 59 cols
[2024-05-21 07:12:07] [INFO ] Computed 16 invariants in 2 ms
[2024-05-21 07:12:07] [INFO ] Implicit Places using invariants in 79 ms returned [21, 33, 44, 48, 52]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 81 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/246 places, 48/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 45
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 45
Applied a total of 6 rules in 4 ms. Remains 51 /54 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 51 cols
[2024-05-21 07:12:07] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 07:12:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 07:12:07] [INFO ] Invariant cache hit.
[2024-05-21 07:12:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/246 places, 45/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 51/246 places, 45/240 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-03 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (!p1&&G(p2))))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 20 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 07:12:07] [INFO ] Computed 22 invariants in 3 ms
[2024-05-21 07:12:07] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 07:12:07] [INFO ] Invariant cache hit.
[2024-05-21 07:12:07] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-21 07:12:07] [INFO ] Invariant cache hit.
[2024-05-21 07:12:08] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2), true, (AND (NOT p2) p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s73 1) (EQ s177 1)), p2:(EQ s106 1), p0:(NEQ s192 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]]
Entered a terminal (fully accepting) state of product in 81 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-04 finished in 841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(p1))))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 31 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
[2024-05-21 07:12:08] [INFO ] Invariant cache hit.
[2024-05-21 07:12:08] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 07:12:08] [INFO ] Invariant cache hit.
[2024-05-21 07:12:08] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-21 07:12:08] [INFO ] Invariant cache hit.
[2024-05-21 07:12:09] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 619 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s194 1), p1:(EQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2180 reset in 253 ms.
Product exploration explored 100000 steps with 2142 reset in 353 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/233 stabilizing places and 57/225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 1190 steps, including 7 resets, run visited all 4 properties in 8 ms. (steps per millisecond=148 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 264 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-21 07:12:10] [INFO ] Invariant cache hit.
[2024-05-21 07:12:10] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2024-05-21 07:12:10] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:12:10] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-21 07:12:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:12:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2024-05-21 07:12:11] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 07:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:12:11] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-21 07:12:11] [INFO ] Computed and/alt/rep : 224/321/224 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 07:12:12] [INFO ] Added : 216 causal constraints over 44 iterations in 1189 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 225/225 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 232 transition count 150
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 80 rules applied. Total rules applied 154 place count 158 transition count 144
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 160 place count 154 transition count 142
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 164 place count 152 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 151 transition count 140
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 165 place count 151 transition count 108
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 229 place count 119 transition count 108
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 319 place count 74 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 320 place count 73 transition count 56
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 7 rules applied. Total rules applied 327 place count 68 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 329 place count 66 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 329 place count 66 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 335 place count 63 transition count 51
Applied a total of 335 rules in 26 ms. Remains 63 /233 variables (removed 170) and now considering 51/225 (removed 174) transitions.
// Phase 1: matrix 51 rows 63 cols
[2024-05-21 07:12:12] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 07:12:12] [INFO ] Implicit Places using invariants in 100 ms returned [24, 35, 52, 57, 62]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 101 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/233 places, 51/225 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 54 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 52 transition count 45
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 0 with 4 rules applied. Total rules applied 16 place count 50 transition count 43
Applied a total of 16 rules in 5 ms. Remains 50 /58 variables (removed 8) and now considering 43/51 (removed 8) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-05-21 07:12:12] [INFO ] Computed 12 invariants in 0 ms
[2024-05-21 07:12:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 07:12:12] [INFO ] Invariant cache hit.
[2024-05-21 07:12:12] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/233 places, 43/225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 50/233 places, 43/225 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/50 stabilizing places and 2/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 576 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 31 steps, including 1 resets, run visited all 4 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 565 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-21 07:12:14] [INFO ] Invariant cache hit.
[2024-05-21 07:12:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 07:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:12:14] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-21 07:12:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:12:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 07:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:12:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 07:12:14] [INFO ] Computed and/alt/rep : 25/40/25 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 07:12:14] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 11280 reset in 362 ms.
Stack based approach found an accepted trace after 3010 steps with 328 reset with depth 6 and stack size 6 in 16 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-05 finished in 6740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(G(p1) U X(X(G(p2))))&&F(p3)))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 239 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 239 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 239 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 238 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 238 transition count 230
Applied a total of 18 rules in 17 ms. Remains 238 /246 variables (removed 8) and now considering 230/240 (removed 10) transitions.
// Phase 1: matrix 230 rows 238 cols
[2024-05-21 07:12:15] [INFO ] Computed 22 invariants in 3 ms
[2024-05-21 07:12:15] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 07:12:15] [INFO ] Invariant cache hit.
[2024-05-21 07:12:15] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-21 07:12:15] [INFO ] Invariant cache hit.
[2024-05-21 07:12:15] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/246 places, 230/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 238/246 places, 230/240 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p3) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p3), (NOT p0), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 6}, { cond=(AND p1 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s32 1), p3:(EQ s135 1), p0:(EQ s74 1), p2:(EQ s64 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-06 finished in 988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(p1&&X((p1 U (X(p2)||G(p1)))))))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 238 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 236 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 235 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 234 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 234 transition count 227
Applied a total of 25 rules in 21 ms. Remains 234 /246 variables (removed 12) and now considering 227/240 (removed 13) transitions.
// Phase 1: matrix 227 rows 234 cols
[2024-05-21 07:12:16] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 07:12:16] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 07:12:16] [INFO ] Invariant cache hit.
[2024-05-21 07:12:16] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-21 07:12:16] [INFO ] Invariant cache hit.
[2024-05-21 07:12:16] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 227/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 234/246 places, 227/240 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s21 0), p1:(NEQ s196 1), p2:(EQ s214 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 657 reset in 252 ms.
Product exploration explored 100000 steps with 661 reset in 296 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/234 stabilizing places and 57/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 407 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 61 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :2
Finished Best-First random walk after 5935 steps, including 3 resets, run visited all 2 properties in 8 ms. (steps per millisecond=741 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 865 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 233 transition count 151
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 84 rules applied. Total rules applied 159 place count 158 transition count 142
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 152 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 150 transition count 140
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 169 place count 150 transition count 108
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 233 place count 118 transition count 108
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 319 place count 75 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 74 transition count 58
Reduce places removed 6 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 9 rules applied. Total rules applied 329 place count 68 transition count 55
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 332 place count 65 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 332 place count 65 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 338 place count 62 transition count 52
Applied a total of 338 rules in 31 ms. Remains 62 /234 variables (removed 172) and now considering 52/227 (removed 175) transitions.
// Phase 1: matrix 52 rows 62 cols
[2024-05-21 07:12:20] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 07:12:20] [INFO ] Implicit Places using invariants in 101 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/234 places, 52/227 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 56 transition count 47
Applied a total of 10 rules in 4 ms. Remains 56 /61 variables (removed 5) and now considering 47/52 (removed 5) transitions.
// Phase 1: matrix 47 rows 56 cols
[2024-05-21 07:12:20] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 07:12:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 07:12:20] [INFO ] Invariant cache hit.
[2024-05-21 07:12:20] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/234 places, 47/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 308 ms. Remains : 56/234 places, 47/227 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/56 stabilizing places and 4/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 1077 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 533 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Finished random walk after 179 steps, including 8 resets, run visited all 6 properties in 10 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 2162 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 566 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 517 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 5063 reset in 213 ms.
Stack based approach found an accepted trace after 52312 steps with 2669 reset with depth 11 and stack size 11 in 125 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-07 finished in 10434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 238 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 236 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 235 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 234 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 234 transition count 227
Applied a total of 25 rules in 28 ms. Remains 234 /246 variables (removed 12) and now considering 227/240 (removed 13) transitions.
// Phase 1: matrix 227 rows 234 cols
[2024-05-21 07:12:26] [INFO ] Computed 22 invariants in 3 ms
[2024-05-21 07:12:26] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-21 07:12:26] [INFO ] Invariant cache hit.
[2024-05-21 07:12:27] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-21 07:12:27] [INFO ] Invariant cache hit.
[2024-05-21 07:12:27] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 227/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 869 ms. Remains : 234/246 places, 227/240 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-08 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:(EQ s28 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 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-08 finished in 1006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p1||G(p2)))||p0))))'
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Applied a total of 26 rules in 26 ms. Remains 234 /246 variables (removed 12) and now considering 226/240 (removed 14) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-21 07:12:27] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 07:12:27] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-21 07:12:27] [INFO ] Invariant cache hit.
[2024-05-21 07:12:28] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2024-05-21 07:12:28] [INFO ] Invariant cache hit.
[2024-05-21 07:12:28] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 226/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 234/246 places, 226/240 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s191 0) (EQ s143 0)), p1:(EQ s154 0), p2:(AND (EQ s60 1) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 626 reset in 141 ms.
Product exploration explored 100000 steps with 624 reset in 183 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/234 stabilizing places and 58/226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 201 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 07:12:29] [INFO ] Invariant cache hit.
[2024-05-21 07:12:29] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 07:12:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-21 07:12:29] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 07:12:29] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 51 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLFireability-09 finished in 2174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 31 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 07:12:29] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 07:12:30] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-21 07:12:30] [INFO ] Invariant cache hit.
[2024-05-21 07:12:30] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-21 07:12:30] [INFO ] Invariant cache hit.
[2024-05-21 07:12:30] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 791 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s58 1), p1:(AND (EQ s206 1) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-10 finished in 944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (p1&&X(p2))))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 237 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 237 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 233 transition count 225
Applied a total of 28 rules in 30 ms. Remains 233 /246 variables (removed 13) and now considering 225/240 (removed 15) transitions.
[2024-05-21 07:12:30] [INFO ] Invariant cache hit.
[2024-05-21 07:12:30] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 07:12:30] [INFO ] Invariant cache hit.
[2024-05-21 07:12:31] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-21 07:12:31] [INFO ] Invariant cache hit.
[2024-05-21 07:12:31] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/246 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 923 ms. Remains : 233/246 places, 225/240 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ 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 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s120 1), p0:(AND (EQ s73 1) (EQ s177 1) (EQ s152 1)), p2:(AND (EQ s73 1) (EQ s177 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-12 finished in 1147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0 U p1)) U (p2&&G(!p0)))||X(X(F(p1)))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 234 transition count 226
Applied a total of 26 rules in 19 ms. Remains 234 /246 variables (removed 12) and now considering 226/240 (removed 14) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-21 07:12:31] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 07:12:31] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 07:12:31] [INFO ] Invariant cache hit.
[2024-05-21 07:12:32] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-21 07:12:32] [INFO ] Invariant cache hit.
[2024-05-21 07:12:32] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 226/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 234/246 places, 226/240 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s74 1), p0:(NEQ s226 1), p1:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 903 reset in 135 ms.
Product exploration explored 100000 steps with 906 reset in 156 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/234 stabilizing places and 57/226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 157 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 130 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=130 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-21 07:12:33] [INFO ] Invariant cache hit.
[2024-05-21 07:12:33] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-21 07:12:33] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:12:34] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-05-21 07:12:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:12:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-21 07:12:34] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:12:34] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-21 07:12:34] [INFO ] Computed and/alt/rep : 225/322/225 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-21 07:12:35] [INFO ] Added : 215 causal constraints over 43 iterations in 1380 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 234 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Applied a total of 0 rules in 7 ms. Remains 234 /234 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-21 07:12:35] [INFO ] Invariant cache hit.
[2024-05-21 07:12:36] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 07:12:36] [INFO ] Invariant cache hit.
[2024-05-21 07:12:36] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-21 07:12:36] [INFO ] Invariant cache hit.
[2024-05-21 07:12:36] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 234/234 places, 226/226 transitions.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 107 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=107 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-21 07:12:37] [INFO ] Invariant cache hit.
[2024-05-21 07:12:37] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-21 07:12:37] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:12:37] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-21 07:12:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:12:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-21 07:12:38] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 07:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:12:38] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-21 07:12:38] [INFO ] Computed and/alt/rep : 225/322/225 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 07:12:39] [INFO ] Added : 215 causal constraints over 43 iterations in 1038 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 913 reset in 228 ms.
Product exploration explored 100000 steps with 908 reset in 263 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 234 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 78 place count 234 transition count 222
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 78 place count 234 transition count 222
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 113 place count 234 transition count 222
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 175 place count 172 transition count 160
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 237 place count 172 transition count 160
Performed 52 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 172 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 290 place count 172 transition count 155
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 320 place count 142 transition count 125
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 30 rules applied. Total rules applied 350 place count 142 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 351 place count 142 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 352 place count 141 transition count 124
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 353 place count 141 transition count 124
Deduced a syphon composed of 70 places in 1 ms
Applied a total of 353 rules in 68 ms. Remains 141 /234 variables (removed 93) and now considering 124/226 (removed 102) transitions.
[2024-05-21 07:12:40] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 124 rows 141 cols
[2024-05-21 07:12:40] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 07:12:40] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/234 places, 124/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 141/234 places, 124/226 transitions.
Built C files in :
/tmp/ltsmin9140254537451786599
[2024-05-21 07:12:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9140254537451786599
Running compilation step : cd /tmp/ltsmin9140254537451786599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 743 ms.
Running link step : cd /tmp/ltsmin9140254537451786599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9140254537451786599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11688406576428398193.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 225
Applied a total of 2 rules in 9 ms. Remains 233 /234 variables (removed 1) and now considering 225/226 (removed 1) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 07:12:55] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 07:12:55] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 07:12:55] [INFO ] Invariant cache hit.
[2024-05-21 07:12:56] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-21 07:12:56] [INFO ] Invariant cache hit.
[2024-05-21 07:12:56] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 225/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 233/234 places, 225/226 transitions.
Built C files in :
/tmp/ltsmin4452587565203355105
[2024-05-21 07:12:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4452587565203355105
Running compilation step : cd /tmp/ltsmin4452587565203355105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 755 ms.
Running link step : cd /tmp/ltsmin4452587565203355105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4452587565203355105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13945451068851644525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:13:11] [INFO ] Flatten gal took : 18 ms
[2024-05-21 07:13:11] [INFO ] Flatten gal took : 16 ms
[2024-05-21 07:13:11] [INFO ] Time to serialize gal into /tmp/LTL15970754569602598678.gal : 6 ms
[2024-05-21 07:13:11] [INFO ] Time to serialize properties into /tmp/LTL9193432455066822970.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15970754569602598678.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14473433489177248670.hoa' '-atoms' '/tmp/LTL9193432455066822970.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9193432455066822970.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14473433489177248670.hoa
Detected timeout of ITS tools.
[2024-05-21 07:13:26] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:13:26] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:13:26] [INFO ] Time to serialize gal into /tmp/LTL10684206622065126050.gal : 4 ms
[2024-05-21 07:13:26] [INFO ] Time to serialize properties into /tmp/LTL7819481881073195990.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10684206622065126050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7819481881073195990.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G(("(p290!=1)")U("(p75==1)")))U(("(p112==1)")&&(G("(p290==1)"))))||(X(X(F("(p75==1)"))))))
Formula 0 simplified : (F(!"(p290!=1)" R !"(p75==1)") R (!"(p112==1)" | F!"(p290==1)")) & XXG!"(p75==1)"
Detected timeout of ITS tools.
[2024-05-21 07:13:41] [INFO ] Flatten gal took : 14 ms
[2024-05-21 07:13:41] [INFO ] Applying decomposition
[2024-05-21 07:13:41] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10641226010046585562.txt' '-o' '/tmp/graph10641226010046585562.bin' '-w' '/tmp/graph10641226010046585562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10641226010046585562.bin' '-l' '-1' '-v' '-w' '/tmp/graph10641226010046585562.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:13:41] [INFO ] Decomposing Gal with order
[2024-05-21 07:13:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:13:41] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-21 07:13:41] [INFO ] Flatten gal took : 73 ms
[2024-05-21 07:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-21 07:13:41] [INFO ] Time to serialize gal into /tmp/LTL2286490866270661957.gal : 8 ms
[2024-05-21 07:13:41] [INFO ] Time to serialize properties into /tmp/LTL2395025973753411469.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2286490866270661957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2395025973753411469.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((G(("(i19.i0.u96.p290!=1)")U("(i5.i1.u22.p75==1)")))U(("(i8.u32.p112==1)")&&(G("(i19.i0.u96.p290==1)"))))||(X(X(F("(i5.i1.u22.p75=...165
Formula 0 simplified : (F(!"(i19.i0.u96.p290!=1)" R !"(i5.i1.u22.p75==1)") R (!"(i8.u32.p112==1)" | F!"(i19.i0.u96.p290==1)")) & XXG!"(i5.i1.u22.p75==1)"
Reverse transition relation is NOT exact ! Due to transitions t79, t89, t92, t125, t132, t155, t174, t230, t231, t232, t234, i0.t107, i0.t104, i0.i2.t106, ...605
Computing Next relation with stutter on 120 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
578 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.82774,174180,1,0,421681,235,2868,329727,164,626,563153
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-03b-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-03b-LTLFireability-14 finished in 76893 ms.
All properties solved by simple procedures.
Total runtime 113197 ms.

BK_STOP 1716275629795

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-03b, 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 r043-smll-171620180000063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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