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.r009-oct2-167813597900428.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 ltsminxred
Input is AutoFlight-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:10 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.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K 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-04b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678627885046

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:31:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:31:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:31:27] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-12 13:31:27] [INFO ] Transformed 390 places.
[2023-03-12 13:31:27] [INFO ] Transformed 388 transitions.
[2023-03-12 13:31:27] [INFO ] Found NUPN structural information;
[2023-03-12 13:31:27] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-04b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 347 transition count 345
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 347 transition count 345
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 93 place count 347 transition count 338
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 108 place count 332 transition count 323
Iterating global reduction 1 with 15 rules applied. Total rules applied 123 place count 332 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 330 transition count 321
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 330 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 329 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 329 transition count 320
Applied a total of 129 rules in 115 ms. Remains 329 /390 variables (removed 61) and now considering 320/388 (removed 68) transitions.
// Phase 1: matrix 320 rows 329 cols
[2023-03-12 13:31:28] [INFO ] Computed 28 place invariants in 13 ms
[2023-03-12 13:31:28] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-12 13:31:28] [INFO ] Invariant cache hit.
[2023-03-12 13:31:28] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-03-12 13:31:28] [INFO ] Invariant cache hit.
[2023-03-12 13:31:29] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 329/390 places, 320/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1163 ms. Remains : 329/390 places, 320/388 transitions.
Support contains 36 out of 329 places after structural reductions.
[2023-03-12 13:31:29] [INFO ] Flatten gal took : 50 ms
[2023-03-12 13:31:29] [INFO ] Flatten gal took : 24 ms
[2023-03-12 13:31:29] [INFO ] Input system was already deterministic with 320 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 33) seen :29
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 13:31:30] [INFO ] Invariant cache hit.
[2023-03-12 13:31:30] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 13:31:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2023-03-12 13:31:30] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:31:30] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-12 13:31:30] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 3 ms to minimize.
[2023-03-12 13:31:30] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2023-03-12 13:31:30] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2023-03-12 13:31:30] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 0 ms to minimize.
[2023-03-12 13:31:30] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2023-03-12 13:31:31] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2023-03-12 13:31:31] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2023-03-12 13:31:31] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 0 ms to minimize.
[2023-03-12 13:31:31] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2023-03-12 13:31:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 704 ms
[2023-03-12 13:31:31] [INFO ] After 913ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 13:31:31] [INFO ] After 1023ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 149 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=49 )
Parikh walk visited 2 properties in 4 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA AutoFlight-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 91 stabilizing places and 91 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((p0||G(F(p1)))) U (F(p2) U p3)))'
Support contains 4 out of 329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 328 transition count 206
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 127 rules applied. Total rules applied 240 place count 215 transition count 192
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 248 place count 207 transition count 192
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 248 place count 207 transition count 151
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 330 place count 166 transition count 151
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 338 place count 158 transition count 143
Iterating global reduction 3 with 8 rules applied. Total rules applied 346 place count 158 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 346 place count 158 transition count 139
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 354 place count 154 transition count 139
Performed 55 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 464 place count 99 transition count 79
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 465 place count 99 transition count 78
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 467 place count 98 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 468 place count 97 transition count 76
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 478 place count 90 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 481 place count 87 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 481 place count 87 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 489 place count 83 transition count 69
Applied a total of 489 rules in 40 ms. Remains 83 /329 variables (removed 246) and now considering 69/320 (removed 251) transitions.
// Phase 1: matrix 69 rows 83 cols
[2023-03-12 13:31:31] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-12 13:31:31] [INFO ] Implicit Places using invariants in 80 ms returned [34, 48, 68, 72, 76, 82]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 84 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/329 places, 69/320 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 73 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 73 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 72 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 72 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 71 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 71 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 70 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 70 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 69 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 69 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 67 transition count 59
Applied a total of 20 rules in 9 ms. Remains 67 /77 variables (removed 10) and now considering 59/69 (removed 10) transitions.
// Phase 1: matrix 59 rows 67 cols
[2023-03-12 13:31:32] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-12 13:31:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 13:31:32] [INFO ] Invariant cache hit.
[2023-03-12 13:31:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:31:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/329 places, 59/320 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 280 ms. Remains : 67/329 places, 59/320 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(EQ s27 1), p2:(EQ s10 1), p0:(EQ s58 1), p1:(NEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1218 steps with 118 reset in 31 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-00 finished in 742 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)||G(p1)))'
Support contains 2 out of 329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 328 transition count 205
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 127 rules applied. Total rules applied 241 place count 214 transition count 192
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 249 place count 206 transition count 192
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 249 place count 206 transition count 151
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 331 place count 165 transition count 151
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 340 place count 156 transition count 142
Iterating global reduction 3 with 9 rules applied. Total rules applied 349 place count 156 transition count 142
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 349 place count 156 transition count 138
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 357 place count 152 transition count 138
Performed 56 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 469 place count 96 transition count 76
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 471 place count 96 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 472 place count 95 transition count 75
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 482 place count 88 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 485 place count 85 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 485 place count 85 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 493 place count 81 transition count 68
Applied a total of 493 rules in 32 ms. Remains 81 /329 variables (removed 248) and now considering 68/320 (removed 252) transitions.
// Phase 1: matrix 68 rows 81 cols
[2023-03-12 13:31:32] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-12 13:31:32] [INFO ] Implicit Places using invariants in 76 ms returned [34, 48, 62, 66, 70, 74, 80]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 77 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/329 places, 68/320 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 69 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 69 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 68 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 68 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 67 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 67 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 66 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 66 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 65 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 65 transition count 59
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 20 place count 64 transition count 58
Applied a total of 20 rules in 9 ms. Remains 64 /74 variables (removed 10) and now considering 58/68 (removed 10) transitions.
// Phase 1: matrix 58 rows 64 cols
[2023-03-12 13:31:32] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-12 13:31:32] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 13:31:32] [INFO ] Invariant cache hit.
[2023-03-12 13:31:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:31:32] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/329 places, 58/320 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 64/329 places, 58/320 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s27 1), p1:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-01 finished in 355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1))&&F(p2))))'
Support contains 3 out of 329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 328 transition count 208
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 123 rules applied. Total rules applied 234 place count 217 transition count 196
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 241 place count 211 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 210 transition count 195
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 242 place count 210 transition count 152
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 328 place count 167 transition count 152
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 338 place count 157 transition count 142
Iterating global reduction 4 with 10 rules applied. Total rules applied 348 place count 157 transition count 142
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 348 place count 157 transition count 136
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 360 place count 151 transition count 136
Performed 53 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 466 place count 98 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 467 place count 97 transition count 76
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 475 place count 91 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 477 place count 89 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 477 place count 89 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 485 place count 85 transition count 70
Applied a total of 485 rules in 40 ms. Remains 85 /329 variables (removed 244) and now considering 70/320 (removed 250) transitions.
// Phase 1: matrix 70 rows 85 cols
[2023-03-12 13:31:32] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-12 13:31:33] [INFO ] Implicit Places using invariants in 97 ms returned [35, 49, 63, 74, 78, 84]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 99 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/329 places, 70/320 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 73 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 73 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 72 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 72 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 70 transition count 61
Applied a total of 18 rules in 8 ms. Remains 70 /79 variables (removed 9) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 70 cols
[2023-03-12 13:31:33] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-12 13:31:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-12 13:31:33] [INFO ] Invariant cache hit.
[2023-03-12 13:31:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:31:33] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/329 places, 61/320 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 70/329 places, 61/320 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s27 0), p2:(EQ s32 1), p1:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-02 finished in 506 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&&G(F(p1))))))'
Support contains 4 out of 329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 316 transition count 307
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 316 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 316 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 311 transition count 301
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 311 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 309 transition count 299
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 309 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 307 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 307 transition count 297
Applied a total of 45 rules in 25 ms. Remains 307 /329 variables (removed 22) and now considering 297/320 (removed 23) transitions.
// Phase 1: matrix 297 rows 307 cols
[2023-03-12 13:31:33] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-12 13:31:33] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 13:31:33] [INFO ] Invariant cache hit.
[2023-03-12 13:31:33] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-12 13:31:33] [INFO ] Invariant cache hit.
[2023-03-12 13:31:33] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 307/329 places, 297/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 307/329 places, 297/320 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s154 1), p1:(OR (EQ s248 1) (EQ s121 1) (EQ s147 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-04 finished in 887 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))&&(G(p1) U p2)))'
Support contains 2 out of 329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 314 transition count 305
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 314 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 314 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 308 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 306 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 306 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 304 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 304 transition count 294
Applied a total of 51 rules in 22 ms. Remains 304 /329 variables (removed 25) and now considering 294/320 (removed 26) transitions.
// Phase 1: matrix 294 rows 304 cols
[2023-03-12 13:31:34] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-12 13:31:34] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-12 13:31:34] [INFO ] Invariant cache hit.
[2023-03-12 13:31:34] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-12 13:31:34] [INFO ] Invariant cache hit.
[2023-03-12 13:31:34] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/329 places, 294/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 304/329 places, 294/320 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s0 1), p1:(EQ s79 1), p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 490 reset in 261 ms.
Product exploration explored 100000 steps with 489 reset in 238 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Detected a total of 74/304 stabilizing places and 74/294 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 p0))), (X (OR (NOT p1) (NOT p0))), (X p0), (X (NOT (AND (NOT p2) p1 p0))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 854 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 p0))), (X (OR (NOT p1) (NOT p0))), (X p0), (X (NOT (AND (NOT p2) p1 p0))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 13 factoid took 952 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0)]
[2023-03-12 13:31:38] [INFO ] Invariant cache hit.
[2023-03-12 13:31:38] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned sat
[2023-03-12 13:31:38] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:38] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-12 13:31:38] [INFO ] Computed and/alt/rep : 293/419/293 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-12 13:31:38] [INFO ] Added : 0 causal constraints over 0 iterations in 103 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 304 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 304 /304 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-12 13:31:38] [INFO ] Invariant cache hit.
[2023-03-12 13:31:38] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-12 13:31:38] [INFO ] Invariant cache hit.
[2023-03-12 13:31:38] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-12 13:31:38] [INFO ] Invariant cache hit.
[2023-03-12 13:31:39] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 304/304 places, 294/294 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Detected a total of 74/304 stabilizing places and 74/294 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 324 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
[2023-03-12 13:31:40] [INFO ] Invariant cache hit.
[2023-03-12 13:31:40] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-12 13:31:40] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:40] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-12 13:31:40] [INFO ] Computed and/alt/rep : 293/419/293 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-12 13:31:40] [INFO ] Added : 0 causal constraints over 0 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 489 reset in 195 ms.
Product exploration explored 100000 steps with 491 reset in 186 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 304 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 102 place count 304 transition count 290
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 102 place count 304 transition count 290
Deduced a syphon composed of 140 places in 14 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 144 place count 304 transition count 290
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 223 place count 225 transition count 211
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 302 place count 225 transition count 211
Performed 73 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 73 rules applied. Total rules applied 375 place count 225 transition count 203
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 421 place count 179 transition count 157
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 467 place count 179 transition count 157
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 467 rules in 67 ms. Remains 179 /304 variables (removed 125) and now considering 157/294 (removed 137) transitions.
[2023-03-12 13:31:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 157 rows 179 cols
[2023-03-12 13:31:41] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-12 13:31:41] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/304 places, 157/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 179/304 places, 157/294 transitions.
Support contains 1 out of 304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 304 /304 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 304 cols
[2023-03-12 13:31:41] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-12 13:31:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 13:31:41] [INFO ] Invariant cache hit.
[2023-03-12 13:31:41] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-12 13:31:41] [INFO ] Invariant cache hit.
[2023-03-12 13:31:42] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 304/304 places, 294/294 transitions.
Treatment of property AutoFlight-PT-04b-LTLFireability-06 finished in 8032 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(G((p0&&(F(p1)||(!p0 U p2)))))))'
Support contains 3 out of 329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 314 transition count 305
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 314 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 314 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 308 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 306 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 306 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 304 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 304 transition count 294
Applied a total of 51 rules in 47 ms. Remains 304 /329 variables (removed 25) and now considering 294/320 (removed 26) transitions.
[2023-03-12 13:31:42] [INFO ] Invariant cache hit.
[2023-03-12 13:31:42] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 13:31:42] [INFO ] Invariant cache hit.
[2023-03-12 13:31:42] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-12 13:31:42] [INFO ] Invariant cache hit.
[2023-03-12 13:31:42] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/329 places, 294/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 ms. Remains : 304/329 places, 294/320 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s28 1), p1:(EQ s121 1), p2:(OR (EQ s251 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-07 finished in 746 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)&&G(p1))))'
Support contains 2 out of 329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 314 transition count 305
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 314 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 314 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 308 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 306 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 305 transition count 295
Applied a total of 49 rules in 29 ms. Remains 305 /329 variables (removed 24) and now considering 295/320 (removed 25) transitions.
// Phase 1: matrix 295 rows 305 cols
[2023-03-12 13:31:43] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-12 13:31:43] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-12 13:31:43] [INFO ] Invariant cache hit.
[2023-03-12 13:31:43] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-12 13:31:43] [INFO ] Invariant cache hit.
[2023-03-12 13:31:43] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/329 places, 295/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 305/329 places, 295/320 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s43 1), p0:(EQ s82 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-08 finished in 965 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((X(p1)||p0)))'
Support contains 3 out of 329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 315 transition count 306
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 315 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 315 transition count 305
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 310 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 310 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 308 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 306 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 306 transition count 296
Applied a total of 47 rules in 53 ms. Remains 306 /329 variables (removed 23) and now considering 296/320 (removed 24) transitions.
// Phase 1: matrix 296 rows 306 cols
[2023-03-12 13:31:44] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-12 13:31:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 13:31:44] [INFO ] Invariant cache hit.
[2023-03-12 13:31:44] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-12 13:31:44] [INFO ] Invariant cache hit.
[2023-03-12 13:31:44] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/329 places, 296/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 306/329 places, 296/320 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s297 1) (EQ s133 1)), p1:(EQ s137 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2624 reset in 200 ms.
Product exploration explored 100000 steps with 2641 reset in 172 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-12 13:31:45] [INFO ] Invariant cache hit.
[2023-03-12 13:31:45] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2023-03-12 13:31:45] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:46] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2023-03-12 13:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:31:46] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2023-03-12 13:31:46] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:46] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-03-12 13:31:46] [INFO ] Computed and/alt/rep : 295/421/295 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-12 13:31:48] [INFO ] Added : 284 causal constraints over 57 iterations in 1903 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 305 transition count 195
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 109 rules applied. Total rules applied 209 place count 205 transition count 186
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 216 place count 199 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 198 transition count 185
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 217 place count 198 transition count 144
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 299 place count 157 transition count 144
Performed 60 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 419 place count 97 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 420 place count 96 transition count 75
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 10 rules applied. Total rules applied 430 place count 89 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 433 place count 86 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 433 place count 86 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 441 place count 82 transition count 68
Applied a total of 441 rules in 21 ms. Remains 82 /306 variables (removed 224) and now considering 68/296 (removed 228) transitions.
// Phase 1: matrix 68 rows 82 cols
[2023-03-12 13:31:48] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-12 13:31:48] [INFO ] Implicit Places using invariants in 209 ms returned [33, 47, 61, 65, 70, 81]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 212 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/306 places, 68/296 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 72 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 71 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 71 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 70 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 70 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 69 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 69 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 68 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 68 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 66 transition count 58
Applied a total of 20 rules in 4 ms. Remains 66 /76 variables (removed 10) and now considering 58/68 (removed 10) transitions.
// Phase 1: matrix 58 rows 66 cols
[2023-03-12 13:31:48] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-12 13:31:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 13:31:48] [INFO ] Invariant cache hit.
[2023-03-12 13:31:48] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/306 places, 58/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 66/306 places, 58/296 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 244 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-12 13:31:49] [INFO ] Invariant cache hit.
[2023-03-12 13:31:49] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2023-03-12 13:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:49] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-12 13:31:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:31:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 13:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:49] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-12 13:31:49] [INFO ] Computed and/alt/rep : 35/55/35 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-12 13:31:49] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13330 reset in 132 ms.
Stack based approach found an accepted trace after 410 steps with 60 reset with depth 3 and stack size 3 in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-10 finished in 5768 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||(p1&&F(p0))))))'
Support contains 1 out of 329 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 315 transition count 306
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 315 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 315 transition count 305
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 309 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 309 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 307 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 307 transition count 297
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 305 transition count 295
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 305 transition count 295
Applied a total of 49 rules in 24 ms. Remains 305 /329 variables (removed 24) and now considering 295/320 (removed 25) transitions.
// Phase 1: matrix 295 rows 305 cols
[2023-03-12 13:31:49] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-12 13:31:49] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 13:31:49] [INFO ] Invariant cache hit.
[2023-03-12 13:31:50] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-12 13:31:50] [INFO ] Invariant cache hit.
[2023-03-12 13:31:50] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/329 places, 295/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 305/329 places, 295/320 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s279 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1395 reset in 154 ms.
Product exploration explored 100000 steps with 1417 reset in 142 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/305 stabilizing places and 75/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
[2023-03-12 13:31:51] [INFO ] Invariant cache hit.
[2023-03-12 13:31:51] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned sat
[2023-03-12 13:31:51] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:51] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-12 13:31:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:31:51] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2023-03-12 13:31:51] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 12 ms returned sat
[2023-03-12 13:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:52] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-12 13:31:52] [INFO ] Computed and/alt/rep : 294/420/294 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-12 13:31:53] [INFO ] Added : 276 causal constraints over 56 iterations in 1669 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 304 transition count 191
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 115 rules applied. Total rules applied 218 place count 201 transition count 179
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 226 place count 193 transition count 179
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 226 place count 193 transition count 139
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 306 place count 153 transition count 139
Performed 58 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 422 place count 95 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 423 place count 94 transition count 72
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 435 place count 86 transition count 68
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 439 place count 82 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 439 place count 82 transition count 64
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 447 place count 78 transition count 64
Applied a total of 447 rules in 20 ms. Remains 78 /305 variables (removed 227) and now considering 64/295 (removed 231) transitions.
// Phase 1: matrix 64 rows 78 cols
[2023-03-12 13:31:53] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-12 13:31:53] [INFO ] Implicit Places using invariants in 78 ms returned [30, 44, 58, 62, 72, 77]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 82 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/305 places, 64/295 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 68 transition count 60
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 68 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 67 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 66 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 64 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 62 transition count 54
Applied a total of 20 rules in 5 ms. Remains 62 /72 variables (removed 10) and now considering 54/64 (removed 10) transitions.
// Phase 1: matrix 54 rows 62 cols
[2023-03-12 13:31:53] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-12 13:31:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 13:31:53] [INFO ] Invariant cache hit.
[2023-03-12 13:31:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:31:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/305 places, 54/295 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 222 ms. Remains : 62/305 places, 54/295 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/62 stabilizing places and 4/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 296 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-12 13:31:54] [INFO ] Invariant cache hit.
[2023-03-12 13:31:54] [INFO ] [Real]Absence check using 14 positive place invariants in 47 ms returned sat
[2023-03-12 13:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:54] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-12 13:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:31:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 62 ms returned sat
[2023-03-12 13:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:31:54] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-12 13:31:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:31:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-12 13:31:54] [INFO ] Computed and/alt/rep : 39/83/39 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 13:31:55] [INFO ] Added : 29 causal constraints over 6 iterations in 93 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11320 reset in 126 ms.
Stack based approach found an accepted trace after 5628 steps with 639 reset with depth 3 and stack size 3 in 7 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-11 finished in 5474 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&&F(p1))))))'
Support contains 3 out of 329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 315 transition count 306
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 315 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 315 transition count 305
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 309 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 309 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 307 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 307 transition count 297
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 305 transition count 295
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 305 transition count 295
Applied a total of 49 rules in 15 ms. Remains 305 /329 variables (removed 24) and now considering 295/320 (removed 25) transitions.
// Phase 1: matrix 295 rows 305 cols
[2023-03-12 13:31:55] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-12 13:31:55] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-12 13:31:55] [INFO ] Invariant cache hit.
[2023-03-12 13:31:55] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-12 13:31:55] [INFO ] Invariant cache hit.
[2023-03-12 13:31:55] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/329 places, 295/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 305/329 places, 295/320 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (NEQ s42 1) (NEQ s190 1)), p0:(EQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-12 finished in 794 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((F(p0)&&G((G(p1)||(p2&&F(p0)))))))'
Support contains 3 out of 329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 328 transition count 206
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 128 rules applied. Total rules applied 241 place count 215 transition count 191
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 249 place count 207 transition count 191
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 249 place count 207 transition count 149
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 333 place count 165 transition count 149
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 342 place count 156 transition count 140
Iterating global reduction 3 with 9 rules applied. Total rules applied 351 place count 156 transition count 140
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 351 place count 156 transition count 136
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 359 place count 152 transition count 136
Performed 54 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 467 place count 98 transition count 77
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 468 place count 98 transition count 76
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 470 place count 97 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 471 place count 96 transition count 74
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 481 place count 89 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 484 place count 86 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 484 place count 86 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 492 place count 82 transition count 67
Applied a total of 492 rules in 15 ms. Remains 82 /329 variables (removed 247) and now considering 67/320 (removed 253) transitions.
// Phase 1: matrix 67 rows 82 cols
[2023-03-12 13:31:56] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-12 13:31:56] [INFO ] Implicit Places using invariants in 60 ms returned [35, 49, 63, 67, 71, 75, 81]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 61 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/329 places, 67/320 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 69 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 69 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 68 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 68 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 67 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 66 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 66 transition count 58
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 20 place count 65 transition count 57
Applied a total of 20 rules in 14 ms. Remains 65 /75 variables (removed 10) and now considering 57/67 (removed 10) transitions.
// Phase 1: matrix 57 rows 65 cols
[2023-03-12 13:31:56] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-12 13:31:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-12 13:31:56] [INFO ] Invariant cache hit.
[2023-03-12 13:31:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:31:56] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/329 places, 57/320 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 65/329 places, 57/320 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s0 0), p2:(EQ s32 0), p0:(EQ s15 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4764 reset in 268 ms.
Product exploration explored 100000 steps with 4765 reset in 285 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/65 stabilizing places and 3/57 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR p1 p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 990 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 367 steps, including 18 resets, run visited all 8 properties in 25 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR p1 p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR p1 p2))), (F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 10 factoid took 1457 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2023-03-12 13:32:00] [INFO ] Invariant cache hit.
[2023-03-12 13:32:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 13:32:00] [INFO ] Invariant cache hit.
[2023-03-12 13:32:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:32:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-12 13:32:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:32:00] [INFO ] Invariant cache hit.
[2023-03-12 13:32:00] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 65/65 places, 57/57 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/65 stabilizing places and 3/57 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT p0)), (X p0), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 1346 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 941 steps, including 44 resets, run visited all 8 properties in 14 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT p0)), (X p0), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR p1 p2))), (F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 10 factoid took 1622 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 4773 reset in 153 ms.
Product exploration explored 100000 steps with 4768 reset in 168 ms.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 57/57 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2023-03-12 13:32:05] [INFO ] Invariant cache hit.
[2023-03-12 13:32:05] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-12 13:32:05] [INFO ] Invariant cache hit.
[2023-03-12 13:32:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:32:05] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-12 13:32:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 13:32:05] [INFO ] Invariant cache hit.
[2023-03-12 13:32:05] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 65/65 places, 57/57 transitions.
Treatment of property AutoFlight-PT-04b-LTLFireability-13 finished in 9420 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)) U G(p1)))'
Support contains 2 out of 329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 328 transition count 207
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 124 rules applied. Total rules applied 236 place count 216 transition count 195
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 243 place count 210 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 209 transition count 194
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 244 place count 209 transition count 151
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 330 place count 166 transition count 151
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 341 place count 155 transition count 140
Iterating global reduction 4 with 11 rules applied. Total rules applied 352 place count 155 transition count 140
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 352 place count 155 transition count 134
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 364 place count 149 transition count 134
Performed 53 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 470 place count 96 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 471 place count 95 transition count 74
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 479 place count 89 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 481 place count 87 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 481 place count 87 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 489 place count 83 transition count 68
Applied a total of 489 rules in 14 ms. Remains 83 /329 variables (removed 246) and now considering 68/320 (removed 252) transitions.
// Phase 1: matrix 68 rows 83 cols
[2023-03-12 13:32:05] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-12 13:32:05] [INFO ] Implicit Places using invariants in 66 ms returned [33, 47, 61, 71, 76, 82]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 68 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/329 places, 68/320 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 73 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 73 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 72 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 72 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 71 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 71 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 70 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 70 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 69 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 69 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 67 transition count 58
Applied a total of 20 rules in 12 ms. Remains 67 /77 variables (removed 10) and now considering 58/68 (removed 10) transitions.
// Phase 1: matrix 58 rows 67 cols
[2023-03-12 13:32:05] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-12 13:32:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 13:32:05] [INFO ] Invariant cache hit.
[2023-03-12 13:32:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:32:05] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/329 places, 58/320 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 67/329 places, 58/320 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s30 1), p0:(EQ s59 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 36 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-15 finished in 401 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))&&(G(p1) U p2)))'
Found a Lengthening insensitive property : AutoFlight-PT-04b-LTLFireability-06
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 329 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 329/329 places, 320/320 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 329 transition count 205
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 129 rules applied. Total rules applied 244 place count 214 transition count 191
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 254 place count 206 transition count 189
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 257 place count 204 transition count 188
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 257 place count 204 transition count 147
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 339 place count 163 transition count 147
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 349 place count 153 transition count 137
Iterating global reduction 4 with 10 rules applied. Total rules applied 359 place count 153 transition count 137
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 359 place count 153 transition count 132
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 369 place count 148 transition count 132
Performed 55 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 479 place count 93 transition count 71
Applied a total of 479 rules in 12 ms. Remains 93 /329 variables (removed 236) and now considering 71/320 (removed 249) transitions.
// Phase 1: matrix 71 rows 93 cols
[2023-03-12 13:32:06] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-12 13:32:06] [INFO ] Implicit Places using invariants in 81 ms returned [30, 31, 32, 33, 34, 35, 38, 39, 53, 67, 73, 79, 85, 92]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 83 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 79/329 places, 71/320 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 79 transition count 64
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 72 transition count 64
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 67 transition count 59
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 66 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 65 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 56
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 63 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 63 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 62 transition count 54
Applied a total of 34 rules in 3 ms. Remains 62 /79 variables (removed 17) and now considering 54/71 (removed 17) transitions.
// Phase 1: matrix 54 rows 62 cols
[2023-03-12 13:32:06] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-12 13:32:06] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-12 13:32:06] [INFO ] Invariant cache hit.
[2023-03-12 13:32:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 13:32:06] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 62/329 places, 54/320 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 292 ms. Remains : 62/329 places, 54/320 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s0 1), p1:(EQ s19 1), p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5217 reset in 112 ms.
Product exploration explored 100000 steps with 5204 reset in 117 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/62 stabilizing places and 2/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 p0))), (X (OR (NOT p1) (NOT p0))), (X p0), (X (NOT (AND (NOT p2) p1 p0))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 791 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 p0))), (X (OR (NOT p1) (NOT p0))), (X p0), (X (NOT (AND (NOT p2) p1 p0))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 13 factoid took 940 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0)]
[2023-03-12 13:32:08] [INFO ] Invariant cache hit.
[2023-03-12 13:32:08] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-12 13:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:32:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 13:32:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 13:32:08] [INFO ] [Real]Added 12 Read/Feed constraints in 1 ms returned sat
[2023-03-12 13:32:08] [INFO ] Computed and/alt/rep : 53/157/53 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 13:32:09] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-12 13:32:09] [INFO ] Invariant cache hit.
[2023-03-12 13:32:09] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 13:32:09] [INFO ] Invariant cache hit.
[2023-03-12 13:32:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 13:32:09] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-12 13:32:09] [INFO ] Invariant cache hit.
[2023-03-12 13:32:09] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 62/62 places, 54/54 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/62 stabilizing places and 2/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
[2023-03-12 13:32:10] [INFO ] Invariant cache hit.
[2023-03-12 13:32:10] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 13:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:32:10] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-12 13:32:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 13:32:10] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-03-12 13:32:10] [INFO ] Computed and/alt/rep : 53/157/53 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 13:32:10] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5206 reset in 142 ms.
Product exploration explored 100000 steps with 5196 reset in 129 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 54/54 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 62 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-12 13:32:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 62 cols
[2023-03-12 13:32:11] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-12 13:32:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 54/54 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 62/62 places, 54/54 transitions.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 62 cols
[2023-03-12 13:32:11] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-12 13:32:11] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-12 13:32:11] [INFO ] Invariant cache hit.
[2023-03-12 13:32:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 13:32:11] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-12 13:32:11] [INFO ] Invariant cache hit.
[2023-03-12 13:32:11] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 62/62 places, 54/54 transitions.
Treatment of property AutoFlight-PT-04b-LTLFireability-06 finished in 5582 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((F(p0)&&G((G(p1)||(p2&&F(p0)))))))'
[2023-03-12 13:32:11] [INFO ] Flatten gal took : 12 ms
[2023-03-12 13:32:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 13:32:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 329 places, 320 transitions and 770 arcs took 2 ms.
Total runtime 43964 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2003/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2003/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-04b-LTLFireability-06
Could not compute solution for formula : AutoFlight-PT-04b-LTLFireability-13

BK_STOP 1678627932283

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-04b-LTLFireability-06
ltl formula formula --ltl=/tmp/2003/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 329 places, 320 transitions and 770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2003/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2003/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2003/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2003/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutoFlight-PT-04b-LTLFireability-13
ltl formula formula --ltl=/tmp/2003/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 329 places, 320 transitions and 770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2003/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2003/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2003/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2003/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutoFlight-PT-04b, 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 r009-oct2-167813597900428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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