Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678348269641

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:51:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 07:51:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:51:12] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-09 07:51:12] [INFO ] Transformed 298 places.
[2023-03-09 07:51:12] [INFO ] Transformed 296 transitions.
[2023-03-09 07:51:12] [INFO ] Found NUPN structural information;
[2023-03-09 07:51:12] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-03b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 264 transition count 262
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 264 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 73 place count 264 transition count 257
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 253 transition count 246
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 253 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 252 transition count 245
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 252 transition count 245
Applied a total of 97 rules in 80 ms. Remains 252 /298 variables (removed 46) and now considering 245/296 (removed 51) transitions.
// Phase 1: matrix 245 rows 252 cols
[2023-03-09 07:51:13] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-09 07:51:13] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-09 07:51:13] [INFO ] Invariant cache hit.
[2023-03-09 07:51:13] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-03-09 07:51:13] [INFO ] Invariant cache hit.
[2023-03-09 07:51:14] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/298 places, 245/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 252/298 places, 245/296 transitions.
Support contains 33 out of 252 places after structural reductions.
[2023-03-09 07:51:14] [INFO ] Flatten gal took : 56 ms
[2023-03-09 07:51:14] [INFO ] Flatten gal took : 16 ms
[2023-03-09 07:51:14] [INFO ] Input system was already deterministic with 245 transitions.
Support contains 30 out of 252 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 28) seen :23
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 07:51:14] [INFO ] Invariant cache hit.
[2023-03-09 07:51:14] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-09 07:51:14] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:51:15] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-09 07:51:15] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 17 ms to minimize.
[2023-03-09 07:51:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-09 07:51:15] [INFO ] After 319ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 07:51:15] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 07:51:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-09 07:51:15] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 07:51:15] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 07:51:15] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2023-03-09 07:51:15] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2023-03-09 07:51:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-03-09 07:51:15] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 0 ms to minimize.
[2023-03-09 07:51:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 07:51:16] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 8 ms to minimize.
[2023-03-09 07:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-09 07:51:16] [INFO ] After 666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-09 07:51:16] [INFO ] After 903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 29 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 245/245 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 252 transition count 157
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 98 rules applied. Total rules applied 186 place count 164 transition count 147
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 192 place count 158 transition count 147
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 192 place count 158 transition count 115
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 256 place count 126 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 260 place count 122 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 122 transition count 111
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 264 place count 122 transition count 108
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 270 place count 119 transition count 108
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 360 place count 74 transition count 57
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 372 place count 74 transition count 45
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 384 place count 62 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 385 place count 61 transition count 44
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 25 rules applied. Total rules applied 410 place count 49 transition count 31
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 423 place count 36 transition count 31
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 423 place count 36 transition count 23
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 439 place count 28 transition count 23
Applied a total of 439 rules in 43 ms. Remains 28 /252 variables (removed 224) and now considering 23/245 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 28/252 places, 23/245 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=18 )
Computed a total of 69 stabilizing places and 69 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((G(p0)&&p1)) U ((!X(p2) U p0)&&p3)))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 244 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 244 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 239 transition count 231
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 239 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 238 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 238 transition count 230
Applied a total of 29 rules in 15 ms. Remains 238 /252 variables (removed 14) and now considering 230/245 (removed 15) transitions.
// Phase 1: matrix 230 rows 238 cols
[2023-03-09 07:51:16] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-09 07:51:16] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 07:51:16] [INFO ] Invariant cache hit.
[2023-03-09 07:51:17] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-09 07:51:17] [INFO ] Invariant cache hit.
[2023-03-09 07:51:17] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/252 places, 230/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 238/252 places, 230/245 transitions.
Stuttering acceptance computed with spot in 505 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) p2)), true, (NOT p0), (OR (NOT p0) p2)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p0 p1), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND p3 p0 p1), acceptance={0} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=3 dest: 4}, { cond=(AND p3 p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=p2, acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s134 1), p0:(EQ s37 1), p1:(EQ s10 1), p2:(EQ s65 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 3 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-01 finished in 1084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 242 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 242 transition count 235
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 242 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 236 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 233 transition count 225
Applied a total of 39 rules in 19 ms. Remains 233 /252 variables (removed 19) and now considering 225/245 (removed 20) transitions.
// Phase 1: matrix 225 rows 233 cols
[2023-03-09 07:51:17] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-09 07:51:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 07:51:17] [INFO ] Invariant cache hit.
[2023-03-09 07:51:18] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-09 07:51:18] [INFO ] Invariant cache hit.
[2023-03-09 07:51:18] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/252 places, 225/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 233/252 places, 225/245 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s27 1) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-02 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 251 transition count 161
Reduce places removed 83 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 90 rules applied. Total rules applied 173 place count 168 transition count 154
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 179 place count 164 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 162 transition count 152
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 181 place count 162 transition count 118
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 249 place count 128 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 253 place count 124 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 124 transition count 114
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 257 place count 124 transition count 111
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 263 place count 121 transition count 111
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 353 place count 76 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 354 place count 75 transition count 59
Reduce places removed 4 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 5 rules applied. Total rules applied 359 place count 71 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 360 place count 70 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 360 place count 70 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 366 place count 67 transition count 55
Applied a total of 366 rules in 61 ms. Remains 67 /252 variables (removed 185) and now considering 55/245 (removed 190) transitions.
// Phase 1: matrix 55 rows 67 cols
[2023-03-09 07:51:18] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-09 07:51:18] [INFO ] Implicit Places using invariants in 82 ms returned [27, 38, 55, 60, 66]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 84 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/252 places, 55/245 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 57 transition count 50
Applied a total of 10 rules in 18 ms. Remains 57 /62 variables (removed 5) and now considering 50/55 (removed 5) transitions.
// Phase 1: matrix 50 rows 57 cols
[2023-03-09 07:51:18] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-09 07:51:18] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 07:51:18] [INFO ] Invariant cache hit.
[2023-03-09 07:51:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 07:51:19] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/252 places, 50/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 459 ms. Remains : 57/252 places, 50/245 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s49 0)), p1:(EQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5154 reset in 253 ms.
Product exploration explored 100000 steps with 5151 reset in 225 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 521 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13995 steps, run visited all 1 properties in 38 ms. (steps per millisecond=368 )
Probabilistic random walk after 13995 steps, saw 3129 distinct states, run finished after 38 ms. (steps per millisecond=368 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1)]
Support contains 1 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-09 07:51:20] [INFO ] Invariant cache hit.
[2023-03-09 07:51:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 07:51:20] [INFO ] Invariant cache hit.
[2023-03-09 07:51:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 07:51:20] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-09 07:51:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 07:51:20] [INFO ] Invariant cache hit.
[2023-03-09 07:51:20] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 57/57 places, 50/50 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 512 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13995 steps, run visited all 1 properties in 70 ms. (steps per millisecond=199 )
Probabilistic random walk after 13995 steps, saw 3129 distinct states, run finished after 70 ms. (steps per millisecond=199 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5174 reset in 127 ms.
Product exploration explored 100000 steps with 5145 reset in 154 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 50/50 transitions.
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 48
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 55 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 55 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 53 transition count 46
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 53 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 52 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9 place count 51 transition count 44
Applied a total of 9 rules in 5 ms. Remains 51 /57 variables (removed 6) and now considering 44/50 (removed 6) transitions.
// Phase 1: matrix 44 rows 51 cols
[2023-03-09 07:51:22] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 07:51:22] [INFO ] Implicit Places using invariants in 166 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/57 places, 44/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 50/57 places, 44/50 transitions.
Treatment of property AutoFlight-PT-03b-LTLFireability-05 finished in 3723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G((G(p0) U p1)))&&(p2||F(p3))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 244 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 244 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 239 transition count 231
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 236 transition count 228
Applied a total of 33 rules in 28 ms. Remains 236 /252 variables (removed 16) and now considering 228/245 (removed 17) transitions.
// Phase 1: matrix 228 rows 236 cols
[2023-03-09 07:51:22] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-09 07:51:22] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 07:51:22] [INFO ] Invariant cache hit.
[2023-03-09 07:51:22] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-09 07:51:22] [INFO ] Invariant cache hit.
[2023-03-09 07:51:22] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/252 places, 228/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 236/252 places, 228/245 transitions.
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=(OR p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s114 0), p3:(EQ s142 0), p1:(EQ s114 1), p0:(EQ s105 1)], nbAcceptance=2, 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]]
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-06 finished in 1034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(p1&&X((p1 U (X(p2)||G(p1)))))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 237 transition count 230
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 237 transition count 230
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 235 transition count 228
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 235 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 234 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 234 transition count 227
Applied a total of 36 rules in 64 ms. Remains 234 /252 variables (removed 18) and now considering 227/245 (removed 18) transitions.
// Phase 1: matrix 227 rows 234 cols
[2023-03-09 07:51:23] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-09 07:51:23] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 07:51:23] [INFO ] Invariant cache hit.
[2023-03-09 07:51:23] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-09 07:51:23] [INFO ] Invariant cache hit.
[2023-03-09 07:51:23] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/252 places, 227/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 234/252 places, 227/245 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s21 0), p1:(NEQ s196 1), p2:(EQ s214 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 657 reset in 237 ms.
Product exploration explored 100000 steps with 656 reset in 283 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/234 stabilizing places and 57/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 641 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 525 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 6) seen :4
Finished Best-First random walk after 1296 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=324 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 732 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 633 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 563 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 233 transition count 151
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 84 rules applied. Total rules applied 159 place count 158 transition count 142
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 152 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 150 transition count 140
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 169 place count 150 transition count 108
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 233 place count 118 transition count 108
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 319 place count 75 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 74 transition count 58
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 329 place count 68 transition count 55
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 332 place count 65 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 332 place count 65 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 338 place count 62 transition count 52
Applied a total of 338 rules in 41 ms. Remains 62 /234 variables (removed 172) and now considering 52/227 (removed 175) transitions.
// Phase 1: matrix 52 rows 62 cols
[2023-03-09 07:51:28] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-09 07:51:28] [INFO ] Implicit Places using invariants in 129 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/234 places, 52/227 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 56 transition count 47
Applied a total of 10 rules in 3 ms. Remains 56 /61 variables (removed 5) and now considering 47/52 (removed 5) transitions.
// Phase 1: matrix 47 rows 56 cols
[2023-03-09 07:51:28] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 07:51:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 07:51:28] [INFO ] Invariant cache hit.
[2023-03-09 07:51:28] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/234 places, 47/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 340 ms. Remains : 56/234 places, 47/227 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/56 stabilizing places and 4/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 8 factoid took 834 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 579 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Finished random walk after 829 steps, including 39 resets, run visited all 6 properties in 4 ms. (steps per millisecond=207 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 1227 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 676 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 597 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 559 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 5087 reset in 153 ms.
Product exploration explored 100000 steps with 5069 reset in 223 ms.
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-09 07:51:33] [INFO ] Invariant cache hit.
[2023-03-09 07:51:33] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-09 07:51:33] [INFO ] Invariant cache hit.
[2023-03-09 07:51:34] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2023-03-09 07:51:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:51:34] [INFO ] Invariant cache hit.
[2023-03-09 07:51:34] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1079 ms. Remains : 56/56 places, 47/47 transitions.
Treatment of property AutoFlight-PT-03b-LTLFireability-07 finished in 11109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(p1)&&X(X(G((p2&&X(p3))))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
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 243 transition count 235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 238 transition count 230
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 238 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 237 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 236 transition count 228
Applied a total of 33 rules in 22 ms. Remains 236 /252 variables (removed 16) and now considering 228/245 (removed 17) transitions.
// Phase 1: matrix 228 rows 236 cols
[2023-03-09 07:51:34] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-09 07:51:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 07:51:34] [INFO ] Invariant cache hit.
[2023-03-09 07:51:34] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-09 07:51:34] [INFO ] Invariant cache hit.
[2023-03-09 07:51:34] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/252 places, 228/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 236/252 places, 228/245 transitions.
Stuttering acceptance computed with spot in 429 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 8}], [{ cond=(OR (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={} source=5 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 p1), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=6, aps=[p1:(EQ s111 0), p2:(EQ s111 1), p0:(EQ s87 0), p3:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-08 finished in 919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 242 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 242 transition count 235
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 242 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 236 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 233 transition count 225
Applied a total of 39 rules in 35 ms. Remains 233 /252 variables (removed 19) and now considering 225/245 (removed 20) transitions.
// Phase 1: matrix 225 rows 233 cols
[2023-03-09 07:51:35] [INFO ] Computed 22 place invariants in 13 ms
[2023-03-09 07:51:35] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-09 07:51:35] [INFO ] Invariant cache hit.
[2023-03-09 07:51:35] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-09 07:51:35] [INFO ] Invariant cache hit.
[2023-03-09 07:51:35] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/252 places, 225/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 233/252 places, 225/245 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s50 1) (EQ s176 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 1268 steps with 9 reset in 3 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-09 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 251 transition count 158
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 96 rules applied. Total rules applied 182 place count 165 transition count 148
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 188 place count 159 transition count 148
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 188 place count 159 transition count 114
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 256 place count 125 transition count 114
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 262 place count 119 transition count 108
Iterating global reduction 3 with 6 rules applied. Total rules applied 268 place count 119 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 268 place count 119 transition count 105
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 274 place count 116 transition count 105
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 360 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 361 place count 72 transition count 55
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 368 place count 67 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 370 place count 65 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 370 place count 65 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 376 place count 62 transition count 50
Applied a total of 376 rules in 15 ms. Remains 62 /252 variables (removed 190) and now considering 50/245 (removed 195) transitions.
// Phase 1: matrix 50 rows 62 cols
[2023-03-09 07:51:36] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-09 07:51:36] [INFO ] Implicit Places using invariants in 115 ms returned [23, 34, 45, 55, 61]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 129 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/252 places, 50/245 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 52 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 49 transition count 42
Applied a total of 16 rules in 4 ms. Remains 49 /57 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 49 cols
[2023-03-09 07:51:36] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 07:51:36] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-09 07:51:36] [INFO ] Invariant cache hit.
[2023-03-09 07:51:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 07:51:36] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/252 places, 42/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 553 ms. Remains : 49/252 places, 42/245 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s44 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]]
Product exploration explored 100000 steps with 12025 reset in 157 ms.
Stack based approach found an accepted trace after 618 steps with 69 reset with depth 6 and stack size 6 in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-10 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G((p1||G(p2)))))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
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 243 transition count 235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 238 transition count 230
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 235 transition count 227
Applied a total of 35 rules in 34 ms. Remains 235 /252 variables (removed 17) and now considering 227/245 (removed 18) transitions.
// Phase 1: matrix 227 rows 235 cols
[2023-03-09 07:51:36] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-09 07:51:37] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-09 07:51:37] [INFO ] Invariant cache hit.
[2023-03-09 07:51:37] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-09 07:51:37] [INFO ] Invariant cache hit.
[2023-03-09 07:51:37] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/252 places, 227/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 235/252 places, 227/245 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s20 1) (EQ s149 1)), p1:(EQ s78 1), p2:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-11 finished in 977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(F(p1))))))'
Support contains 5 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
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 243 transition count 235
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 237 transition count 229
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 234 transition count 226
Applied a total of 37 rules in 16 ms. Remains 234 /252 variables (removed 18) and now considering 226/245 (removed 19) transitions.
// Phase 1: matrix 226 rows 234 cols
[2023-03-09 07:51:37] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-09 07:51:38] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-09 07:51:38] [INFO ] Invariant cache hit.
[2023-03-09 07:51:38] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-09 07:51:38] [INFO ] Invariant cache hit.
[2023-03-09 07:51:38] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/252 places, 226/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 234/252 places, 226/245 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s61 1) (EQ s135 1)) (EQ s191 1)), p1:(OR (EQ s207 0) (EQ s230 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 208 ms.
Product exploration explored 100000 steps with 33333 reset in 258 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLFireability-12 finished in 1415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 251 transition count 158
Reduce places removed 86 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 93 rules applied. Total rules applied 179 place count 165 transition count 151
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 183 place count 161 transition count 151
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 183 place count 161 transition count 118
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 249 place count 128 transition count 118
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 256 place count 121 transition count 111
Iterating global reduction 3 with 7 rules applied. Total rules applied 263 place count 121 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 263 place count 121 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 271 place count 117 transition count 107
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 359 place count 73 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 361 place count 72 transition count 57
Applied a total of 361 rules in 18 ms. Remains 72 /252 variables (removed 180) and now considering 57/245 (removed 188) transitions.
// Phase 1: matrix 57 rows 72 cols
[2023-03-09 07:51:39] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-09 07:51:39] [INFO ] Implicit Places using invariants in 82 ms returned [22, 23, 24, 25, 29, 30, 41, 52, 58, 64, 71]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 82 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/252 places, 57/245 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 61 transition count 52
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 56 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 52 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 52 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 51 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 51 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 50 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 50 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 49 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 49 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 2 with 2 rules applied. Total rules applied 26 place count 48 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 47 transition count 63
Applied a total of 28 rules in 5 ms. Remains 47 /61 variables (removed 14) and now considering 63/57 (removed -6) transitions.
// Phase 1: matrix 63 rows 47 cols
[2023-03-09 07:51:39] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-09 07:51:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-09 07:51:39] [INFO ] Invariant cache hit.
[2023-03-09 07:51:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 07:51:39] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/252 places, 63/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 388 ms. Remains : 47/252 places, 63/245 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s22 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 6088 reset in 149 ms.
Stack based approach found an accepted trace after 7475 steps with 450 reset with depth 8 and stack size 8 in 8 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-14 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
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 243 transition count 235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 238 transition count 230
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 235 transition count 227
Applied a total of 35 rules in 16 ms. Remains 235 /252 variables (removed 17) and now considering 227/245 (removed 18) transitions.
// Phase 1: matrix 227 rows 235 cols
[2023-03-09 07:51:39] [INFO ] Computed 22 place invariants in 13 ms
[2023-03-09 07:51:40] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-09 07:51:40] [INFO ] Invariant cache hit.
[2023-03-09 07:51:40] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-09 07:51:40] [INFO ] Invariant cache hit.
[2023-03-09 07:51:40] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/252 places, 227/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 235/252 places, 227/245 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s55 1), p1:(EQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-15 finished in 753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(p1&&X((p1 U (X(p2)||G(p1)))))))))'
[2023-03-09 07:51:40] [INFO ] Flatten gal took : 34 ms
[2023-03-09 07:51:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-09 07:51:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 245 transitions and 590 arcs took 4 ms.
Total runtime 28441 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-03b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLFireability

FORMULA AutoFlight-PT-03b-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678348346517

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type EXCL) for 0 AutoFlight-PT-03b-LTLFireability-05
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for AutoFlight-PT-03b-LTLFireability-05
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 8 (type EXCL) for 7 AutoFlight-PT-03b-LTLFireability-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1800 5/32 AutoFlight-PT-03b-LTLFireability-07 613171 m, 122634 m/sec, 2790452 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1800 9/32 AutoFlight-PT-03b-LTLFireability-07 1150174 m, 107400 m/sec, 5501790 t fired, .

Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1800 13/32 AutoFlight-PT-03b-LTLFireability-07 1685289 m, 107023 m/sec, 8129217 t fired, .

