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-167813598000476.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-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598000476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 266K 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-12b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678631380199

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-12b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:29:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:29:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:29:42] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-12 14:29:42] [INFO ] Transformed 1126 places.
[2023-03-12 14:29:42] [INFO ] Transformed 1124 transitions.
[2023-03-12 14:29:42] [INFO ] Found NUPN structural information;
[2023-03-12 14:29:42] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-12b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 152 places :
Symmetric choice reduction at 0 with 152 rule applications. Total rules 152 place count 974 transition count 972
Iterating global reduction 0 with 152 rules applied. Total rules applied 304 place count 974 transition count 972
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 326 place count 974 transition count 950
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 394 place count 906 transition count 882
Iterating global reduction 1 with 68 rules applied. Total rules applied 462 place count 906 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 473 place count 895 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 484 place count 895 transition count 871
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 494 place count 885 transition count 861
Iterating global reduction 1 with 10 rules applied. Total rules applied 504 place count 885 transition count 861
Applied a total of 504 rules in 395 ms. Remains 885 /1126 variables (removed 241) and now considering 861/1124 (removed 263) transitions.
// Phase 1: matrix 861 rows 885 cols
[2023-03-12 14:29:43] [INFO ] Computed 76 place invariants in 45 ms
[2023-03-12 14:29:43] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-12 14:29:43] [INFO ] Invariant cache hit.
[2023-03-12 14:29:45] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
[2023-03-12 14:29:45] [INFO ] Invariant cache hit.
[2023-03-12 14:29:45] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 885/1126 places, 861/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2824 ms. Remains : 885/1126 places, 861/1124 transitions.
Support contains 36 out of 885 places after structural reductions.
[2023-03-12 14:29:46] [INFO ] Flatten gal took : 99 ms
[2023-03-12 14:29:46] [INFO ] Flatten gal took : 57 ms
[2023-03-12 14:29:46] [INFO ] Input system was already deterministic with 861 transitions.
Support contains 35 out of 885 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 30) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 14:29:46] [INFO ] Invariant cache hit.
[2023-03-12 14:29:47] [INFO ] [Real]Absence check using 75 positive place invariants in 43 ms returned sat
[2023-03-12 14:29:47] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:29:47] [INFO ] After 536ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:4
[2023-03-12 14:29:48] [INFO ] Deduced a trap composed of 154 places in 347 ms of which 5 ms to minimize.
[2023-03-12 14:29:48] [INFO ] Deduced a trap composed of 89 places in 271 ms of which 1 ms to minimize.
[2023-03-12 14:29:49] [INFO ] Deduced a trap composed of 79 places in 450 ms of which 2 ms to minimize.
[2023-03-12 14:29:49] [INFO ] Deduced a trap composed of 149 places in 291 ms of which 6 ms to minimize.
[2023-03-12 14:29:49] [INFO ] Deduced a trap composed of 149 places in 257 ms of which 0 ms to minimize.
[2023-03-12 14:29:49] [INFO ] Deduced a trap composed of 147 places in 206 ms of which 1 ms to minimize.
[2023-03-12 14:29:50] [INFO ] Deduced a trap composed of 162 places in 311 ms of which 1 ms to minimize.
[2023-03-12 14:29:50] [INFO ] Deduced a trap composed of 198 places in 203 ms of which 2 ms to minimize.
[2023-03-12 14:29:50] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 1 ms to minimize.
[2023-03-12 14:29:50] [INFO ] Deduced a trap composed of 149 places in 220 ms of which 0 ms to minimize.
[2023-03-12 14:29:51] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 1 ms to minimize.
[2023-03-12 14:29:51] [INFO ] Deduced a trap composed of 153 places in 199 ms of which 1 ms to minimize.
[2023-03-12 14:29:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3591 ms
[2023-03-12 14:29:51] [INFO ] Deduced a trap composed of 115 places in 166 ms of which 1 ms to minimize.
[2023-03-12 14:29:51] [INFO ] Deduced a trap composed of 104 places in 185 ms of which 0 ms to minimize.
[2023-03-12 14:29:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2023-03-12 14:29:52] [INFO ] After 4810ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-12 14:29:52] [INFO ] After 5161ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-12 14:29:52] [INFO ] [Nat]Absence check using 75 positive place invariants in 67 ms returned sat
[2023-03-12 14:29:52] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:29:53] [INFO ] After 654ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-12 14:29:53] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 2 ms to minimize.
[2023-03-12 14:29:53] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 1 ms to minimize.
[2023-03-12 14:29:54] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2023-03-12 14:29:54] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 0 ms to minimize.
[2023-03-12 14:29:54] [INFO ] Deduced a trap composed of 50 places in 314 ms of which 1 ms to minimize.
[2023-03-12 14:29:54] [INFO ] Deduced a trap composed of 153 places in 199 ms of which 15 ms to minimize.
[2023-03-12 14:29:55] [INFO ] Deduced a trap composed of 149 places in 209 ms of which 1 ms to minimize.
[2023-03-12 14:29:55] [INFO ] Deduced a trap composed of 149 places in 360 ms of which 14 ms to minimize.
[2023-03-12 14:29:55] [INFO ] Deduced a trap composed of 149 places in 264 ms of which 0 ms to minimize.
[2023-03-12 14:29:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2545 ms
[2023-03-12 14:29:56] [INFO ] Deduced a trap composed of 131 places in 245 ms of which 1 ms to minimize.
[2023-03-12 14:29:56] [INFO ] Deduced a trap composed of 104 places in 184 ms of which 0 ms to minimize.
[2023-03-12 14:29:56] [INFO ] Deduced a trap composed of 132 places in 94 ms of which 0 ms to minimize.
[2023-03-12 14:29:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 671 ms
[2023-03-12 14:29:56] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 1 ms to minimize.
[2023-03-12 14:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-12 14:29:57] [INFO ] After 4671ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 310 ms.
[2023-03-12 14:29:57] [INFO ] After 5540ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 4 properties in 90 ms.
Support contains 6 out of 885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 885/885 places, 861/861 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 885 transition count 548
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 351 rules applied. Total rules applied 664 place count 572 transition count 510
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 689 place count 548 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 547 transition count 509
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 690 place count 547 transition count 406
Deduced a syphon composed of 103 places in 4 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 896 place count 444 transition count 406
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 900 place count 440 transition count 402
Iterating global reduction 4 with 4 rules applied. Total rules applied 904 place count 440 transition count 402
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 904 place count 440 transition count 400
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 908 place count 438 transition count 400
Performed 172 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 172 places in 1 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 1252 place count 266 transition count 204
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 47 times.
Iterating global reduction 4 with 47 rules applied. Total rules applied 1299 place count 266 transition count 157
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 1346 place count 219 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1347 place count 218 transition count 156
Reduce places removed 55 places and 0 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 5 with 145 rules applied. Total rules applied 1492 place count 163 transition count 66
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 91 rules applied. Total rules applied 1583 place count 73 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1584 place count 72 transition count 65
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 20 Pre rules applied. Total rules applied 1584 place count 72 transition count 45
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 1624 place count 52 transition count 45
Applied a total of 1624 rules in 176 ms. Remains 52 /885 variables (removed 833) and now considering 45/861 (removed 816) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 52/885 places, 45/861 transitions.
Finished random walk after 2344 steps, including 87 resets, run visited all 3 properties in 22 ms. (steps per millisecond=106 )
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA AutoFlight-PT-12b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 219 stabilizing places and 219 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' '!((((!p0&&X((!p0 U (p1||G(!p0))))) U G(!p1)) U X(p2)))'
Support contains 3 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 877 transition count 853
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 877 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 877 transition count 852
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 875 transition count 850
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 875 transition count 850
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 874 transition count 849
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 874 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 873 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 873 transition count 848
Applied a total of 25 rules in 288 ms. Remains 873 /885 variables (removed 12) and now considering 848/861 (removed 13) transitions.
// Phase 1: matrix 848 rows 873 cols
[2023-03-12 14:29:58] [INFO ] Computed 76 place invariants in 6 ms
[2023-03-12 14:29:59] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-12 14:29:59] [INFO ] Invariant cache hit.
[2023-03-12 14:29:59] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2023-03-12 14:29:59] [INFO ] Invariant cache hit.
[2023-03-12 14:30:00] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/885 places, 848/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1767 ms. Remains : 873/885 places, 848/861 transitions.
Stuttering acceptance computed with spot in 783 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), true, p1, (AND (NOT p1) p0), p1]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND p1 p0), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(NEQ s453 1), p0:(OR (EQ s94 1) (EQ s275 1)), p2:(NEQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 793 ms.
Product exploration explored 100000 steps with 50000 reset in 718 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 25 factoid took 666 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLFireability-01 finished in 4878 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||X(p0))))'
Support contains 1 out of 885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 884 transition count 547
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 351 rules applied. Total rules applied 664 place count 571 transition count 509
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 689 place count 547 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 546 transition count 508
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 690 place count 546 transition count 403
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 900 place count 441 transition count 403
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 905 place count 436 transition count 398
Iterating global reduction 4 with 5 rules applied. Total rules applied 910 place count 436 transition count 398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 910 place count 436 transition count 396
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 914 place count 434 transition count 396
Performed 172 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 1258 place count 262 transition count 200
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1259 place count 261 transition count 199
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1291 place count 239 transition count 189
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1301 place count 229 transition count 189
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1301 place count 229 transition count 177
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1325 place count 217 transition count 177
Applied a total of 1325 rules in 140 ms. Remains 217 /885 variables (removed 668) and now considering 177/861 (removed 684) transitions.
// Phase 1: matrix 177 rows 217 cols
[2023-03-12 14:30:03] [INFO ] Computed 54 place invariants in 2 ms
[2023-03-12 14:30:03] [INFO ] Implicit Places using invariants in 133 ms returned [89, 127, 165, 169, 173, 178, 182, 186, 190, 195, 199, 203, 207, 211, 216]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 136 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/885 places, 177/861 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 189 transition count 164
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 179 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 178 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 178 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 177 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 177 transition count 152
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 52 place count 176 transition count 151
Applied a total of 52 rules in 38 ms. Remains 176 /202 variables (removed 26) and now considering 151/177 (removed 26) transitions.
// Phase 1: matrix 151 rows 176 cols
[2023-03-12 14:30:03] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-12 14:30:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 14:30:03] [INFO ] Invariant cache hit.
[2023-03-12 14:30:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:30:03] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 176/885 places, 151/861 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 502 ms. Remains : 176/885 places, 151/861 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4323 reset in 266 ms.
Product exploration explored 100000 steps with 4417 reset in 325 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 231 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 77 ms :[(NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 140 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-12 14:30:04] [INFO ] Invariant cache hit.
[2023-03-12 14:30:05] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-12 14:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:05] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-12 14:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:30:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 21 ms returned sat
[2023-03-12 14:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:05] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-12 14:30:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:30:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-12 14:30:05] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-12 14:30:05] [INFO ] Added : 24 causal constraints over 5 iterations in 185 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 151/151 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2023-03-12 14:30:05] [INFO ] Invariant cache hit.
[2023-03-12 14:30:06] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-12 14:30:06] [INFO ] Invariant cache hit.
[2023-03-12 14:30:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:30:06] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-12 14:30:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 14:30:06] [INFO ] Invariant cache hit.
[2023-03-12 14:30:06] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 515 ms. Remains : 176/176 places, 151/151 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 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 30 ms :[(NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 187 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 92 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-12 14:30:06] [INFO ] Invariant cache hit.
[2023-03-12 14:30:06] [INFO ] [Real]Absence check using 39 positive place invariants in 6 ms returned sat
[2023-03-12 14:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:07] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-12 14:30:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:30:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 6 ms returned sat
[2023-03-12 14:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:07] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-12 14:30:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:30:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-12 14:30:07] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-12 14:30:07] [INFO ] Added : 24 causal constraints over 5 iterations in 93 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4376 reset in 332 ms.
Stack based approach found an accepted trace after 16721 steps with 725 reset with depth 25 and stack size 25 in 44 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-02 finished in 4576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (p0 U p1))||F(G(p1))))'
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 877 transition count 853
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 877 transition count 853
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 877 transition count 851
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 875 transition count 849
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 875 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 874 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 873 transition count 847
Applied a total of 26 rules in 145 ms. Remains 873 /885 variables (removed 12) and now considering 847/861 (removed 14) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-12 14:30:08] [INFO ] Computed 76 place invariants in 9 ms
[2023-03-12 14:30:08] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 14:30:08] [INFO ] Invariant cache hit.
[2023-03-12 14:30:09] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2023-03-12 14:30:09] [INFO ] Invariant cache hit.
[2023-03-12 14:30:09] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/885 places, 847/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1683 ms. Remains : 873/885 places, 847/861 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s724 1), p0:(EQ s260 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 543 steps with 0 reset in 5 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-03 finished in 1920 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 U (F(p2) U p3)))))))'
Support contains 4 out of 885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 308 transitions
Trivial Post-agglo rules discarded 308 transitions
Performed 308 trivial Post agglomeration. Transition count delta: 308
Iterating post reduction 0 with 308 rules applied. Total rules applied 308 place count 884 transition count 552
Reduce places removed 308 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 346 rules applied. Total rules applied 654 place count 576 transition count 514
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 680 place count 552 transition count 512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 682 place count 550 transition count 512
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 682 place count 550 transition count 406
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 894 place count 444 transition count 406
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 898 place count 440 transition count 402
Iterating global reduction 4 with 4 rules applied. Total rules applied 902 place count 440 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 902 place count 440 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 904 place count 439 transition count 401
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1246 place count 268 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1247 place count 267 transition count 205
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 1263 place count 256 transition count 200
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1268 place count 251 transition count 200
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 1268 place count 251 transition count 194
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1280 place count 245 transition count 194
Applied a total of 1280 rules in 56 ms. Remains 245 /885 variables (removed 640) and now considering 194/861 (removed 667) transitions.
// Phase 1: matrix 194 rows 245 cols
[2023-03-12 14:30:09] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-12 14:30:10] [INFO ] Implicit Places using invariants in 829 ms returned [102, 140, 178, 184, 190, 196, 202, 208, 221, 225, 229, 233, 244]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 834 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/885 places, 194/861 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 221 transition count 183
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 221 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 220 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 220 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 219 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 219 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 218 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 218 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 217 transition count 179
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 217 transition count 179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 216 transition count 178
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 216 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 215 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 215 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 214 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 214 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 213 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 213 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 212 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 212 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 211 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 211 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 210 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 210 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 209 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 209 transition count 171
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 206 transition count 168
Applied a total of 52 rules in 117 ms. Remains 206 /232 variables (removed 26) and now considering 168/194 (removed 26) transitions.
// Phase 1: matrix 168 rows 206 cols
[2023-03-12 14:30:10] [INFO ] Computed 52 place invariants in 3 ms
[2023-03-12 14:30:10] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-12 14:30:11] [INFO ] Invariant cache hit.
[2023-03-12 14:30:11] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-12 14:30:11] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [87, 89, 94, 96, 98]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 730 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 201/885 places, 168/861 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 201 transition count 163
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 196 transition count 163
Applied a total of 10 rules in 7 ms. Remains 196 /201 variables (removed 5) and now considering 163/168 (removed 5) transitions.
// Phase 1: matrix 163 rows 196 cols
[2023-03-12 14:30:11] [INFO ] Computed 47 place invariants in 2 ms
[2023-03-12 14:30:11] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-12 14:30:11] [INFO ] Invariant cache hit.
[2023-03-12 14:30:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-12 14:30:12] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 196/885 places, 163/861 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2235 ms. Remains : 196/885 places, 163/861 transitions.
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s181 1), p3:(EQ s194 1), p2:(EQ s95 1), p1:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 80 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-04 finished in 2698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 884 transition count 547
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 351 rules applied. Total rules applied 664 place count 571 transition count 509
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 688 place count 547 transition count 509
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 688 place count 547 transition count 403
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 900 place count 441 transition count 403
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 905 place count 436 transition count 398
Iterating global reduction 3 with 5 rules applied. Total rules applied 910 place count 436 transition count 398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 910 place count 436 transition count 396
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 914 place count 434 transition count 396
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 1256 place count 263 transition count 201
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1257 place count 262 transition count 200
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 32 rules applied. Total rules applied 1289 place count 240 transition count 190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1299 place count 230 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1299 place count 230 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1323 place count 218 transition count 178
Applied a total of 1323 rules in 88 ms. Remains 218 /885 variables (removed 667) and now considering 178/861 (removed 683) transitions.
// Phase 1: matrix 178 rows 218 cols
[2023-03-12 14:30:12] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-12 14:30:12] [INFO ] Implicit Places using invariants in 142 ms returned [88, 126, 164, 168, 172, 177, 181, 185, 189, 194, 198, 202, 212, 217]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 145 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/885 places, 178/861 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 192 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 192 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 191 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 191 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 190 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 190 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 189 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 189 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 188 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 188 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 187 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 187 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 186 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 186 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 183 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 183 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 182 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 182 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 181 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 181 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 180 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 180 transition count 154
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 52 place count 178 transition count 152
Applied a total of 52 rules in 40 ms. Remains 178 /204 variables (removed 26) and now considering 152/178 (removed 26) transitions.
// Phase 1: matrix 152 rows 178 cols
[2023-03-12 14:30:12] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-12 14:30:12] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-12 14:30:12] [INFO ] Invariant cache hit.
[2023-03-12 14:30:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:30:12] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/885 places, 152/861 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 523 ms. Remains : 178/885 places, 152/861 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2199 reset in 283 ms.
Product exploration explored 100000 steps with 2221 reset in 242 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/178 stabilizing places and 4/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 301 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 288 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 152/152 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-12 14:30:14] [INFO ] Invariant cache hit.
[2023-03-12 14:30:14] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-12 14:30:14] [INFO ] Invariant cache hit.
[2023-03-12 14:30:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:30:14] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-12 14:30:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 14:30:14] [INFO ] Invariant cache hit.
[2023-03-12 14:30:14] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 178/178 places, 152/152 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/178 stabilizing places and 4/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 278 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2217 reset in 265 ms.
Product exploration explored 100000 steps with 2205 reset in 226 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 152/152 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-12 14:30:16] [INFO ] Invariant cache hit.
[2023-03-12 14:30:16] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-12 14:30:16] [INFO ] Invariant cache hit.
[2023-03-12 14:30:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:30:16] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-12 14:30:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 14:30:16] [INFO ] Invariant cache hit.
[2023-03-12 14:30:16] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 178/178 places, 152/152 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-05 finished in 4183 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) U (G(p2) U (p3||X(p4)))))))'
Support contains 5 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 877 transition count 853
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 877 transition count 853
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 877 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 876 transition count 850
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 875 transition count 849
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 875 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 874 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 874 transition count 848
Applied a total of 24 rules in 128 ms. Remains 874 /885 variables (removed 11) and now considering 848/861 (removed 13) transitions.
// Phase 1: matrix 848 rows 874 cols
[2023-03-12 14:30:16] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-12 14:30:17] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 14:30:17] [INFO ] Invariant cache hit.
[2023-03-12 14:30:17] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
[2023-03-12 14:30:17] [INFO ] Invariant cache hit.
[2023-03-12 14:30:18] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 874/885 places, 848/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1549 ms. Remains : 874/885 places, 848/861 transitions.
Stuttering acceptance computed with spot in 530 ms :[(AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p4)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p4)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1 (NOT p4)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2 p1 (NOT p4)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p4)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p4)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p4)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p4)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p4)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p0) p2 p1 (NOT p4)), acceptance={} source=6 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s374 1), p3:(EQ s212 1), p2:(NEQ s669 1), p1:(EQ s841 1), p4:(EQ s684 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 457 reset in 223 ms.
Product exploration explored 100000 steps with 453 reset in 266 ms.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Detected a total of 212/874 stabilizing places and 212/848 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (AND (NOT p0) (NOT p3) p2 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4))))), (X (X (AND (NOT p0) p2 (NOT p4)))), (X (X (AND (NOT p0) (NOT p4)))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p0) p1 (NOT p4))))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p4)))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p4)))), (X (X (AND (NOT p0) (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1) (NOT p4))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1661 ms. Reduced automaton from 11 states, 30 edges and 5 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 276 steps, including 0 resets, run visited all 6 properties in 18 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (AND (NOT p0) (NOT p3) p2 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4))))), (X (X (AND (NOT p0) p2 (NOT p4)))), (X (X (AND (NOT p0) (NOT p4)))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p0) p1 (NOT p4))))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p4)))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p4)))), (X (X (AND (NOT p0) (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1) (NOT p4))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p2 (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p0) p2 (NOT p4)))), (F (AND (NOT p0) (NOT p2) (NOT p4)))]
Knowledge based reduction with 23 factoid took 1141 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
[2023-03-12 14:30:23] [INFO ] Invariant cache hit.
[2023-03-12 14:30:23] [INFO ] [Real]Absence check using 75 positive place invariants in 28 ms returned sat
[2023-03-12 14:30:23] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:25] [INFO ] [Real]Absence check using state equation in 1412 ms returned sat
[2023-03-12 14:30:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:30:25] [INFO ] [Nat]Absence check using 75 positive place invariants in 27 ms returned sat
[2023-03-12 14:30:25] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 14:30:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:26] [INFO ] [Nat]Absence check using state equation in 1042 ms returned sat
[2023-03-12 14:30:26] [INFO ] Computed and/alt/rep : 845/1177/845 causal constraints (skipped 2 transitions) in 58 ms.
[2023-03-12 14:30:40] [INFO ] Added : 830 causal constraints over 166 iterations in 13613 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p3) (NOT p4))
Support contains 4 out of 874 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Applied a total of 0 rules in 52 ms. Remains 874 /874 variables (removed 0) and now considering 848/848 (removed 0) transitions.
[2023-03-12 14:30:40] [INFO ] Invariant cache hit.
[2023-03-12 14:30:40] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-12 14:30:40] [INFO ] Invariant cache hit.
[2023-03-12 14:30:41] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2023-03-12 14:30:41] [INFO ] Invariant cache hit.
[2023-03-12 14:30:41] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1659 ms. Remains : 874/874 places, 848/848 transitions.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Detected a total of 212/874 stabilizing places and 212/848 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p4)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (X (X (AND (NOT p0) p2 (NOT p4)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 435 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 265 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p4)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (X (X (AND (NOT p0) p2 (NOT p4)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3)))), (F (NOT (AND (NOT p0) p2 (NOT p4)))), (F (AND (NOT p0) (NOT p2) (NOT p4)))]
Knowledge based reduction with 6 factoid took 593 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 331 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
[2023-03-12 14:30:43] [INFO ] Invariant cache hit.
[2023-03-12 14:30:44] [INFO ] [Real]Absence check using 75 positive place invariants in 30 ms returned sat
[2023-03-12 14:30:44] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-12 14:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:45] [INFO ] [Real]Absence check using state equation in 1397 ms returned sat
[2023-03-12 14:30:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:30:46] [INFO ] [Nat]Absence check using 75 positive place invariants in 28 ms returned sat
[2023-03-12 14:30:46] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:30:47] [INFO ] [Nat]Absence check using state equation in 976 ms returned sat
[2023-03-12 14:30:47] [INFO ] Computed and/alt/rep : 845/1177/845 causal constraints (skipped 2 transitions) in 96 ms.
[2023-03-12 14:31:00] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:31:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p3) (NOT p4))
Could not prove EG (AND (NOT p0) (NOT p3) (NOT p4))
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 455 reset in 203 ms.
Product exploration explored 100000 steps with 454 reset in 279 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 385 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 874 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Performed 275 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 874 transition count 848
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 299 place count 874 transition count 836
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 299 place count 874 transition count 836
Deduced a syphon composed of 401 places in 2 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 413 place count 874 transition count 836
Discarding 235 places :
Symmetric choice reduction at 2 with 235 rule applications. Total rules 648 place count 639 transition count 601
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 2 with 235 rules applied. Total rules applied 883 place count 639 transition count 601
Performed 207 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 373 places in 0 ms
Iterating global reduction 2 with 207 rules applied. Total rules applied 1090 place count 639 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1091 place count 639 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Discarding 131 places :
Symmetric choice reduction at 3 with 131 rule applications. Total rules 1222 place count 508 transition count 446
Deduced a syphon composed of 242 places in 1 ms
Iterating global reduction 3 with 131 rules applied. Total rules applied 1353 place count 508 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 243 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1354 place count 508 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1355 place count 507 transition count 445
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1356 place count 507 transition count 445
Deduced a syphon composed of 242 places in 0 ms
Applied a total of 1356 rules in 268 ms. Remains 507 /874 variables (removed 367) and now considering 445/848 (removed 403) transitions.
[2023-03-12 14:31:02] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 445 rows 507 cols
[2023-03-12 14:31:02] [INFO ] Computed 76 place invariants in 7 ms
[2023-03-12 14:31:03] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/874 places, 445/848 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 701 ms. Remains : 507/874 places, 445/848 transitions.
Support contains 4 out of 874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Applied a total of 0 rules in 73 ms. Remains 874 /874 variables (removed 0) and now considering 848/848 (removed 0) transitions.
// Phase 1: matrix 848 rows 874 cols
[2023-03-12 14:31:03] [INFO ] Computed 76 place invariants in 8 ms
[2023-03-12 14:31:03] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 14:31:03] [INFO ] Invariant cache hit.
[2023-03-12 14:31:03] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-12 14:31:03] [INFO ] Invariant cache hit.
[2023-03-12 14:31:04] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1320 ms. Remains : 874/874 places, 848/848 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-06 finished in 47817 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))))'
Support contains 1 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 876 transition count 852
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 876 transition count 852
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 874 transition count 848
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 872 transition count 846
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 872 transition count 846
Applied a total of 28 rules in 118 ms. Remains 872 /885 variables (removed 13) and now considering 846/861 (removed 15) transitions.
// Phase 1: matrix 846 rows 872 cols
[2023-03-12 14:31:04] [INFO ] Computed 76 place invariants in 6 ms
[2023-03-12 14:31:04] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-12 14:31:04] [INFO ] Invariant cache hit.
[2023-03-12 14:31:05] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2023-03-12 14:31:05] [INFO ] Invariant cache hit.
[2023-03-12 14:31:06] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/885 places, 846/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1697 ms. Remains : 872/885 places, 846/861 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s372 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 283 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-07 finished in 1839 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))))'
Support contains 1 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 876 transition count 852
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 876 transition count 852
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 874 transition count 848
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 872 transition count 846
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 872 transition count 846
Applied a total of 28 rules in 135 ms. Remains 872 /885 variables (removed 13) and now considering 846/861 (removed 15) transitions.
[2023-03-12 14:31:06] [INFO ] Invariant cache hit.
[2023-03-12 14:31:06] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-12 14:31:06] [INFO ] Invariant cache hit.
[2023-03-12 14:31:07] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2023-03-12 14:31:07] [INFO ] Invariant cache hit.
[2023-03-12 14:31:08] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/885 places, 846/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1724 ms. Remains : 872/885 places, 846/861 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s136 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 471 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-08 finished in 1891 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&&F(p1)))))'
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 877 transition count 853
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 877 transition count 853
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 877 transition count 851
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 875 transition count 849
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 875 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 874 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 873 transition count 847
Applied a total of 26 rules in 148 ms. Remains 873 /885 variables (removed 12) and now considering 847/861 (removed 14) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-12 14:31:08] [INFO ] Computed 76 place invariants in 6 ms
[2023-03-12 14:31:08] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-12 14:31:08] [INFO ] Invariant cache hit.
[2023-03-12 14:31:09] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2023-03-12 14:31:09] [INFO ] Invariant cache hit.
[2023-03-12 14:31:09] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/885 places, 847/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1603 ms. Remains : 873/885 places, 847/861 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s105 1), p1:(EQ s586 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-10 finished in 1745 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))))'
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 876 transition count 852
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 876 transition count 852
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 876 transition count 850
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 874 transition count 848
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 872 transition count 846
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 872 transition count 846
Applied a total of 28 rules in 148 ms. Remains 872 /885 variables (removed 13) and now considering 846/861 (removed 15) transitions.
// Phase 1: matrix 846 rows 872 cols
[2023-03-12 14:31:10] [INFO ] Computed 76 place invariants in 7 ms
[2023-03-12 14:31:10] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-12 14:31:10] [INFO ] Invariant cache hit.
[2023-03-12 14:31:11] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2023-03-12 14:31:11] [INFO ] Invariant cache hit.
[2023-03-12 14:31:11] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/885 places, 846/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1685 ms. Remains : 872/885 places, 846/861 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s770 1) (EQ s576 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 226 reset in 247 ms.
Product exploration explored 100000 steps with 221 reset in 224 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 468 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=234 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 14:31:13] [INFO ] Invariant cache hit.
[2023-03-12 14:31:13] [INFO ] [Real]Absence check using 75 positive place invariants in 31 ms returned sat
[2023-03-12 14:31:13] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 14:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:31:14] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2023-03-12 14:31:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:31:14] [INFO ] [Nat]Absence check using 75 positive place invariants in 29 ms returned sat
[2023-03-12 14:31:14] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:31:15] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2023-03-12 14:31:15] [INFO ] Computed and/alt/rep : 843/1175/843 causal constraints (skipped 2 transitions) in 92 ms.
[2023-03-12 14:31:28] [INFO ] Added : 833 causal constraints over 167 iterations in 13044 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 20 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-03-12 14:31:28] [INFO ] Invariant cache hit.
[2023-03-12 14:31:28] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-12 14:31:28] [INFO ] Invariant cache hit.
[2023-03-12 14:31:29] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2023-03-12 14:31:29] [INFO ] Invariant cache hit.
[2023-03-12 14:31:30] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1385 ms. Remains : 872/872 places, 846/846 transitions.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 510 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=170 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 14:31:31] [INFO ] Invariant cache hit.
[2023-03-12 14:31:31] [INFO ] [Real]Absence check using 75 positive place invariants in 81 ms returned sat
[2023-03-12 14:31:31] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 14:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:31:32] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2023-03-12 14:31:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:31:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 100 ms returned sat
[2023-03-12 14:31:33] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 27 ms returned sat
[2023-03-12 14:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:31:34] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2023-03-12 14:31:34] [INFO ] Computed and/alt/rep : 843/1175/843 causal constraints (skipped 2 transitions) in 62 ms.
[2023-03-12 14:31:48] [INFO ] Deduced a trap composed of 10 places in 439 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:31:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 219 reset in 233 ms.
Product exploration explored 100000 steps with 221 reset in 265 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 872 transition count 846
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 298 place count 872 transition count 834
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 298 place count 872 transition count 834
Deduced a syphon composed of 402 places in 1 ms
Iterating global reduction 2 with 116 rules applied. Total rules applied 414 place count 872 transition count 834
Discarding 235 places :
Symmetric choice reduction at 2 with 235 rule applications. Total rules 649 place count 637 transition count 599
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 2 with 235 rules applied. Total rules applied 884 place count 637 transition count 599
Performed 207 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 374 places in 0 ms
Iterating global reduction 2 with 207 rules applied. Total rules applied 1091 place count 637 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Discarding 132 places :
Symmetric choice reduction at 2 with 132 rule applications. Total rules 1223 place count 505 transition count 443
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 2 with 132 rules applied. Total rules applied 1355 place count 505 transition count 443
Deduced a syphon composed of 242 places in 0 ms
Applied a total of 1355 rules in 201 ms. Remains 505 /872 variables (removed 367) and now considering 443/846 (removed 403) transitions.
[2023-03-12 14:31:49] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 443 rows 505 cols
[2023-03-12 14:31:49] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-12 14:31:49] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 505/872 places, 443/846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 505/872 places, 443/846 transitions.
Support contains 2 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 20 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 872 cols
[2023-03-12 14:31:49] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-12 14:31:49] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 14:31:49] [INFO ] Invariant cache hit.
[2023-03-12 14:31:50] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2023-03-12 14:31:50] [INFO ] Invariant cache hit.
[2023-03-12 14:31:50] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1407 ms. Remains : 872/872 places, 846/846 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-11 finished in 40994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(p1) U ((!p2&&X(p1))||X(G(p1)))))))'
Support contains 4 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 877 transition count 853
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 877 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 877 transition count 852
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 875 transition count 850
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 875 transition count 850
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 874 transition count 849
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 874 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 873 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 873 transition count 848
Applied a total of 25 rules in 103 ms. Remains 873 /885 variables (removed 12) and now considering 848/861 (removed 13) transitions.
// Phase 1: matrix 848 rows 873 cols
[2023-03-12 14:31:51] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-12 14:31:51] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 14:31:51] [INFO ] Invariant cache hit.
[2023-03-12 14:31:51] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
[2023-03-12 14:31:51] [INFO ] Invariant cache hit.
[2023-03-12 14:31:52] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/885 places, 848/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1437 ms. Remains : 873/885 places, 848/861 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s376 0), p2:(AND (EQ s326 1) (EQ s664 1)), p1:(NEQ s317 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 702 ms.
Product exploration explored 100000 steps with 50000 reset in 732 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p2) p1)
Knowledge based reduction with 17 factoid took 705 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLFireability-12 finished in 3676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !p1)))'
Support contains 4 out of 885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 884 transition count 547
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 351 rules applied. Total rules applied 664 place count 571 transition count 509
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 689 place count 547 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 546 transition count 508
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 690 place count 546 transition count 405
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 896 place count 443 transition count 405
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 900 place count 439 transition count 401
Iterating global reduction 4 with 4 rules applied. Total rules applied 904 place count 439 transition count 401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 904 place count 439 transition count 399
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 908 place count 437 transition count 399
Performed 172 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 1252 place count 265 transition count 203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1253 place count 264 transition count 202
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1285 place count 242 transition count 192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1295 place count 232 transition count 192
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1295 place count 232 transition count 180
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1319 place count 220 transition count 180
Applied a total of 1319 rules in 67 ms. Remains 220 /885 variables (removed 665) and now considering 180/861 (removed 681) transitions.
// Phase 1: matrix 180 rows 220 cols
[2023-03-12 14:31:54] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-12 14:31:54] [INFO ] Implicit Places using invariants in 192 ms returned [90, 128, 166, 170, 174, 179, 183, 187, 191, 197, 202, 206, 210, 214, 219]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 195 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/885 places, 180/861 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 192 transition count 167
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 192 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 191 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 155
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 52 place count 179 transition count 154
Applied a total of 52 rules in 37 ms. Remains 179 /205 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 179 cols
[2023-03-12 14:31:54] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-12 14:31:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-12 14:31:55] [INFO ] Invariant cache hit.
[2023-03-12 14:31:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:31:55] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 179/885 places, 154/861 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 600 ms. Remains : 179/885 places, 154/861 transitions.
Stuttering acceptance computed with spot in 69 ms :[p1, true, p1]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s168 1) (EQ s8 1)), p0:(EQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2266 reset in 295 ms.
Product exploration explored 100000 steps with 2261 reset in 241 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 315 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p1, true, p1]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1222150 steps, run timeout after 3001 ms. (steps per millisecond=407 ) properties seen :{}
Probabilistic random walk after 1222150 steps, saw 147319 distinct states, run finished after 3004 ms. (steps per millisecond=406 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:31:59] [INFO ] Invariant cache hit.
[2023-03-12 14:31:59] [INFO ] [Real]Absence check using 39 positive place invariants in 4 ms returned sat
[2023-03-12 14:31:59] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 14:31:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-12 14:31:59] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 14:31:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:31:59] [INFO ] After 72ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-12 14:31:59] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 14:31:59] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 154/154 transitions.
Free-agglomeration rule applied 61 times.
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 179 transition count 93
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t106.t195 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 78 edges and 83 vertex of which 8 / 83 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 58 rules applied. Total rules applied 119 place count 76 transition count 36
Reduce places removed 55 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 189 place count 21 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 20 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 190 place count 20 transition count 20
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 192 place count 19 transition count 20
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 16 transition count 17
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 16 transition count 17
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 200 place count 15 transition count 16
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 28 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 202 place count 13 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 13 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 206 place count 13 transition count 11
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 210 place count 10 transition count 10
Applied a total of 210 rules in 22 ms. Remains 10 /179 variables (removed 169) and now considering 10/154 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 10/179 places, 10/154 transitions.
Finished random walk after 90 steps, including 7 resets, run visited all 2 properties in 2 ms. (steps per millisecond=45 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1))))
Knowledge based reduction with 9 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLFireability-13 finished in 5460 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' '!((p0 U G(!p0)))'
Support contains 1 out of 885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 884 transition count 545
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 353 rules applied. Total rules applied 668 place count 569 transition count 507
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 692 place count 545 transition count 507
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 692 place count 545 transition count 402
Deduced a syphon composed of 105 places in 10 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 902 place count 440 transition count 402
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 907 place count 435 transition count 397
Iterating global reduction 3 with 5 rules applied. Total rules applied 912 place count 435 transition count 397
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 912 place count 435 transition count 395
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 916 place count 433 transition count 395
Performed 171 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 1258 place count 262 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1259 place count 262 transition count 200
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1260 place count 261 transition count 199
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1292 place count 239 transition count 189
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1302 place count 229 transition count 189
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1302 place count 229 transition count 177
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1326 place count 217 transition count 177
Applied a total of 1326 rules in 88 ms. Remains 217 /885 variables (removed 668) and now considering 177/861 (removed 684) transitions.
// Phase 1: matrix 177 rows 217 cols
[2023-03-12 14:32:00] [INFO ] Computed 54 place invariants in 0 ms
[2023-03-12 14:32:00] [INFO ] Implicit Places using invariants in 169 ms returned [89, 127, 165, 169, 173, 178, 182, 186, 190, 195, 199, 203, 207, 211, 216]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 171 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/885 places, 177/861 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 189 transition count 164
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 179 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 178 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 178 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 177 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 177 transition count 152
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 52 place count 176 transition count 151
Applied a total of 52 rules in 23 ms. Remains 176 /202 variables (removed 26) and now considering 151/177 (removed 26) transitions.
// Phase 1: matrix 151 rows 176 cols
[2023-03-12 14:32:00] [INFO ] Computed 39 place invariants in 0 ms
[2023-03-12 14:32:00] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 14:32:00] [INFO ] Invariant cache hit.
[2023-03-12 14:32:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:32:00] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 176/885 places, 151/861 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 519 ms. Remains : 176/885 places, 151/861 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, true, p0]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1997 steps with 45 reset in 6 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-14 finished in 625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 877 transition count 853
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 877 transition count 853
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 877 transition count 851
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 875 transition count 849
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 875 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 874 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 873 transition count 847
Applied a total of 26 rules in 139 ms. Remains 873 /885 variables (removed 12) and now considering 847/861 (removed 14) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-12 14:32:00] [INFO ] Computed 76 place invariants in 7 ms
[2023-03-12 14:32:01] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-12 14:32:01] [INFO ] Invariant cache hit.
[2023-03-12 14:32:01] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2023-03-12 14:32:01] [INFO ] Invariant cache hit.
[2023-03-12 14:32:02] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/885 places, 847/861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1522 ms. Remains : 873/885 places, 847/861 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s803 1), p0:(NEQ s131 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 705 reset in 203 ms.
Product exploration explored 100000 steps with 767 reset in 223 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Detected a total of 211/873 stabilizing places and 211/847 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 494 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:32:03] [INFO ] Invariant cache hit.
[2023-03-12 14:32:03] [INFO ] [Real]Absence check using 75 positive place invariants in 27 ms returned sat
[2023-03-12 14:32:03] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:32:04] [INFO ] After 324ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:32:04] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 0 ms to minimize.
[2023-03-12 14:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-12 14:32:04] [INFO ] After 709ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:32:04] [INFO ] After 900ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:32:04] [INFO ] [Nat]Absence check using 75 positive place invariants in 68 ms returned sat
[2023-03-12 14:32:04] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 14:32:05] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:32:05] [INFO ] After 525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-12 14:32:05] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 164 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 564 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 26 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2023-03-12 14:32:06] [INFO ] Invariant cache hit.
[2023-03-12 14:32:06] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 14:32:06] [INFO ] Invariant cache hit.
[2023-03-12 14:32:07] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2023-03-12 14:32:07] [INFO ] Invariant cache hit.
[2023-03-12 14:32:07] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1551 ms. Remains : 873/873 places, 847/847 transitions.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Detected a total of 211/873 stabilizing places and 211/847 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 409 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:32:08] [INFO ] Invariant cache hit.
[2023-03-12 14:32:08] [INFO ] [Real]Absence check using 75 positive place invariants in 26 ms returned sat
[2023-03-12 14:32:08] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:32:09] [INFO ] After 285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:32:09] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2023-03-12 14:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-12 14:32:09] [INFO ] After 602ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:32:09] [INFO ] After 847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:32:09] [INFO ] [Nat]Absence check using 75 positive place invariants in 26 ms returned sat
[2023-03-12 14:32:09] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:32:09] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:32:10] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-12 14:32:10] [INFO ] After 731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 163 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 480 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 746 reset in 231 ms.
Product exploration explored 100000 steps with 825 reset in 242 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 873 transition count 847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 300 place count 873 transition count 835
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 300 place count 873 transition count 835
Deduced a syphon composed of 403 places in 2 ms
Iterating global reduction 2 with 115 rules applied. Total rules applied 415 place count 873 transition count 835
Discarding 237 places :
Symmetric choice reduction at 2 with 237 rule applications. Total rules 652 place count 636 transition count 598
Deduced a syphon composed of 166 places in 2 ms
Iterating global reduction 2 with 237 rules applied. Total rules applied 889 place count 636 transition count 598
Performed 207 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 373 places in 0 ms
Iterating global reduction 2 with 207 rules applied. Total rules applied 1096 place count 636 transition count 575
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1097 place count 636 transition count 574
Renaming transitions due to excessive name length > 1024 char.
Discarding 133 places :
Symmetric choice reduction at 3 with 133 rule applications. Total rules 1230 place count 503 transition count 441
Deduced a syphon composed of 240 places in 0 ms
Iterating global reduction 3 with 133 rules applied. Total rules applied 1363 place count 503 transition count 441
Deduced a syphon composed of 240 places in 0 ms
Applied a total of 1363 rules in 144 ms. Remains 503 /873 variables (removed 370) and now considering 441/847 (removed 406) transitions.
[2023-03-12 14:32:12] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 441 rows 503 cols
[2023-03-12 14:32:12] [INFO ] Computed 76 place invariants in 6 ms
[2023-03-12 14:32:12] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/873 places, 441/847 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 602 ms. Remains : 503/873 places, 441/847 transitions.
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 22 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-12 14:32:12] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-12 14:32:12] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 14:32:12] [INFO ] Invariant cache hit.
[2023-03-12 14:32:13] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2023-03-12 14:32:13] [INFO ] Invariant cache hit.
[2023-03-12 14:32:14] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1527 ms. Remains : 873/873 places, 847/847 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-15 finished in 13402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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) U (G(p2) U (p3||X(p4)))))))'
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))))'
Found a Shortening insensitive property : AutoFlight-PT-12b-LTLFireability-11
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 309 transitions
Trivial Post-agglo rules discarded 309 transitions
Performed 309 trivial Post agglomeration. Transition count delta: 309
Iterating post reduction 0 with 309 rules applied. Total rules applied 309 place count 884 transition count 551
Reduce places removed 309 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 347 rules applied. Total rules applied 656 place count 575 transition count 513
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 682 place count 551 transition count 511
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 684 place count 549 transition count 511
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 684 place count 549 transition count 404
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 898 place count 442 transition count 404
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 903 place count 437 transition count 399
Iterating global reduction 4 with 5 rules applied. Total rules applied 908 place count 437 transition count 399
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 908 place count 437 transition count 397
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 912 place count 435 transition count 397
Performed 170 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1252 place count 265 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1253 place count 264 transition count 202
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1285 place count 242 transition count 192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1295 place count 232 transition count 192
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1295 place count 232 transition count 180
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1319 place count 220 transition count 180
Applied a total of 1319 rules in 54 ms. Remains 220 /885 variables (removed 665) and now considering 180/861 (removed 681) transitions.
// Phase 1: matrix 180 rows 220 cols
[2023-03-12 14:32:14] [INFO ] Computed 54 place invariants in 5 ms
[2023-03-12 14:32:14] [INFO ] Implicit Places using invariants in 148 ms returned [128, 166, 170, 174, 179, 183, 193, 198, 202, 206, 210, 214, 219]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 149 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 207/885 places, 180/861 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 196 transition count 169
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 196 transition count 169
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 193 transition count 166
Applied a total of 28 rules in 17 ms. Remains 193 /207 variables (removed 14) and now considering 166/180 (removed 14) transitions.
// Phase 1: matrix 166 rows 193 cols
[2023-03-12 14:32:14] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-12 14:32:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 14:32:14] [INFO ] Invariant cache hit.
[2023-03-12 14:32:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:32:14] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 193/885 places, 166/861 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 495 ms. Remains : 193/885 places, 166/861 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s178 1) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 299 steps with 11 reset in 1 ms.
Treatment of property AutoFlight-PT-12b-LTLFireability-11 finished in 708 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Found a Lengthening insensitive property : AutoFlight-PT-12b-LTLFireability-15
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 885/885 places, 861/861 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 312 place count 884 transition count 548
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 662 place count 572 transition count 510
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 687 place count 548 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 688 place count 547 transition count 509
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 688 place count 547 transition count 403
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 900 place count 441 transition count 403
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 904 place count 437 transition count 399
Iterating global reduction 4 with 4 rules applied. Total rules applied 908 place count 437 transition count 399
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 908 place count 437 transition count 397
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 912 place count 435 transition count 397
Performed 170 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1252 place count 265 transition count 203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1253 place count 264 transition count 202
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1285 place count 242 transition count 192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1295 place count 232 transition count 192
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1295 place count 232 transition count 180
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1319 place count 220 transition count 180
Applied a total of 1319 rules in 69 ms. Remains 220 /885 variables (removed 665) and now considering 180/861 (removed 681) transitions.
// Phase 1: matrix 180 rows 220 cols
[2023-03-12 14:32:15] [INFO ] Computed 54 place invariants in 12 ms
[2023-03-12 14:32:15] [INFO ] Implicit Places using invariants in 159 ms returned [90, 128, 166, 170, 174, 179, 183, 187, 191, 202, 206, 210, 214, 219]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 173 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 206/885 places, 180/861 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 194 transition count 168
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 194 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 193 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 193 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 192 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 192 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 191 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 191 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 190 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 190 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 189 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 189 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 188 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 188 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 187 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 187 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 186 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 186 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 185 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 185 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 184 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 184 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 183 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 183 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 182 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 182 transition count 156
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 52 place count 180 transition count 154
Applied a total of 52 rules in 52 ms. Remains 180 /206 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 180 cols
[2023-03-12 14:32:15] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-12 14:32:15] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-12 14:32:15] [INFO ] Invariant cache hit.
[2023-03-12 14:32:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 14:32:15] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 180/885 places, 154/861 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 718 ms. Remains : 180/885 places, 154/861 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s170 1), p0:(NEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3796 reset in 221 ms.
Product exploration explored 100000 steps with 3804 reset in 244 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/180 stabilizing places and 6/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 471 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 36 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 504 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 180 /180 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-12 14:32:18] [INFO ] Invariant cache hit.
[2023-03-12 14:32:18] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 14:32:18] [INFO ] Invariant cache hit.
[2023-03-12 14:32:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 14:32:18] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-12 14:32:18] [INFO ] Invariant cache hit.
[2023-03-12 14:32:18] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 180/180 places, 154/154 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/180 stabilizing places and 6/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 503 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 62 steps, including 1 resets, run visited all 4 properties in 4 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 439 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 3793 reset in 325 ms.
Product exploration explored 100000 steps with 3757 reset in 244 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 154/154 transitions.
Applied a total of 0 rules in 4 ms. Remains 180 /180 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-12 14:32:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 14:32:21] [INFO ] Invariant cache hit.
[2023-03-12 14:32:21] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 180/180 places, 154/154 transitions.
Support contains 2 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 154/154 transitions.
Applied a total of 0 rules in 1 ms. Remains 180 /180 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-12 14:32:21] [INFO ] Invariant cache hit.
[2023-03-12 14:32:21] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-12 14:32:21] [INFO ] Invariant cache hit.
[2023-03-12 14:32:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 14:32:22] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-12 14:32:22] [INFO ] Invariant cache hit.
[2023-03-12 14:32:22] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 571 ms. Remains : 180/180 places, 154/154 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-15 finished in 7323 ms.
[2023-03-12 14:32:22] [INFO ] Flatten gal took : 26 ms
[2023-03-12 14:32:22] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 14:32:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 885 places, 861 transitions and 2092 arcs took 5 ms.
Total runtime 159899 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2668/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2668/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2668/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2668/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-12b-LTLFireability-05
Could not compute solution for formula : AutoFlight-PT-12b-LTLFireability-06
Could not compute solution for formula : AutoFlight-PT-12b-LTLFireability-11
Could not compute solution for formula : AutoFlight-PT-12b-LTLFireability-15

