About the Execution of LoLa+red for AutoFlight-PT-04a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
765.632 | 72602.00 | 93364.00 | 32.40 | FFFFFFTTFFF?FFTF | normal |
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-167813595500420.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-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595500420
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 17:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 17:55 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.4K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 29K 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-04a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-04a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678348383371
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-04a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:53:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 07:53:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:53:06] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-09 07:53:06] [INFO ] Transformed 107 places.
[2023-03-09 07:53:06] [INFO ] Transformed 105 transitions.
[2023-03-09 07:53:06] [INFO ] Found NUPN structural information;
[2023-03-09 07:53:06] [INFO ] Parsed PT model containing 107 places and 105 transitions and 340 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA AutoFlight-PT-04a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 85/85 transitions.
Applied a total of 0 rules in 13 ms. Remains 107 /107 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 107 cols
[2023-03-09 07:53:06] [INFO ] Computed 28 place invariants in 20 ms
[2023-03-09 07:53:07] [INFO ] Implicit Places using invariants in 624 ms returned [21, 31, 34, 37, 40, 62, 86, 92, 98, 104]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 661 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/107 places, 85/85 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 95 transition count 83
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 95 transition count 83
Applied a total of 4 rules in 5 ms. Remains 95 /97 variables (removed 2) and now considering 83/85 (removed 2) transitions.
// Phase 1: matrix 83 rows 95 cols
[2023-03-09 07:53:07] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-09 07:53:07] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 07:53:07] [INFO ] Invariant cache hit.
[2023-03-09 07:53:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 07:53:07] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/107 places, 83/85 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 903 ms. Remains : 95/107 places, 83/85 transitions.
Support contains 34 out of 95 places after structural reductions.
[2023-03-09 07:53:07] [INFO ] Flatten gal took : 83 ms
[2023-03-09 07:53:07] [INFO ] Flatten gal took : 18 ms
[2023-03-09 07:53:07] [INFO ] Input system was already deterministic with 83 transitions.
Incomplete random walk after 10000 steps, including 346 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 07:53:08] [INFO ] Invariant cache hit.
[2023-03-09 07:53:08] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 07:53:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-09 07:53:08] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 07:53:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 07:53:08] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 07:53:08] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-09 07:53:08] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 3 ms.
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 83/83 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 95 transition count 73
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 85 transition count 73
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 20 place count 85 transition count 59
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 48 place count 71 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 69 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 69 transition count 57
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 62 transition count 50
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 62 transition count 42
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 82 place count 54 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 53 transition count 41
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 37 rules applied. Total rules applied 120 place count 39 transition count 18
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 143 place count 16 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 143 place count 16 transition count 15
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 149 place count 13 transition count 15
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 152 place count 10 transition count 12
Iterating global reduction 5 with 3 rules applied. Total rules applied 155 place count 10 transition count 12
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 157 place count 10 transition count 10
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 6 with 2 rules applied. Total rules applied 159 place count 9 transition count 9
Applied a total of 159 rules in 26 ms. Remains 9 /95 variables (removed 86) and now considering 9/83 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 9/95 places, 9/83 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Computed a total of 4 stabilizing places and 1 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' '!(F(G((p0 U p1))))'
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 95 transition count 73
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 85 transition count 73
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 20 place count 85 transition count 60
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 46 place count 72 transition count 60
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 70 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 70 transition count 58
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 64 place count 63 transition count 51
Applied a total of 64 rules in 23 ms. Remains 63 /95 variables (removed 32) and now considering 51/83 (removed 32) transitions.
// Phase 1: matrix 51 rows 63 cols
[2023-03-09 07:53:09] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-09 07:53:09] [INFO ] Implicit Places using invariants in 171 ms returned [5, 20, 21, 22, 23, 24, 48, 62]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 186 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/95 places, 51/83 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 55 transition count 44
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 48 transition count 44
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 48 transition count 40
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 44 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 43 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 43 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 41 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 40 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 40 transition count 36
Applied a total of 30 rules in 7 ms. Remains 40 /55 variables (removed 15) and now considering 36/51 (removed 15) transitions.
// Phase 1: matrix 36 rows 40 cols
[2023-03-09 07:53:09] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-09 07:53:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 07:53:09] [INFO ] Invariant cache hit.
[2023-03-09 07:53:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 07:53:09] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/95 places, 36/83 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 333 ms. Remains : 40/95 places, 36/83 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s25 1)), p0:(AND (EQ s16 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-01 finished in 701 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)||G((F((p1||X(p1))) U p2)))))'
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 76
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 88 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 87 transition count 75
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 16 place count 87 transition count 61
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 44 place count 73 transition count 61
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 71 transition count 59
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 71 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 65 transition count 53
Applied a total of 60 rules in 8 ms. Remains 65 /95 variables (removed 30) and now considering 53/83 (removed 30) transitions.
// Phase 1: matrix 53 rows 65 cols
[2023-03-09 07:53:09] [INFO ] Computed 18 place invariants in 10 ms
[2023-03-09 07:53:10] [INFO ] Implicit Places using invariants in 219 ms returned [6, 12, 21, 22, 23, 24, 25, 50, 64]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 221 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/95 places, 53/83 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 56 transition count 39
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 42 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 41 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 41 transition count 37
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 32 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 39 transition count 36
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 39 transition count 36
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 3 with 2 rules applied. Total rules applied 36 place count 38 transition count 35
Applied a total of 36 rules in 6 ms. Remains 38 /56 variables (removed 18) and now considering 35/53 (removed 18) transitions.
// Phase 1: matrix 35 rows 38 cols
[2023-03-09 07:53:10] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-09 07:53:10] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-09 07:53:10] [INFO ] Invariant cache hit.
[2023-03-09 07:53:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:53:10] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/95 places, 35/83 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 598 ms. Remains : 38/95 places, 35/83 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s19 1), p1:(EQ s4 1), p0:(EQ s10 0)], nbAcceptance=2, 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 5990 reset in 302 ms.
Stack based approach found an accepted trace after 7553 steps with 451 reset with depth 40 and stack size 40 in 21 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-02 finished in 1227 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)||X((X(F(p1))||F((p1&&F(p2)))))))'
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 93 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 81
Applied a total of 4 rules in 7 ms. Remains 93 /95 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 93 cols
[2023-03-09 07:53:11] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-09 07:53:11] [INFO ] Implicit Places using invariants in 196 ms returned [7, 14, 27, 74, 92]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 198 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/95 places, 81/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 84 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 73
Applied a total of 16 rules in 15 ms. Remains 80 /88 variables (removed 8) and now considering 73/81 (removed 8) transitions.
// Phase 1: matrix 73 rows 80 cols
[2023-03-09 07:53:11] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 07:53:11] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 07:53:11] [INFO ] Invariant cache hit.
[2023-03-09 07:53:11] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 80/95 places, 73/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 368 ms. Remains : 80/95 places, 73/83 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(EQ s28 1), p2:(EQ s41 1), p0:(EQ s3 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 49 steps with 10 reset in 1 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-03 finished in 752 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 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 93 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 81
Applied a total of 4 rules in 6 ms. Remains 93 /95 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 93 cols
[2023-03-09 07:53:11] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-09 07:53:12] [INFO ] Implicit Places using invariants in 383 ms returned [7, 14, 27, 74, 92]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 387 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/95 places, 81/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 84 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 73
Applied a total of 16 rules in 25 ms. Remains 80 /88 variables (removed 8) and now considering 73/81 (removed 8) transitions.
// Phase 1: matrix 73 rows 80 cols
[2023-03-09 07:53:12] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-09 07:53:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 07:53:12] [INFO ] Invariant cache hit.
[2023-03-09 07:53:12] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 80/95 places, 73/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 587 ms. Remains : 80/95 places, 73/83 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-04 finished in 727 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(X(X(G(p0)))))'
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 93 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 81
Applied a total of 4 rules in 12 ms. Remains 93 /95 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 93 cols
[2023-03-09 07:53:12] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-09 07:53:12] [INFO ] Implicit Places using invariants in 186 ms returned [7, 14, 27, 74, 92]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 200 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/95 places, 81/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 84 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 78 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 78 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 77 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 77 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 76 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 76 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 75 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 75 transition count 68
Applied a total of 26 rules in 23 ms. Remains 75 /88 variables (removed 13) and now considering 68/81 (removed 13) transitions.
// Phase 1: matrix 68 rows 75 cols
[2023-03-09 07:53:12] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-09 07:53:12] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 07:53:12] [INFO ] Invariant cache hit.
[2023-03-09 07:53:12] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 75/95 places, 68/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 383 ms. Remains : 75/95 places, 68/83 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s7 0) (EQ s51 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 88 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-05 finished in 548 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 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 95 transition count 73
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 85 transition count 73
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 20 place count 85 transition count 59
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 48 place count 71 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 69 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 69 transition count 57
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 68 place count 61 transition count 49
Applied a total of 68 rules in 6 ms. Remains 61 /95 variables (removed 34) and now considering 49/83 (removed 34) transitions.
// Phase 1: matrix 49 rows 61 cols
[2023-03-09 07:53:13] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-09 07:53:13] [INFO ] Implicit Places using invariants in 50 ms returned [5, 10, 19, 20, 21, 22, 23, 60]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 63 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/95 places, 49/83 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 53 transition count 39
Reduce places removed 10 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 14 rules applied. Total rules applied 24 place count 43 transition count 35
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 39 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 39 transition count 34
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 30 place count 38 transition count 34
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 3 with 2 rules applied. Total rules applied 32 place count 37 transition count 33
Applied a total of 32 rules in 12 ms. Remains 37 /53 variables (removed 16) and now considering 33/49 (removed 16) transitions.
// Phase 1: matrix 33 rows 37 cols
[2023-03-09 07:53:13] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-09 07:53:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 07:53:13] [INFO ] Invariant cache hit.
[2023-03-09 07:53:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 07:53:13] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/95 places, 33/83 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 226 ms. Remains : 37/95 places, 33/83 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s36 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 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-04a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-04a-LTLFireability-07 finished in 756 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(p0)||(X(p1)&&(F(p2) U X(p3)))))'
Support contains 7 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 93 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 81
Applied a total of 4 rules in 2 ms. Remains 93 /95 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 93 cols
[2023-03-09 07:53:13] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-09 07:53:13] [INFO ] Implicit Places using invariants in 91 ms returned [14, 74, 92]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/95 places, 81/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 77
Applied a total of 8 rules in 6 ms. Remains 86 /90 variables (removed 4) and now considering 77/81 (removed 4) transitions.
// Phase 1: matrix 77 rows 86 cols
[2023-03-09 07:53:13] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-09 07:53:14] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 07:53:14] [INFO ] Invariant cache hit.
[2023-03-09 07:53:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 07:53:14] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 86/95 places, 77/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 297 ms. Remains : 86/95 places, 77/83 transitions.
Stuttering acceptance computed with spot in 450 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3)), true, (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(NOT p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s26 1) (EQ s56 1)), p0:(AND (EQ s7 1) (EQ s61 1)), p1:(AND (EQ s10 1) (EQ s73 1)), p3:(OR (EQ s47 1) (AND (EQ s7 1) (EQ s61 1)))], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-08 finished in 780 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((X(p0) U !p1))&&G((F(p2)&&F(p3)))))'
Support contains 7 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 82
Applied a total of 2 rules in 4 ms. Remains 94 /95 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 94 cols
[2023-03-09 07:53:14] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-09 07:53:14] [INFO ] Implicit Places using invariants in 196 ms returned [14, 27, 74]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 214 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/95 places, 82/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 87 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 86 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 86 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 85 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 85 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 83 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 83 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 73
Applied a total of 18 rules in 26 ms. Remains 82 /91 variables (removed 9) and now considering 73/82 (removed 9) transitions.
// Phase 1: matrix 73 rows 82 cols
[2023-03-09 07:53:14] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 07:53:15] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-09 07:53:15] [INFO ] Invariant cache hit.
[2023-03-09 07:53:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 07:53:15] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/95 places, 73/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 610 ms. Remains : 82/95 places, 73/83 transitions.
Stuttering acceptance computed with spot in 551 ms :[(OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3) p1), (NOT p2), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p0) p1), true]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s3 1), p3:(AND (EQ s19 1) (EQ s73 1)), p1:(AND (EQ s7 1) (EQ s55 1)), p0:(AND (EQ s71 1) (EQ s81 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]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-10 finished in 1225 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||X(G((G(p1)||F(p2)))))))'
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 93 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 81
Applied a total of 4 rules in 1 ms. Remains 93 /95 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 93 cols
[2023-03-09 07:53:15] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-09 07:53:16] [INFO ] Implicit Places using invariants in 188 ms returned [7, 14, 27, 74, 92]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 188 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/95 places, 81/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 84 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 78 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 78 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 77 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 77 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 76 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 76 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 75 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 75 transition count 68
Applied a total of 26 rules in 17 ms. Remains 75 /88 variables (removed 13) and now considering 68/81 (removed 13) transitions.
// Phase 1: matrix 68 rows 75 cols
[2023-03-09 07:53:16] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 07:53:16] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-09 07:53:16] [INFO ] Invariant cache hit.
[2023-03-09 07:53:16] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 75/95 places, 68/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 447 ms. Remains : 75/95 places, 68/83 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s24 1), p1:(EQ s11 0), p2:(OR (EQ s19 0) (EQ s53 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3327 reset in 185 ms.
Product exploration explored 100000 steps with 3263 reset in 157 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 659 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 342 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 07:53:17] [INFO ] Invariant cache hit.
[2023-03-09 07:53:17] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 07:53:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-09 07:53:18] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 07:53:18] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 07:53:18] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 708 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-09 07:53:19] [INFO ] Invariant cache hit.
[2023-03-09 07:53:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 07:53:19] [INFO ] Invariant cache hit.
[2023-03-09 07:53:19] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-09 07:53:19] [INFO ] Invariant cache hit.
[2023-03-09 07:53:19] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 75/75 places, 68/68 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 310 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 07:53:20] [INFO ] Invariant cache hit.
[2023-03-09 07:53:20] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 07:53:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-09 07:53:20] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 07:53:20] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 07:53:20] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 68/68 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 75 transition count 50
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 57 transition count 50
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 36 place count 57 transition count 46
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 53 transition count 46
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 43 transition count 36
Free-agglomeration rule applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 43 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 88 place count 31 transition count 24
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 30 transition count 23
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 29 transition count 22
Reduce places removed 10 places and 0 transitions.
Graph (trivial) has 15 edges and 19 vertex of which 5 / 19 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 14 rules applied. Total rules applied 105 place count 15 transition count 19
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 114 place count 12 transition count 13
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 10 transition count 11
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 10 transition count 11
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 5 with 2 rules applied. Total rules applied 120 place count 9 transition count 10
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 123 place count 9 transition count 7
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 128 place count 6 transition count 5
Applied a total of 128 rules in 9 ms. Remains 6 /75 variables (removed 69) and now considering 5/68 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 6/75 places, 5/68 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 3320 reset in 156 ms.
Product exploration explored 100000 steps with 3269 reset in 109 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 75 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 18 place count 75 transition count 68
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 75 transition count 68
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 34 place count 63 transition count 56
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 63 transition count 56
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 63 transition count 56
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 59 transition count 52
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 59 transition count 52
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 64 rules in 29 ms. Remains 59 /75 variables (removed 16) and now considering 52/68 (removed 16) transitions.
[2023-03-09 07:53:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 59 cols
[2023-03-09 07:53:22] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 07:53:22] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/75 places, 52/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 59/75 places, 52/68 transitions.
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 68/68 (removed 0) transitions.
// Phase 1: matrix 68 rows 75 cols
[2023-03-09 07:53:22] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-09 07:53:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 07:53:22] [INFO ] Invariant cache hit.
[2023-03-09 07:53:22] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-09 07:53:22] [INFO ] Invariant cache hit.
[2023-03-09 07:53:22] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 75/75 places, 68/68 transitions.
Treatment of property AutoFlight-PT-04a-LTLFireability-11 finished in 6536 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&&F(G(p1))))))'
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 93 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 81
Applied a total of 4 rules in 2 ms. Remains 93 /95 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 93 cols
[2023-03-09 07:53:22] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-09 07:53:22] [INFO ] Implicit Places using invariants in 68 ms returned [7, 14, 27, 74, 92]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 69 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/95 places, 81/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 84 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 78 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 78 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 77 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 77 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 76 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 76 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 75 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 75 transition count 68
Applied a total of 26 rules in 16 ms. Remains 75 /88 variables (removed 13) and now considering 68/81 (removed 13) transitions.
// Phase 1: matrix 68 rows 75 cols
[2023-03-09 07:53:22] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 07:53:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-09 07:53:22] [INFO ] Invariant cache hit.
[2023-03-09 07:53:22] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 75/95 places, 68/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 75/95 places, 68/83 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s12 1), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-12 finished in 521 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 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 95 transition count 73
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 85 transition count 73
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 20 place count 85 transition count 59
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 48 place count 71 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 69 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 69 transition count 57
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 62 transition count 50
Applied a total of 66 rules in 27 ms. Remains 62 /95 variables (removed 33) and now considering 50/83 (removed 33) transitions.
// Phase 1: matrix 50 rows 62 cols
[2023-03-09 07:53:22] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-09 07:53:23] [INFO ] Implicit Places using invariants in 278 ms returned [6, 11, 20, 21, 22, 23, 24, 47, 61]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 280 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/95 places, 50/83 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 53 transition count 35
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 38 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 37 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 37 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 35 transition count 32
Applied a total of 36 rules in 4 ms. Remains 35 /53 variables (removed 18) and now considering 32/50 (removed 18) transitions.
// Phase 1: matrix 32 rows 35 cols
[2023-03-09 07:53:23] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 07:53:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 07:53:23] [INFO ] Invariant cache hit.
[2023-03-09 07:53:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 07:53:23] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/95 places, 32/83 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 429 ms. Remains : 35/95 places, 32/83 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-13 finished in 538 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(X(F((p0||G(p1))))))'
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 93 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 81
Applied a total of 4 rules in 1 ms. Remains 93 /95 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 93 cols
[2023-03-09 07:53:23] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-09 07:53:23] [INFO ] Implicit Places using invariants in 73 ms returned [7, 14, 27, 74, 92]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 74 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/95 places, 81/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 84 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 75
Applied a total of 12 rules in 3 ms. Remains 82 /88 variables (removed 6) and now considering 75/81 (removed 6) transitions.
// Phase 1: matrix 75 rows 82 cols
[2023-03-09 07:53:23] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-09 07:53:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 07:53:23] [INFO ] Invariant cache hit.
[2023-03-09 07:53:23] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/95 places, 75/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 82/95 places, 75/83 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s8 0), p0:(EQ s54 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 175 ms.
Product exploration explored 100000 steps with 33333 reset in 193 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 3 factoid took 252 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-04a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-04a-LTLFireability-14 finished in 1073 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((X(p0)||(X(p1)&&G(p2)&&F(p3)))))'
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 82
Applied a total of 2 rules in 2 ms. Remains 94 /95 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 94 cols
[2023-03-09 07:53:24] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-09 07:53:24] [INFO ] Implicit Places using invariants in 140 ms returned [7, 14, 27, 74]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 154 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/95 places, 82/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 78 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 78 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 77 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 77 transition count 69
Applied a total of 26 rules in 6 ms. Remains 77 /90 variables (removed 13) and now considering 69/82 (removed 13) transitions.
// Phase 1: matrix 69 rows 77 cols
[2023-03-09 07:53:24] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-09 07:53:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 07:53:24] [INFO ] Invariant cache hit.
[2023-03-09 07:53:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 77/95 places, 69/83 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 301 ms. Remains : 77/95 places, 69/83 transitions.
Stuttering acceptance computed with spot in 464 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p3 (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={} source=1 dest: 7}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND p2 p3), acceptance={} source=6 dest: 2}], [{ cond=(AND p2 p3), acceptance={0} source=7 dest: 3}, { cond=(NOT p2), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=5, aps=[p0:(AND (EQ s70 1) (EQ s76 1)), p2:(OR (EQ s70 0) (EQ s76 0)), p3:(AND (EQ s21 1) (EQ s71 1)), p1:(EQ s28 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, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-LTLFireability-15 finished in 799 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||X(G((G(p1)||F(p2)))))))'
Found a Lengthening insensitive property : AutoFlight-PT-04a-LTLFireability-11
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 95/95 places, 83/83 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 95 transition count 73
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 85 transition count 73
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 20 place count 85 transition count 59
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 48 place count 71 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 69 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 69 transition count 57
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 64 place count 63 transition count 51
Applied a total of 64 rules in 26 ms. Remains 63 /95 variables (removed 32) and now considering 51/83 (removed 32) transitions.
// Phase 1: matrix 51 rows 63 cols
[2023-03-09 07:53:25] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-09 07:53:25] [INFO ] Implicit Places using invariants in 90 ms returned [5, 11, 21, 22, 23, 24, 25, 48, 62]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 104 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 54/95 places, 51/83 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 54 transition count 36
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 39 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 38 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 38 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 36 transition count 33
Applied a total of 36 rules in 3 ms. Remains 36 /54 variables (removed 18) and now considering 33/51 (removed 18) transitions.
// Phase 1: matrix 33 rows 36 cols
[2023-03-09 07:53:25] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-09 07:53:25] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-09 07:53:25] [INFO ] Invariant cache hit.
[2023-03-09 07:53:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:53:26] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 36/95 places, 33/83 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 340 ms. Remains : 36/95 places, 33/83 transitions.
Running random walk in product with property : AutoFlight-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s18 1), p1:(EQ s8 0), p2:(OR (EQ s14 0) (EQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6033 reset in 111 ms.
Product exploration explored 100000 steps with 6101 reset in 84 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 581 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 623 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 07:53:27] [INFO ] Invariant cache hit.
[2023-03-09 07:53:27] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 07:53:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 07:53:27] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 07:53:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:53:27] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 07:53:27] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 07:53:27] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 33/33 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 32
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 35 transition count 20
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 26 place count 23 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 22 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 22 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 21 transition count 18
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t24.t11.t75 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 9 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 11 transition count 12
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 9 transition count 10
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 9 transition count 10
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 3 with 2 rules applied. Total rules applied 44 place count 8 transition count 9
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 8 transition count 7
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 50 place count 6 transition count 5
Applied a total of 50 rules in 8 ms. Remains 6 /36 variables (removed 30) and now considering 5/33 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 6/36 places, 5/33 transitions.
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 406 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 36 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-09 07:53:28] [INFO ] Invariant cache hit.
[2023-03-09 07:53:28] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 07:53:28] [INFO ] Invariant cache hit.
[2023-03-09 07:53:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:53:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-09 07:53:28] [INFO ] Invariant cache hit.
[2023-03-09 07:53:28] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 36/36 places, 33/33 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 9552 steps, including 593 resets, run visited all 2 properties in 18 ms. (steps per millisecond=530 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 360 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 6036 reset in 76 ms.
Product exploration explored 100000 steps with 6018 reset in 83 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 33/33 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-09 07:53:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 33 rows 36 cols
[2023-03-09 07:53:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 07:53:30] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/36 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 36/36 places, 33/33 transitions.
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 36 cols
[2023-03-09 07:53:30] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-09 07:53:30] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 07:53:30] [INFO ] Invariant cache hit.
[2023-03-09 07:53:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:53:30] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-09 07:53:30] [INFO ] Invariant cache hit.
[2023-03-09 07:53:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 36/36 places, 33/33 transitions.
Treatment of property AutoFlight-PT-04a-LTLFireability-11 finished in 5114 ms.
[2023-03-09 07:53:30] [INFO ] Flatten gal took : 10 ms
[2023-03-09 07:53:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 07:53:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 95 places, 83 transitions and 258 arcs took 2 ms.
Total runtime 24388 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-04a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
LTLFireability
BK_STOP 1678348455973
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 AutoFlight-PT-04a-LTLFireability-11
lola: time limit : 3600 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-04a-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 7/32 AutoFlight-PT-04a-LTLFireability-11 896906 m, 179381 m/sec, 4780764 t fired, .
Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-04a-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 12/32 AutoFlight-PT-04a-LTLFireability-11 1620252 m, 144669 m/sec, 9652749 t fired, .
Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-04a-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 16/32 AutoFlight-PT-04a-LTLFireability-11 2278281 m, 131605 m/sec, 14610163 t fired, .
Time elapsed: 15 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-04a-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 21/32 AutoFlight-PT-04a-LTLFireability-11 2882128 m, 120769 m/sec, 19612486 t fired, .
Time elapsed: 20 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-04a-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 24/32 AutoFlight-PT-04a-LTLFireability-11 3346163 m, 92807 m/sec, 24555443 t fired, .
Time elapsed: 25 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-04a-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 26/32 AutoFlight-PT-04a-LTLFireability-11 3707596 m, 72286 m/sec, 29354465 t fired, .
Time elapsed: 30 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-04a-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 29/32 AutoFlight-PT-04a-LTLFireability-11 4257832 m, 110047 m/sec, 34515171 t fired, .
Time elapsed: 35 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-04a-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 32/32 AutoFlight-PT-04a-LTLFireability-11 4737761 m, 95985 m/sec, 39760866 t fired, .
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for AutoFlight-PT-04a-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-04a-LTLFireability-11: 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: 1
lola: Portfolio finished: no open tasks 1
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-04a-LTLFireability-11: 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-04a"
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-04a, 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-167813595500420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04a.tgz
mv AutoFlight-PT-04a 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 '
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 ;