Time elapsed: 15 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1800 17/32 AutoFlight-PT-03b-LTLFireability-07 2194657 m, 101873 m/sec, 10763579 t fired, .

Time elapsed: 20 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1800 20/32 AutoFlight-PT-03b-LTLFireability-07 2659966 m, 93061 m/sec, 13463014 t fired, .

Time elapsed: 25 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1800 24/32 AutoFlight-PT-03b-LTLFireability-07 3139157 m, 95838 m/sec, 16131103 t fired, .

Time elapsed: 30 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/1800 28/32 AutoFlight-PT-03b-LTLFireability-07 3645848 m, 101338 m/sec, 18846028 t fired, .

Time elapsed: 35 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/1800 31/32 AutoFlight-PT-03b-LTLFireability-07 4139500 m, 98730 m/sec, 21590831 t fired, .

Time elapsed: 40 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 8 (type EXCL) for AutoFlight-PT-03b-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-03b-LTLFireability-05: CONJ 0 1 0 0 3 0 0 0
AutoFlight-PT-03b-LTLFireability-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 5 (type EXCL) for 0 AutoFlight-PT-03b-LTLFireability-05
lola: time limit : 3555 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for AutoFlight-PT-03b-LTLFireability-05
lola: result : false
lola: markings : 2156
lola: fired transitions : 8265
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-03b-LTLFireability-05: CONJ false LTL model checker
AutoFlight-PT-03b-LTLFireability-07: LTL unknown AGGR


Time elapsed: 45 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is AutoFlight-PT-03b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595500412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03b.tgz
mv AutoFlight-PT-03b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;