BK_STOP 1678631544103

--------------------
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-12b-LTLFireability-05
ltl formula formula --ltl=/tmp/2668/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 885 places, 861 transitions and 2092 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.040 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2668/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 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:
0: pnml2lts-mc(+0xa23f4) [0x55d394f603f4]
1: pnml2lts-mc(+0xa2496) [0x55d394f60496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fc986f2a140]
3: pnml2lts-mc(+0x405be5) [0x55d3952c3be5]
4: pnml2lts-mc(+0x16b3f9) [0x55d3950293f9]
5: pnml2lts-mc(+0x164ac4) [0x55d395022ac4]
6: pnml2lts-mc(+0x272e0a) [0x55d395130e0a]
7: pnml2lts-mc(+0xb61f0) [0x55d394f741f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fc986d7d4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fc986d7d67a]
10: pnml2lts-mc(+0xa1581) [0x55d394f5f581]
11: pnml2lts-mc(+0xa1910) [0x55d394f5f910]
12: pnml2lts-mc(+0xa32a2) [0x55d394f612a2]
13: pnml2lts-mc(+0xa50f4) [0x55d394f630f4]
14: pnml2lts-mc(+0xa516b) [0x55d394f6316b]
15: pnml2lts-mc(+0x3f34b3) [0x55d3952b14b3]
16: pnml2lts-mc(+0x7c63d) [0x55d394f3a63d]
17: pnml2lts-mc(+0x67d86) [0x55d394f25d86]
18: pnml2lts-mc(+0x60a8a) [0x55d394f1ea8a]
19: pnml2lts-mc(+0x5eb15) [0x55d394f1cb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fc986d65d0a]
21: pnml2lts-mc(+0x6075e) [0x55d394f1e75e]
ltl formula name AutoFlight-PT-12b-LTLFireability-06
ltl formula formula --ltl=/tmp/2668/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: =============================================================================
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
pnml2lts-mc( 0/ 4): Petri net has 885 places, 861 transitions and 2092 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.040 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2668/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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:
malloc_consolidate(): invalid chunk size
ltl formula name AutoFlight-PT-12b-LTLFireability-11
ltl formula formula --ltl=/tmp/2668/ltl_2_
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 885 places, 861 transitions and 2092 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.030 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2668/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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:
0: pnml2lts-mc(+0xa23f4) [0x55bb77d253f4]
1: pnml2lts-mc(+0xa2496) [0x55bb77d25496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f6c233e4140]
3: pnml2lts-mc(+0x405be5) [0x55bb78088be5]
4: pnml2lts-mc(+0x16b3f9) [0x55bb77dee3f9]
5: pnml2lts-mc(+0x164ac4) [0x55bb77de7ac4]
6: pnml2lts-mc(+0x272e0a) [0x55bb77ef5e0a]
7: pnml2lts-mc(+0xb61f0) [0x55bb77d391f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f6c232374d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f6c2323767a]
10: pnml2lts-mc(+0xa1581) [0x55bb77d24581]
11: pnml2lts-mc(+0xa1910) [0x55bb77d24910]
12: pnml2lts-mc(+0xa32a2) [0x55bb77d262a2]
13: pnml2lts-mc(+0xa50f4) [0x55bb77d280f4]
14: pnml2lts-mc(+0xa516b) [0x55bb77d2816b]
15: pnml2lts-mc(+0x3f34b3) [0x55bb780764b3]
16: pnml2lts-mc(+0x7c63d) [0x55bb77cff63d]
17: pnml2lts-mc(+0x67d86) [0x55bb77cead86]
18: pnml2lts-mc(+0x60a8a) [0x55bb77ce3a8a]
19: pnml2lts-mc(+0x5eb15) [0x55bb77ce1b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f6c2321fd0a]
21: pnml2lts-mc(+0x6075e) [0x55bb77ce375e]
ltl formula name AutoFlight-PT-12b-LTLFireability-15
ltl formula formula --ltl=/tmp/2668/ltl_3_
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
pnml2lts-mc( 0/ 4): Petri net has 885 places, 861 transitions and 2092 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.050 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2668/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

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