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-171620180000053.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-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180000053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 22:23 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 48K 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-02b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716275162732

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-02b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 07:06:05] [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:06:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:06:05] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-21 07:06:05] [INFO ] Transformed 206 places.
[2024-05-21 07:06:05] [INFO ] Transformed 204 transitions.
[2024-05-21 07:06:05] [INFO ] Found NUPN structural information;
[2024-05-21 07:06:05] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-02b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 204/204 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 185 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 185 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 185 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 178 transition count 173
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 178 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 176 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 176 transition count 171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 175 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 175 transition count 170
Applied a total of 65 rules in 115 ms. Remains 175 /206 variables (removed 31) and now considering 170/204 (removed 34) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-21 07:06:06] [INFO ] Computed 16 invariants in 15 ms
[2024-05-21 07:06:06] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-21 07:06:06] [INFO ] Invariant cache hit.
[2024-05-21 07:06:06] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-21 07:06:06] [INFO ] Invariant cache hit.
[2024-05-21 07:06:07] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 175/206 places, 170/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1179 ms. Remains : 175/206 places, 170/204 transitions.
Support contains 35 out of 175 places after structural reductions.
[2024-05-21 07:06:07] [INFO ] Flatten gal took : 79 ms
[2024-05-21 07:06:07] [INFO ] Flatten gal took : 31 ms
[2024-05-21 07:06:07] [INFO ] Input system was already deterministic with 170 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 692 ms. (steps per millisecond=14 ) properties (out of 34) seen :28
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-21 07:06:08] [INFO ] Invariant cache hit.
[2024-05-21 07:06:08] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-21 07:06:08] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:06:09] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-21 07:06:09] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 8 ms to minimize.
[2024-05-21 07:06:09] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2024-05-21 07:06:09] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-21 07:06:09] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 07:06:09] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-21 07:06:09] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2024-05-21 07:06:09] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-21 07:06:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 786 ms
[2024-05-21 07:06:09] [INFO ] After 958ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-21 07:06:09] [INFO ] After 1109ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-21 07:06:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-21 07:06:09] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 07:06:10] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 07:06:10] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-21 07:06:10] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 4 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 46 stabilizing places and 46 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' '!(F(p0))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 174 transition count 111
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 66 rules applied. Total rules applied 124 place count 116 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 112 transition count 103
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 128 place count 112 transition count 78
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 178 place count 87 transition count 78
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 184 place count 81 transition count 72
Iterating global reduction 3 with 6 rules applied. Total rules applied 190 place count 81 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 190 place count 81 transition count 69
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 196 place count 78 transition count 69
Performed 27 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 250 place count 51 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 50 transition count 38
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 255 place count 47 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 46 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 256 place count 46 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 260 place count 44 transition count 35
Applied a total of 260 rules in 68 ms. Remains 44 /175 variables (removed 131) and now considering 35/170 (removed 135) transitions.
// Phase 1: matrix 35 rows 44 cols
[2024-05-21 07:06:10] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 07:06:10] [INFO ] Implicit Places using invariants in 87 ms returned [17, 25, 33, 37, 43]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 90 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/175 places, 35/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 32
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 35 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 35 transition count 31
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 10 place count 34 transition count 30
Applied a total of 10 rules in 8 ms. Remains 34 /39 variables (removed 5) and now considering 30/35 (removed 5) transitions.
// Phase 1: matrix 30 rows 34 cols
[2024-05-21 07:06:10] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 07:06:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 07:06:10] [INFO ] Invariant cache hit.
[2024-05-21 07:06:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:06:10] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/175 places, 30/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 34/175 places, 30/170 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 245 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 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 11 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-00 finished in 632 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||(p1&&(G(p2)||(p3&&X(G(p4))))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 174 transition count 116
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 60 rules applied. Total rules applied 113 place count 121 transition count 109
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 120 place count 117 transition count 106
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 114 transition count 105
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 124 place count 114 transition count 81
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 172 place count 90 transition count 81
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 179 place count 83 transition count 74
Iterating global reduction 4 with 7 rules applied. Total rules applied 186 place count 83 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 186 place count 83 transition count 71
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 192 place count 80 transition count 71
Performed 25 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 242 place count 55 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 54 transition count 42
Applied a total of 243 rules in 28 ms. Remains 54 /175 variables (removed 121) and now considering 42/170 (removed 128) transitions.
// Phase 1: matrix 42 rows 54 cols
[2024-05-21 07:06:11] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 07:06:11] [INFO ] Implicit Places using invariants in 59 ms returned [23, 32, 40, 46, 53]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/175 places, 42/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 46 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 46 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 45 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 45 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 44 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 37
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 12 place count 43 transition count 36
Applied a total of 12 rules in 17 ms. Remains 43 /49 variables (removed 6) and now considering 36/42 (removed 6) transitions.
// Phase 1: matrix 36 rows 43 cols
[2024-05-21 07:06:11] [INFO ] Computed 11 invariants in 0 ms
[2024-05-21 07:06:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 07:06:11] [INFO ] Invariant cache hit.
[2024-05-21 07:06:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 07:06:11] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 131 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/175 places, 36/170 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 42 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 35
Applied a total of 2 rules in 4 ms. Remains 41 /42 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 41 cols
[2024-05-21 07:06:11] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 07:06:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 07:06:11] [INFO ] Invariant cache hit.
[2024-05-21 07:06:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:06:11] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 41/175 places, 35/170 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 351 ms. Remains : 41/175 places, 35/170 transitions.
Stuttering acceptance computed with spot in 484 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p4))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={1} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) p3 (NOT p4)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3) (NOT p4)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2 p4), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2 p3 (NOT p4)), acceptance={1} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={1} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p4), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) p3 (NOT p4)), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4))), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p4), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2 p3 (NOT p4)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s19 1), p1:(EQ s24 1), p2:(EQ s12 0), p3:(EQ s12 1), p4:(EQ s24 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 35730 reset in 657 ms.
Product exploration explored 100000 steps with 35694 reset in 296 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3) p4), (X (NOT (AND (NOT p0) p1 p2 p4))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) (NOT p2) p4))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4))))), (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p2) p4)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4)))))), (X (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (X (AND (NOT p0) p2 p4)), (X (NOT (AND (NOT p0) p2 p4))), (X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4))))), (X (X (AND (NOT p0) p2 p4))), (X (X (NOT (AND (NOT p0) p2 p4)))), (X (X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))))]
Knowledge based reduction with 25 factoid took 1426 ms. Reduced automaton from 4 states, 20 edges and 5 AP (stutter insensitive) to 4 states, 20 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p4))]
Incomplete random walk after 10000 steps, including 641 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 07:06:15] [INFO ] Invariant cache hit.
[2024-05-21 07:06:15] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2024-05-21 07:06:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 07:06:15] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3) p4), (X (NOT (AND (NOT p0) p1 p2 p4))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) (NOT p2) p4))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4))))), (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p2) p4)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4)))))), (X (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (G (NOT (AND (NOT p0) p1 p2 p4))), (G (NOT (AND (NOT p0) p1 p2 (NOT p4) p3))), (G (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (G (NOT (AND (NOT p0) p1 p2 p3))), (G (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (X (AND (NOT p0) p2 p4)), (X (NOT (AND (NOT p0) p2 p4))), (X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4))))), (X (X (AND (NOT p0) p2 p4))), (X (X (NOT (AND (NOT p0) p2 p4)))), (X (X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))))), (F (AND (NOT p0) p1 p2 (NOT p4) (NOT p3))), (F (NOT (AND (NOT p0) p2 p4))), (F (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p4) (NOT p3)))), (F (AND (NOT p0) (NOT p2) p4)), (F (AND (NOT p0) p1 (NOT p2) (NOT p4) p3)), (F (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (F (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))]
Knowledge based reduction with 30 factoid took 2967 ms. Reduced automaton from 4 states, 20 edges and 5 AP (stutter insensitive) to 3 states, 13 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
[2024-05-21 07:06:19] [INFO ] Invariant cache hit.
[2024-05-21 07:06:19] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 07:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:06:19] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-21 07:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:06:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 07:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:06:19] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 07:06:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:06:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-21 07:06:19] [INFO ] Computed and/alt/rep : 30/71/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 07:06:19] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3) p4)
[2024-05-21 07:06:19] [INFO ] Invariant cache hit.
[2024-05-21 07:06:19] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 07:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:06:19] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-21 07:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:06:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 07:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:06:19] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 07:06:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:06:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2024-05-21 07:06:19] [INFO ] Computed and/alt/rep : 30/71/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 07:06:19] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-21 07:06:19] [INFO ] Invariant cache hit.
[2024-05-21 07:06:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 07:06:19] [INFO ] Invariant cache hit.
[2024-05-21 07:06:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:06:19] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-21 07:06:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 07:06:19] [INFO ] Invariant cache hit.
[2024-05-21 07:06:19] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 41/41 places, 35/35 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3) p4), (X (NOT (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p4) p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p4) p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))))]
False Knowledge obtained : [(X (AND (NOT p0) p4)), (X (NOT (AND (NOT p0) p4))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p3))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) p4))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p3)))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 15 factoid took 925 ms. Reduced automaton from 3 states, 13 edges and 5 AP (stutter insensitive) to 3 states, 13 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 644 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 07:06:21] [INFO ] Invariant cache hit.
[2024-05-21 07:06:21] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 07:06:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 07:06:21] [INFO ] After 44ms 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 (NOT p0) (NOT p1) p2 (NOT p3) p4), (X (NOT (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p4) p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p4) p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))), (G (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p4)), (X (NOT (AND (NOT p0) p4))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p3))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) p4))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p3)))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) p3 (NOT p4))), (F (NOT (AND (NOT p0) p4))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p2 (NOT p3) (NOT p4) p1)), (F (AND (NOT p0) p3 p1)), (F (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p3) (NOT p4))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 1798 ms. Reduced automaton from 3 states, 13 edges and 5 AP (stutter insensitive) to 3 states, 13 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
[2024-05-21 07:06:23] [INFO ] Invariant cache hit.
[2024-05-21 07:06:23] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 07:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:06:23] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 07:06:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:06:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 07:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:06:23] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-21 07:06:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:06:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-21 07:06:23] [INFO ] Computed and/alt/rep : 30/71/30 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 07:06:23] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3) p4)
[2024-05-21 07:06:23] [INFO ] Invariant cache hit.
[2024-05-21 07:06:23] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 07:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:06:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 07:06:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:06:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 07:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:06:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-21 07:06:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:06:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-21 07:06:24] [INFO ] Computed and/alt/rep : 30/71/30 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-21 07:06:24] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 35687 reset in 358 ms.
Product exploration explored 100000 steps with 35700 reset in 372 ms.
Built C files in :
/tmp/ltsmin14267936820361634151
[2024-05-21 07:06:24] [INFO ] Computing symmetric may disable matrix : 35 transitions.
[2024-05-21 07:06:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:06:24] [INFO ] Computing symmetric may enable matrix : 35 transitions.
[2024-05-21 07:06:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:06:24] [INFO ] Computing Do-Not-Accords matrix : 35 transitions.
[2024-05-21 07:06:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:06:25] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14267936820361634151
Running compilation step : cd /tmp/ltsmin14267936820361634151;'/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 449 ms.
Running link step : cd /tmp/ltsmin14267936820361634151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin14267936820361634151;'/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/stateBased8241045920744221497.hoa' '--buchi-type=spotba'
LTSmin run took 155 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLFireability-01 finished in 14450 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)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 174 transition count 111
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 66 rules applied. Total rules applied 124 place count 116 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 112 transition count 103
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 128 place count 112 transition count 79
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 176 place count 88 transition count 79
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 182 place count 82 transition count 73
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 82 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 188 place count 82 transition count 70
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 194 place count 79 transition count 70
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 250 place count 51 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 50 transition count 38
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 255 place count 47 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 46 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 256 place count 46 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 260 place count 44 transition count 35
Applied a total of 260 rules in 38 ms. Remains 44 /175 variables (removed 131) and now considering 35/170 (removed 135) transitions.
// Phase 1: matrix 35 rows 44 cols
[2024-05-21 07:06:25] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 07:06:25] [INFO ] Implicit Places using invariants in 96 ms returned [17, 25, 33, 37, 43]
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 : 39/175 places, 35/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 32
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 32
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 8 place count 35 transition count 31
Applied a total of 8 rules in 5 ms. Remains 35 /39 variables (removed 4) and now considering 31/35 (removed 4) transitions.
// Phase 1: matrix 31 rows 35 cols
[2024-05-21 07:06:25] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 07:06:25] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 07:06:25] [INFO ] Invariant cache hit.
[2024-05-21 07:06:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:06:26] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/175 places, 31/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 35/175 places, 31/170 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8808 reset in 289 ms.
Stack based approach found an accepted trace after 85885 steps with 7569 reset with depth 20 and stack size 20 in 291 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-02 finished in 975 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)||(p1&&X(F(p0))&&G(p2)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 168 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 168 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 168 transition count 162
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 166 transition count 160
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 166 transition count 160
Applied a total of 19 rules in 8 ms. Remains 166 /175 variables (removed 9) and now considering 160/170 (removed 10) transitions.
// Phase 1: matrix 160 rows 166 cols
[2024-05-21 07:06:26] [INFO ] Computed 16 invariants in 3 ms
[2024-05-21 07:06:26] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 07:06:26] [INFO ] Invariant cache hit.
[2024-05-21 07:06:26] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-21 07:06:26] [INFO ] Invariant cache hit.
[2024-05-21 07:06:27] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/175 places, 160/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 166/175 places, 160/170 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s64 1), p1:(OR (EQ s64 1) (EQ s40 1)), p2:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-03 finished in 835 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(p1)||(!p1 U (G(!p1)||(!p1&&G(p2))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 161
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 164 transition count 158
Applied a total of 23 rules in 6 ms. Remains 164 /175 variables (removed 11) and now considering 158/170 (removed 12) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-21 07:06:27] [INFO ] Computed 16 invariants in 2 ms
[2024-05-21 07:06:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 07:06:27] [INFO ] Invariant cache hit.
[2024-05-21 07:06:27] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-21 07:06:27] [INFO ] Invariant cache hit.
[2024-05-21 07:06:27] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/175 places, 158/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 164/175 places, 158/170 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), false, false, (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(EQ s33 1), p1:(EQ s75 1), p2:(NEQ s137 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1145 reset in 174 ms.
Product exploration explored 100000 steps with 1136 reset in 199 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/164 stabilizing places and 42/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 314 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 451 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false]
Finished random walk after 7404 steps, including 64 resets, run visited all 13 properties in 51 ms. (steps per millisecond=145 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2)), (F (NOT (OR p0 (AND (NOT p1) p2)))), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p2))), (F (AND p0 (NOT p1) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 11 factoid took 1193 ms. Reduced automaton from 9 states, 26 edges and 3 AP (stutter insensitive) to 9 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 403 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 473 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 158/158 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 163 transition count 108
Reduce places removed 49 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 55 rules applied. Total rules applied 104 place count 114 transition count 102
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 110 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 109 transition count 101
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 110 place count 109 transition count 78
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 156 place count 86 transition count 78
Performed 33 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 222 place count 53 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 223 place count 52 transition count 40
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 227 place count 49 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 48 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 228 place count 48 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 46 transition count 37
Applied a total of 232 rules in 21 ms. Remains 46 /164 variables (removed 118) and now considering 37/158 (removed 121) transitions.
// Phase 1: matrix 37 rows 46 cols
[2024-05-21 07:06:31] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 07:06:31] [INFO ] Implicit Places using invariants in 82 ms returned [17, 25, 39, 45]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/164 places, 37/158 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 40 transition count 35
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 39 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 39 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 38 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 38 transition count 33
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 12 place count 36 transition count 31
Applied a total of 12 rules in 5 ms. Remains 36 /42 variables (removed 6) and now considering 31/37 (removed 6) transitions.
// Phase 1: matrix 31 rows 36 cols
[2024-05-21 07:06:31] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 07:06:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 07:06:31] [INFO ] Invariant cache hit.
[2024-05-21 07:06:31] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/164 places, 31/158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 36/164 places, 31/158 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/36 stabilizing places and 2/31 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 2484 ms. Reduced automaton from 9 states, 26 edges and 3 AP (stutter insensitive) to 9 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 478 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false]
Finished random walk after 1574 steps, including 99 resets, run visited all 13 properties in 10 ms. (steps per millisecond=157 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND p2 p0 p1)), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p2 (NOT p0) p1)), (F (NOT (OR (AND p2 (NOT p1)) p0))), (F (AND (NOT p2) p0 p1)), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) p0 (NOT p1))), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 3763 ms. Reduced automaton from 9 states, 26 edges and 3 AP (stutter insensitive) to 9 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 460 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 428 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 437 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 14856 reset in 305 ms.
Product exploration explored 100000 steps with 14923 reset in 272 ms.
Built C files in :
/tmp/ltsmin14874810609644692012
[2024-05-21 07:06:40] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2024-05-21 07:06:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:06:40] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2024-05-21 07:06:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:06:40] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2024-05-21 07:06:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:06:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14874810609644692012
Running compilation step : cd /tmp/ltsmin14874810609644692012;'/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 217 ms.
Running link step : cd /tmp/ltsmin14874810609644692012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14874810609644692012;'/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/stateBased10470041352828390634.hoa' '--buchi-type=spotba'
LTSmin run took 272 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLFireability-05 finished in 13459 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&&F((!p1&&X(X(G(p2))))))||G((F(!p1)&&F(G(p2)))))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 165 transition count 160
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 165 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 165 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 162 transition count 156
Applied a total of 27 rules in 11 ms. Remains 162 /175 variables (removed 13) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 162 cols
[2024-05-21 07:06:41] [INFO ] Computed 16 invariants in 2 ms
[2024-05-21 07:06:41] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 07:06:41] [INFO ] Invariant cache hit.
[2024-05-21 07:06:41] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-21 07:06:41] [INFO ] Invariant cache hit.
[2024-05-21 07:06:41] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/175 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 162/175 places, 156/170 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p2) p1), (NOT p2), (NOT p2), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s108 1), p2:(NEQ s138 1), p1:(AND (EQ s83 1) (EQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 880 reset in 216 ms.
Product exploration explored 100000 steps with 880 reset in 233 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/162 stabilizing places and 40/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 p0))), (X p2), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0)))), (X (X p2)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 679 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 5470 steps, including 48 resets, run visited all 4 properties in 33 ms. (steps per millisecond=165 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 p0))), (X p2), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0)))), (X (X p2)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT p2)), (F (AND p1 (NOT p2))), (F p1)]
Knowledge based reduction with 15 factoid took 1776 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 162 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-21 07:06:45] [INFO ] Invariant cache hit.
[2024-05-21 07:06:45] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 07:06:45] [INFO ] Invariant cache hit.
[2024-05-21 07:06:46] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-21 07:06:46] [INFO ] Invariant cache hit.
[2024-05-21 07:06:46] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 162/162 places, 156/156 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/162 stabilizing places and 40/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 201 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 402 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 413 steps, including 3 resets, run visited all 4 properties in 4 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT p2)), (F (AND p1 (NOT p2))), (F p1)]
Knowledge based reduction with 8 factoid took 290 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 880 reset in 204 ms.
Product exploration explored 100000 steps with 883 reset in 240 ms.
Applying partial POR strategy [false, true, false, true, false, false]
Stuttering acceptance computed with spot in 310 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 156/156 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 162 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 162 transition count 154
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 162 transition count 154
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 162 transition count 154
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 111 place count 125 transition count 117
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 148 place count 125 transition count 117
Performed 38 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 186 place count 125 transition count 113
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 209 place count 102 transition count 90
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 232 place count 102 transition count 90
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 232 rules in 47 ms. Remains 102 /162 variables (removed 60) and now considering 90/156 (removed 66) transitions.
[2024-05-21 07:06:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 90 rows 102 cols
[2024-05-21 07:06:49] [INFO ] Computed 16 invariants in 3 ms
[2024-05-21 07:06:49] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/162 places, 90/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 102/162 places, 90/156 transitions.
Built C files in :
/tmp/ltsmin16905871662382746966
[2024-05-21 07:06:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16905871662382746966
Running compilation step : cd /tmp/ltsmin16905871662382746966;'/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 549 ms.
Running link step : cd /tmp/ltsmin16905871662382746966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16905871662382746966;'/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/stateBased14400374734745564945.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 162 cols
[2024-05-21 07:07:04] [INFO ] Computed 16 invariants in 2 ms
[2024-05-21 07:07:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 07:07:04] [INFO ] Invariant cache hit.
[2024-05-21 07:07:04] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-21 07:07:04] [INFO ] Invariant cache hit.
[2024-05-21 07:07:04] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 162/162 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin3749417135040437860
[2024-05-21 07:07:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3749417135040437860
Running compilation step : cd /tmp/ltsmin3749417135040437860;'/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 431 ms.
Running link step : cd /tmp/ltsmin3749417135040437860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3749417135040437860;'/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/stateBased15412102154049812604.hoa' '--buchi-type=spotba'
LTSmin run took 7242 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLFireability-06 finished in 31640 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&&F(p1)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 165 transition count 160
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 165 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 165 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 162 transition count 156
Applied a total of 27 rules in 8 ms. Remains 162 /175 variables (removed 13) and now considering 156/170 (removed 14) transitions.
[2024-05-21 07:07:12] [INFO ] Invariant cache hit.
[2024-05-21 07:07:12] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 07:07:12] [INFO ] Invariant cache hit.
[2024-05-21 07:07:12] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-21 07:07:12] [INFO ] Invariant cache hit.
[2024-05-21 07:07:13] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/175 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 162/175 places, 156/170 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s40 1) (EQ s146 1)), p0:(EQ s39 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 114 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-07 finished in 641 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)||F((p0&&X(p1)))) U p2))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 161
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 164 transition count 158
Applied a total of 23 rules in 10 ms. Remains 164 /175 variables (removed 11) and now considering 158/170 (removed 12) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-21 07:07:13] [INFO ] Computed 16 invariants in 2 ms
[2024-05-21 07:07:13] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 07:07:13] [INFO ] Invariant cache hit.
[2024-05-21 07:07:13] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-21 07:07:13] [INFO ] Invariant cache hit.
[2024-05-21 07:07:13] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/175 places, 158/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 164/175 places, 158/170 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s127 1), p0:(EQ s33 1), p1:(OR (EQ s119 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-09 finished in 766 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' '!(((p0||G(F(p1))) U p2))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 174 transition count 113
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 64 rules applied. Total rules applied 120 place count 118 transition count 105
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 114 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 113 transition count 104
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 126 place count 113 transition count 81
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 172 place count 90 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 86 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 86 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 180 place count 86 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 84 transition count 75
Performed 27 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 238 place count 57 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 57 transition count 45
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 4 with 2 rules applied. Total rules applied 241 place count 56 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 55 transition count 43
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 246 place count 52 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 247 place count 51 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 247 place count 51 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 251 place count 49 transition count 40
Applied a total of 251 rules in 33 ms. Remains 49 /175 variables (removed 126) and now considering 40/170 (removed 130) transitions.
// Phase 1: matrix 40 rows 49 cols
[2024-05-21 07:07:14] [INFO ] Computed 13 invariants in 2 ms
[2024-05-21 07:07:14] [INFO ] Implicit Places using invariants in 86 ms returned [20, 28, 42, 48]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 88 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/175 places, 40/170 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 43 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 43 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 42 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 42 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 41 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 41 transition count 36
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 12 place count 39 transition count 34
Applied a total of 12 rules in 9 ms. Remains 39 /45 variables (removed 6) and now considering 34/40 (removed 6) transitions.
// Phase 1: matrix 34 rows 39 cols
[2024-05-21 07:07:14] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 07:07:14] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 07:07:14] [INFO ] Invariant cache hit.
[2024-05-21 07:07:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:07:14] [INFO ] Implicit Places using invariants and state equation in 78 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 : 39/175 places, 34/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 39/175 places, 34/170 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s34 1), p0:(NEQ s3 1), p1:(NEQ s7 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 15786 reset in 248 ms.
Product exploration explored 100000 steps with 15779 reset in 248 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/39 stabilizing places and 5/34 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p2)), (X p2), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 1022 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 152 ms :[(NOT p2), (NOT p1), (NOT p1)]
Finished random walk after 70 steps, including 4 resets, run visited all 4 properties in 5 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p2)), (X p2), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2)), (F (NOT p1)), (F p2), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 1488 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 223 ms :[(NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p1), (NOT p1)]
[2024-05-21 07:07:18] [INFO ] Invariant cache hit.
[2024-05-21 07:07:18] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 07:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:07:18] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 07:07:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:07:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-21 07:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:07:18] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-21 07:07:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:07:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-21 07:07:18] [INFO ] Computed and/alt/rep : 25/51/25 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 07:07:18] [INFO ] Added : 20 causal constraints over 4 iterations in 52 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 34/34 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-21 07:07:18] [INFO ] Invariant cache hit.
[2024-05-21 07:07:18] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 07:07:18] [INFO ] Invariant cache hit.
[2024-05-21 07:07:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:07:18] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-21 07:07:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 07:07:18] [INFO ] Invariant cache hit.
[2024-05-21 07:07:18] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 39/39 places, 34/34 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/39 stabilizing places and 5/34 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p2)), (X p2), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 779 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 143 ms :[(NOT p2), (NOT p1), (NOT p1)]
Finished random walk after 63 steps, including 3 resets, run visited all 4 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p2)), (X p2), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2)), (F (NOT p1)), (F p2), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 1492 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 156 ms :[(NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p1), (NOT p1)]
[2024-05-21 07:07:21] [INFO ] Invariant cache hit.
[2024-05-21 07:07:21] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 07:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:07:21] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-21 07:07:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:07:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 07:07:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:07:21] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 07:07:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:07:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2024-05-21 07:07:21] [INFO ] Computed and/alt/rep : 25/51/25 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 07:07:21] [INFO ] Added : 20 causal constraints over 4 iterations in 47 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 15878 reset in 228 ms.
Product exploration explored 100000 steps with 15912 reset in 246 ms.
Built C files in :
/tmp/ltsmin6828237150928143797
[2024-05-21 07:07:22] [INFO ] Computing symmetric may disable matrix : 34 transitions.
[2024-05-21 07:07:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:07:22] [INFO ] Computing symmetric may enable matrix : 34 transitions.
[2024-05-21 07:07:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:07:22] [INFO ] Computing Do-Not-Accords matrix : 34 transitions.
[2024-05-21 07:07:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:07:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6828237150928143797
Running compilation step : cd /tmp/ltsmin6828237150928143797;'/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 219 ms.
Running link step : cd /tmp/ltsmin6828237150928143797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6828237150928143797;'/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/stateBased1197635983001536304.hoa' '--buchi-type=spotba'
LTSmin run took 83 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLFireability-10 finished in 8438 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 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 174 transition count 113
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 64 rules applied. Total rules applied 120 place count 118 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 114 transition count 105
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 124 place count 114 transition count 80
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 174 place count 89 transition count 80
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 181 place count 82 transition count 73
Iterating global reduction 3 with 7 rules applied. Total rules applied 188 place count 82 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 188 place count 82 transition count 70
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 194 place count 79 transition count 70
Performed 27 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 248 place count 52 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 51 transition count 39
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 253 place count 48 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 254 place count 47 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 254 place count 47 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 258 place count 45 transition count 36
Applied a total of 258 rules in 22 ms. Remains 45 /175 variables (removed 130) and now considering 36/170 (removed 134) transitions.
// Phase 1: matrix 36 rows 45 cols
[2024-05-21 07:07:22] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 07:07:22] [INFO ] Implicit Places using invariants in 81 ms returned [16, 26, 34, 38, 44]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 93 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/175 places, 36/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 33
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 33
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 36 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 36 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 35 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 35 transition count 31
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 12 place count 34 transition count 30
Applied a total of 12 rules in 6 ms. Remains 34 /40 variables (removed 6) and now considering 30/36 (removed 6) transitions.
// Phase 1: matrix 30 rows 34 cols
[2024-05-21 07:07:22] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 07:07:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 07:07:22] [INFO ] Invariant cache hit.
[2024-05-21 07:07:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:07:22] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/175 places, 30/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 34/175 places, 30/170 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-11 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:(EQ s18 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 8 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-11 finished in 439 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||F(p1)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 174 transition count 115
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 61 rules applied. Total rules applied 115 place count 120 transition count 108
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 116 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 115 transition count 107
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 121 place count 115 transition count 82
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 171 place count 90 transition count 82
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 178 place count 83 transition count 75
Iterating global reduction 4 with 7 rules applied. Total rules applied 185 place count 83 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 185 place count 83 transition count 72
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 191 place count 80 transition count 72
Performed 27 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 245 place count 53 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 52 transition count 41
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 250 place count 49 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 48 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 251 place count 48 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 255 place count 46 transition count 38
Applied a total of 255 rules in 29 ms. Remains 46 /175 variables (removed 129) and now considering 38/170 (removed 132) transitions.
// Phase 1: matrix 38 rows 46 cols
[2024-05-21 07:07:22] [INFO ] Computed 13 invariants in 0 ms
[2024-05-21 07:07:23] [INFO ] Implicit Places using invariants in 69 ms returned [17, 27, 35, 39, 45]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 74 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/175 places, 38/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 38 transition count 35
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 38 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 37 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 37 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 33
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 12 place count 35 transition count 32
Applied a total of 12 rules in 8 ms. Remains 35 /41 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 35 cols
[2024-05-21 07:07:23] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 07:07:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 07:07:23] [INFO ] Invariant cache hit.
[2024-05-21 07:07:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:07:23] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/175 places, 32/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 35/175 places, 32/170 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), 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 s19 1), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-12 finished in 362 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)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 165 transition count 160
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 165 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 165 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 162 transition count 156
Applied a total of 27 rules in 11 ms. Remains 162 /175 variables (removed 13) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 162 cols
[2024-05-21 07:07:23] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 07:07:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 07:07:23] [INFO ] Invariant cache hit.
[2024-05-21 07:07:23] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-21 07:07:23] [INFO ] Invariant cache hit.
[2024-05-21 07:07:23] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/175 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 162/175 places, 156/170 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 183 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-13 finished in 429 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(p0)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 165 transition count 160
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 165 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 165 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 162 transition count 156
Applied a total of 27 rules in 12 ms. Remains 162 /175 variables (removed 13) and now considering 156/170 (removed 14) transitions.
[2024-05-21 07:07:23] [INFO ] Invariant cache hit.
[2024-05-21 07:07:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 07:07:23] [INFO ] Invariant cache hit.
[2024-05-21 07:07:23] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-21 07:07:23] [INFO ] Invariant cache hit.
[2024-05-21 07:07:24] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/175 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 162/175 places, 156/170 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s154 1), p1:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-14 finished in 551 ms.
All properties solved by simple procedures.
Total runtime 78690 ms.

BK_STOP 1716275245499

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

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