Execution Chart

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

Trace from the execution

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

--------------------
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 1678349458154

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:11:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:11:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:11:01] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-09 08:11:01] [INFO ] Transformed 1126 places.
[2023-03-09 08:11:01] [INFO ] Transformed 1124 transitions.
[2023-03-09 08:11:01] [INFO ] Found NUPN structural information;
[2023-03-09 08:11:01] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 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 532 ms. Remains 885 /1126 variables (removed 241) and now considering 861/1124 (removed 263) transitions.
// Phase 1: matrix 861 rows 885 cols
[2023-03-09 08:11:02] [INFO ] Computed 76 place invariants in 19 ms
[2023-03-09 08:11:03] [INFO ] Implicit Places using invariants in 1397 ms returned []
[2023-03-09 08:11:03] [INFO ] Invariant cache hit.
[2023-03-09 08:11:05] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 2970 ms to find 0 implicit places.
[2023-03-09 08:11:05] [INFO ] Invariant cache hit.
[2023-03-09 08:11:05] [INFO ] Dead Transitions using invariants and state equation in 503 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 4007 ms. Remains : 885/1126 places, 861/1124 transitions.
Support contains 36 out of 885 places after structural reductions.
[2023-03-09 08:11:06] [INFO ] Flatten gal took : 90 ms
[2023-03-09 08:11:06] [INFO ] Flatten gal took : 49 ms
[2023-03-09 08:11:06] [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 506 ms. (steps per millisecond=19 ) properties (out of 30) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-09 08:11:07] [INFO ] Invariant cache hit.
[2023-03-09 08:11:07] [INFO ] [Real]Absence check using 75 positive place invariants in 37 ms returned sat
[2023-03-09 08:11:07] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 08:11:08] [INFO ] After 534ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:3
[2023-03-09 08:11:09] [INFO ] Deduced a trap composed of 73 places in 875 ms of which 7 ms to minimize.
[2023-03-09 08:11:09] [INFO ] Deduced a trap composed of 158 places in 626 ms of which 1 ms to minimize.
[2023-03-09 08:11:10] [INFO ] Deduced a trap composed of 153 places in 468 ms of which 14 ms to minimize.
[2023-03-09 08:11:10] [INFO ] Deduced a trap composed of 153 places in 331 ms of which 1 ms to minimize.
[2023-03-09 08:11:11] [INFO ] Deduced a trap composed of 153 places in 628 ms of which 2 ms to minimize.
[2023-03-09 08:11:11] [INFO ] Deduced a trap composed of 153 places in 454 ms of which 0 ms to minimize.
[2023-03-09 08:11:12] [INFO ] Deduced a trap composed of 149 places in 221 ms of which 1 ms to minimize.
[2023-03-09 08:11:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3916 ms
[2023-03-09 08:11:12] [INFO ] Deduced a trap composed of 131 places in 233 ms of which 6 ms to minimize.
[2023-03-09 08:11:12] [INFO ] Deduced a trap composed of 104 places in 234 ms of which 1 ms to minimize.
[2023-03-09 08:11:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 650 ms
[2023-03-09 08:11:13] [INFO ] After 5363ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-09 08:11:13] [INFO ] After 5807ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-09 08:11:13] [INFO ] [Nat]Absence check using 75 positive place invariants in 139 ms returned sat
[2023-03-09 08:11:13] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 08:11:14] [INFO ] After 1002ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-09 08:11:15] [INFO ] Deduced a trap composed of 133 places in 330 ms of which 0 ms to minimize.
[2023-03-09 08:11:15] [INFO ] Deduced a trap composed of 141 places in 493 ms of which 1 ms to minimize.
[2023-03-09 08:11:16] [INFO ] Deduced a trap composed of 153 places in 298 ms of which 1 ms to minimize.
[2023-03-09 08:11:16] [INFO ] Deduced a trap composed of 149 places in 204 ms of which 1 ms to minimize.
[2023-03-09 08:11:16] [INFO ] Deduced a trap composed of 126 places in 364 ms of which 2 ms to minimize.
[2023-03-09 08:11:17] [INFO ] Deduced a trap composed of 34 places in 396 ms of which 0 ms to minimize.
[2023-03-09 08:11:17] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 0 ms to minimize.
[2023-03-09 08:11:17] [INFO ] Deduced a trap composed of 109 places in 365 ms of which 0 ms to minimize.
[2023-03-09 08:11:18] [INFO ] Deduced a trap composed of 118 places in 476 ms of which 2 ms to minimize.
[2023-03-09 08:11:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3756 ms
[2023-03-09 08:11:18] [INFO ] Deduced a trap composed of 104 places in 340 ms of which 1 ms to minimize.
[2023-03-09 08:11:19] [INFO ] Deduced a trap composed of 122 places in 294 ms of which 1 ms to minimize.
[2023-03-09 08:11:19] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 2 ms to minimize.
[2023-03-09 08:11:19] [INFO ] Deduced a trap composed of 132 places in 215 ms of which 0 ms to minimize.
[2023-03-09 08:11:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1253 ms
[2023-03-09 08:11:20] [INFO ] Deduced a trap composed of 123 places in 256 ms of which 3 ms to minimize.
[2023-03-09 08:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2023-03-09 08:11:20] [INFO ] After 6885ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 366 ms.
[2023-03-09 08:11:20] [INFO ] After 7811ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 97 ms.
Support contains 4 out of 885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 885/885 places, 861/861 transitions.
Drop transitions removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 885 transition count 547
Reduce places removed 314 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 352 rules applied. Total rules applied 666 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 691 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 692 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 692 place count 546 transition count 405
Deduced a syphon composed of 103 places in 2 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 898 place count 443 transition count 405
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 902 place count 439 transition count 401
Iterating global reduction 4 with 4 rules applied. Total rules applied 906 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 906 place count 439 transition count 399
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 910 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 1254 place count 265 transition count 203
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 1301 place count 265 transition count 156
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 1348 place count 218 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1349 place count 217 transition count 155
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 5 with 150 rules applied. Total rules applied 1499 place count 161 transition count 61
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 6 with 94 rules applied. Total rules applied 1593 place count 67 transition count 61
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 1593 place count 67 transition count 42
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 1631 place count 48 transition count 42
Applied a total of 1631 rules in 137 ms. Remains 48 /885 variables (removed 837) and now considering 42/861 (removed 819) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 48/885 places, 42/861 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :1
Finished Best-First random walk after 1413 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=706 )
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 141 ms. Remains 873 /885 variables (removed 12) and now considering 848/861 (removed 13) transitions.
// Phase 1: matrix 848 rows 873 cols
[2023-03-09 08:11:22] [INFO ] Computed 76 place invariants in 19 ms
[2023-03-09 08:11:22] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-09 08:11:22] [INFO ] Invariant cache hit.
[2023-03-09 08:11:23] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2023-03-09 08:11:23] [INFO ] Invariant cache hit.
[2023-03-09 08:11:24] [INFO ] Dead Transitions using invariants and state equation in 545 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 2224 ms. Remains : 873/885 places, 848/861 transitions.
Stuttering acceptance computed with spot in 989 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 816 ms.
Product exploration explored 100000 steps with 50000 reset in 801 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 726 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 5711 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 3 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 1 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 154 ms. Remains 217 /885 variables (removed 668) and now considering 177/861 (removed 684) transitions.
// Phase 1: matrix 177 rows 217 cols
[2023-03-09 08:11:27] [INFO ] Computed 54 place invariants in 3 ms
[2023-03-09 08:11:28] [INFO ] Implicit Places using invariants in 539 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 541 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 55 ms. Remains 176 /202 variables (removed 26) and now considering 151/177 (removed 26) transitions.
// Phase 1: matrix 151 rows 176 cols
[2023-03-09 08:11:28] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-09 08:11:28] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-09 08:11:28] [INFO ] Invariant cache hit.
[2023-03-09 08:11:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:11:28] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 591 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 1341 ms. Remains : 176/885 places, 151/861 transitions.
Stuttering acceptance computed with spot in 62 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 4322 reset in 346 ms.
Product exploration explored 100000 steps with 4313 reset in 345 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 183 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 82 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
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 166 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 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2023-03-09 08:11:30] [INFO ] Invariant cache hit.
[2023-03-09 08:11:30] [INFO ] [Real]Absence check using 39 positive place invariants in 9 ms returned sat
[2023-03-09 08:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:30] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-09 08:11:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:30] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-09 08:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:30] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-09 08:11:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:11:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2023-03-09 08:11:30] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-09 08:11:31] [INFO ] Added : 24 causal constraints over 5 iterations in 167 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 12 ms. Remains 176 /176 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2023-03-09 08:11:31] [INFO ] Invariant cache hit.
[2023-03-09 08:11:31] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-09 08:11:31] [INFO ] Invariant cache hit.
[2023-03-09 08:11:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:11:31] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-09 08:11:31] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 08:11:31] [INFO ] Invariant cache hit.
[2023-03-09 08:11:31] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 677 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 213 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 75 ms :[(NOT p0)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
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 250 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 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
[2023-03-09 08:11:32] [INFO ] Invariant cache hit.
[2023-03-09 08:11:32] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 08:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:32] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-09 08:11:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:11:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-09 08:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:11:33] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-09 08:11:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:11:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:11:33] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-09 08:11:33] [INFO ] Added : 24 causal constraints over 5 iterations in 101 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 4374 reset in 317 ms.
Product exploration explored 100000 steps with 4357 reset in 280 ms.
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 5 ms. Remains 176 /176 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2023-03-09 08:11:34] [INFO ] Invariant cache hit.
[2023-03-09 08:11:34] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-09 08:11:34] [INFO ] Invariant cache hit.
[2023-03-09 08:11:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:11:34] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-09 08:11:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:11:34] [INFO ] Invariant cache hit.
[2023-03-09 08:11:34] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 806 ms. Remains : 176/176 places, 151/151 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-02 finished in 7409 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 290 ms. Remains 873 /885 variables (removed 12) and now considering 847/861 (removed 14) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-09 08:11:35] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-09 08:11:35] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-09 08:11:35] [INFO ] Invariant cache hit.
[2023-03-09 08:11:36] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
[2023-03-09 08:11:36] [INFO ] Invariant cache hit.
[2023-03-09 08:11:37] [INFO ] Dead Transitions using invariants and state equation in 828 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 2399 ms. Remains : 873/885 places, 847/861 transitions.
Stuttering acceptance computed with spot in 219 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 539 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 2655 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 1 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 1 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 108 ms. Remains 245 /885 variables (removed 640) and now considering 194/861 (removed 667) transitions.
// Phase 1: matrix 194 rows 245 cols
[2023-03-09 08:11:37] [INFO ] Computed 65 place invariants in 3 ms
[2023-03-09 08:11:37] [INFO ] Implicit Places using invariants in 241 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 242 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 72 ms. Remains 206 /232 variables (removed 26) and now considering 168/194 (removed 26) transitions.
// Phase 1: matrix 168 rows 206 cols
[2023-03-09 08:11:38] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-09 08:11:38] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-09 08:11:38] [INFO ] Invariant cache hit.
[2023-03-09 08:11:38] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-09 08:11:38] [INFO ] Implicit Places using invariants and state equation in 570 ms returned [87, 89, 94, 96, 98]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 779 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 1 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 15 ms. Remains 196 /201 variables (removed 5) and now considering 163/168 (removed 5) transitions.
// Phase 1: matrix 163 rows 196 cols
[2023-03-09 08:11:38] [INFO ] Computed 47 place invariants in 2 ms
[2023-03-09 08:11:39] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-09 08:11:39] [INFO ] Invariant cache hit.
[2023-03-09 08:11:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 08:11:39] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 747 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 1963 ms. Remains : 196/885 places, 163/861 transitions.
Stuttering acceptance computed with spot in 436 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 124 steps with 10 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-04 finished in 2452 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 83 ms. Remains 218 /885 variables (removed 667) and now considering 178/861 (removed 683) transitions.
// Phase 1: matrix 178 rows 218 cols
[2023-03-09 08:11:40] [INFO ] Computed 54 place invariants in 2 ms
[2023-03-09 08:11:40] [INFO ] Implicit Places using invariants in 177 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 179 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 39 ms. Remains 178 /204 variables (removed 26) and now considering 152/178 (removed 26) transitions.
// Phase 1: matrix 152 rows 178 cols
[2023-03-09 08:11:40] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-09 08:11:40] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-09 08:11:40] [INFO ] Invariant cache hit.
[2023-03-09 08:11:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:11:43] [INFO ] Implicit Places using invariants and state equation in 2915 ms returned []
Implicit Place search using SMT with State Equation took 3061 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 3364 ms. Remains : 178/885 places, 152/861 transitions.
Stuttering acceptance computed with spot in 79 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 2207 reset in 337 ms.
Product exploration explored 100000 steps with 2208 reset in 329 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 192 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 57 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 328 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 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 5 ms. Remains 178 /178 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-09 08:11:44] [INFO ] Invariant cache hit.
[2023-03-09 08:11:45] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-09 08:11:45] [INFO ] Invariant cache hit.
[2023-03-09 08:11:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:11:45] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2023-03-09 08:11:45] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 08:11:45] [INFO ] Invariant cache hit.
[2023-03-09 08:11:47] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2224 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 293 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
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 330 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 72 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2204 reset in 259 ms.
Product exploration explored 100000 steps with 2203 reset in 239 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 5 ms. Remains 178 /178 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-09 08:11:48] [INFO ] Invariant cache hit.
[2023-03-09 08:11:48] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-09 08:11:48] [INFO ] Invariant cache hit.
[2023-03-09 08:11:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:11:48] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-09 08:11:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:11:49] [INFO ] Invariant cache hit.
[2023-03-09 08:11:49] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 749 ms. Remains : 178/178 places, 152/152 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-05 finished in 9305 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 162 ms. Remains 874 /885 variables (removed 11) and now considering 848/861 (removed 13) transitions.
// Phase 1: matrix 848 rows 874 cols
[2023-03-09 08:11:49] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-09 08:11:49] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-09 08:11:49] [INFO ] Invariant cache hit.
[2023-03-09 08:11:51] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
[2023-03-09 08:11:51] [INFO ] Invariant cache hit.
[2023-03-09 08:11:52] [INFO ] Dead Transitions using invariants and state equation in 991 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 2731 ms. Remains : 874/885 places, 848/861 transitions.
Stuttering acceptance computed with spot in 747 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 453 reset in 233 ms.
Product exploration explored 100000 steps with 458 reset in 300 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 1932 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 425 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 225 steps, including 0 resets, run visited all 6 properties in 36 ms. (steps per millisecond=6 )
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 2145 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 401 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 425 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-09 08:11:58] [INFO ] Invariant cache hit.
[2023-03-09 08:11:59] [INFO ] [Real]Absence check using 75 positive place invariants in 33 ms returned sat
[2023-03-09 08:11:59] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 23 ms returned sat
[2023-03-09 08:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:12:01] [INFO ] [Real]Absence check using state equation in 1638 ms returned sat
[2023-03-09 08:12:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:12:01] [INFO ] [Nat]Absence check using 75 positive place invariants in 55 ms returned sat
[2023-03-09 08:12:01] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-09 08:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:12:03] [INFO ] [Nat]Absence check using state equation in 1437 ms returned sat
[2023-03-09 08:12:03] [INFO ] Computed and/alt/rep : 845/1177/845 causal constraints (skipped 2 transitions) in 99 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-09 08:12:16] [INFO ] Deduced a trap composed of 8 places in 519 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:251)
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-09 08:12:16] [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))
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 34 ms. Remains 874 /874 variables (removed 0) and now considering 848/848 (removed 0) transitions.
[2023-03-09 08:12:16] [INFO ] Invariant cache hit.
[2023-03-09 08:12:17] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-09 08:12:17] [INFO ] Invariant cache hit.
[2023-03-09 08:12:17] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2023-03-09 08:12:17] [INFO ] Invariant cache hit.
[2023-03-09 08:12:18] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1652 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 332 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 390 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 263 steps, including 0 resets, run visited all 6 properties in 7 ms. (steps per millisecond=37 )
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 594 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 451 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 433 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-09 08:12:20] [INFO ] Invariant cache hit.
[2023-03-09 08:12:21] [INFO ] [Real]Absence check using 75 positive place invariants in 38 ms returned sat
[2023-03-09 08:12:21] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-09 08:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:12:22] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2023-03-09 08:12:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:12:23] [INFO ] [Nat]Absence check using 75 positive place invariants in 29 ms returned sat
[2023-03-09 08:12:23] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-09 08:12:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:12:24] [INFO ] [Nat]Absence check using state equation in 1404 ms returned sat
[2023-03-09 08:12:24] [INFO ] Computed and/alt/rep : 845/1177/845 causal constraints (skipped 2 transitions) in 132 ms.
[2023-03-09 08:12:37] [INFO ] Added : 710 causal constraints over 142 iterations in 13144 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p3) (NOT p4))
Stuttering acceptance computed with spot in 369 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 453 reset in 261 ms.
Product exploration explored 100000 steps with 456 reset in 321 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 293 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 1 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 0 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 1 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 227 ms. Remains 507 /874 variables (removed 367) and now considering 445/848 (removed 403) transitions.
[2023-03-09 08:12:39] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 445 rows 507 cols
[2023-03-09 08:12:39] [INFO ] Computed 76 place invariants in 8 ms
[2023-03-09 08:12:39] [INFO ] Dead Transitions using invariants and state equation in 320 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 560 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 19 ms. Remains 874 /874 variables (removed 0) and now considering 848/848 (removed 0) transitions.
// Phase 1: matrix 848 rows 874 cols
[2023-03-09 08:12:40] [INFO ] Computed 76 place invariants in 10 ms
[2023-03-09 08:12:40] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-09 08:12:40] [INFO ] Invariant cache hit.
[2023-03-09 08:12:41] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
[2023-03-09 08:12:41] [INFO ] Invariant cache hit.
[2023-03-09 08:12:42] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2265 ms. Remains : 874/874 places, 848/848 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-06 finished in 52969 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 141 ms. Remains 872 /885 variables (removed 13) and now considering 846/861 (removed 15) transitions.
// Phase 1: matrix 846 rows 872 cols
[2023-03-09 08:12:42] [INFO ] Computed 76 place invariants in 3 ms
[2023-03-09 08:12:42] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-09 08:12:42] [INFO ] Invariant cache hit.
[2023-03-09 08:12:43] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
[2023-03-09 08:12:43] [INFO ] Invariant cache hit.
[2023-03-09 08:12:44] [INFO ] Dead Transitions using invariants and state equation in 784 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 2105 ms. Remains : 872/885 places, 846/861 transitions.
Stuttering acceptance computed with spot in 153 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 194 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 2281 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 144 ms. Remains 872 /885 variables (removed 13) and now considering 846/861 (removed 15) transitions.
[2023-03-09 08:12:44] [INFO ] Invariant cache hit.
[2023-03-09 08:12:45] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-09 08:12:45] [INFO ] Invariant cache hit.
[2023-03-09 08:12:46] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2023-03-09 08:12:46] [INFO ] Invariant cache hit.
[2023-03-09 08:12:47] [INFO ] Dead Transitions using invariants and state equation in 788 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 2802 ms. Remains : 872/885 places, 846/861 transitions.
Stuttering acceptance computed with spot in 255 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 469 steps with 0 reset in 4 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-08 finished in 3077 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 167 ms. Remains 873 /885 variables (removed 12) and now considering 847/861 (removed 14) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-09 08:12:47] [INFO ] Computed 76 place invariants in 7 ms
[2023-03-09 08:12:48] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-09 08:12:48] [INFO ] Invariant cache hit.
[2023-03-09 08:12:49] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
[2023-03-09 08:12:49] [INFO ] Invariant cache hit.
[2023-03-09 08:12:49] [INFO ] Dead Transitions using invariants and state equation in 576 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 2201 ms. Remains : 873/885 places, 847/861 transitions.
Stuttering acceptance computed with spot in 167 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 2406 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 177 ms. Remains 872 /885 variables (removed 13) and now considering 846/861 (removed 15) transitions.
// Phase 1: matrix 846 rows 872 cols
[2023-03-09 08:12:50] [INFO ] Computed 76 place invariants in 5 ms
[2023-03-09 08:12:50] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-09 08:12:50] [INFO ] Invariant cache hit.
[2023-03-09 08:12:51] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2023-03-09 08:12:51] [INFO ] Invariant cache hit.
[2023-03-09 08:12:52] [INFO ] Dead Transitions using invariants and state equation in 571 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 2403 ms. Remains : 872/885 places, 846/861 transitions.
Stuttering acceptance computed with spot in 122 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 218 reset in 335 ms.
Product exploration explored 100000 steps with 222 reset in 327 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 229 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 194 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 527 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=175 )
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 238 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 297 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 08:12:54] [INFO ] Invariant cache hit.
[2023-03-09 08:12:54] [INFO ] [Real]Absence check using 75 positive place invariants in 33 ms returned sat
[2023-03-09 08:12:54] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-09 08:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:12:56] [INFO ] [Real]Absence check using state equation in 1753 ms returned sat
[2023-03-09 08:12:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:12:57] [INFO ] [Nat]Absence check using 75 positive place invariants in 32 ms returned sat
[2023-03-09 08:12:57] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 08:12:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:12:58] [INFO ] [Nat]Absence check using state equation in 1134 ms returned sat
[2023-03-09 08:12:58] [INFO ] Computed and/alt/rep : 843/1175/843 causal constraints (skipped 2 transitions) in 75 ms.
[2023-03-09 08:13:11] [INFO ] Added : 810 causal constraints over 162 iterations in 13360 ms. Result :unknown
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 43 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-03-09 08:13:11] [INFO ] Invariant cache hit.
[2023-03-09 08:13:12] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-09 08:13:12] [INFO ] Invariant cache hit.
[2023-03-09 08:13:12] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2023-03-09 08:13:12] [INFO ] Invariant cache hit.
[2023-03-09 08:13:13] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1543 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 126 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 388 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=194 )
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 240 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 212 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 08:13:14] [INFO ] Invariant cache hit.
[2023-03-09 08:13:14] [INFO ] [Real]Absence check using 75 positive place invariants in 59 ms returned sat
[2023-03-09 08:13:14] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-09 08:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:13:16] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2023-03-09 08:13:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:13:16] [INFO ] [Nat]Absence check using 75 positive place invariants in 77 ms returned sat
[2023-03-09 08:13:16] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-09 08:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:13:18] [INFO ] [Nat]Absence check using state equation in 1539 ms returned sat
[2023-03-09 08:13:18] [INFO ] Computed and/alt/rep : 843/1175/843 causal constraints (skipped 2 transitions) in 114 ms.
[2023-03-09 08:13:31] [INFO ] Added : 670 causal constraints over 134 iterations in 12678 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 223 reset in 302 ms.
Product exploration explored 100000 steps with 221 reset in 284 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 211 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 2 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 1 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 1 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 197 ms. Remains 505 /872 variables (removed 367) and now considering 443/846 (removed 403) transitions.
[2023-03-09 08:13:32] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 443 rows 505 cols
[2023-03-09 08:13:32] [INFO ] Computed 76 place invariants in 6 ms
[2023-03-09 08:13:32] [INFO ] Dead Transitions using invariants and state equation in 269 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 484 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 22 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 872 cols
[2023-03-09 08:13:32] [INFO ] Computed 76 place invariants in 3 ms
[2023-03-09 08:13:33] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-09 08:13:33] [INFO ] Invariant cache hit.
[2023-03-09 08:13:34] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2023-03-09 08:13:34] [INFO ] Invariant cache hit.
[2023-03-09 08:13:35] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2473 ms. Remains : 872/872 places, 846/846 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-11 finished in 45246 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 191 ms. Remains 873 /885 variables (removed 12) and now considering 848/861 (removed 13) transitions.
// Phase 1: matrix 848 rows 873 cols
[2023-03-09 08:13:35] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-09 08:13:35] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-09 08:13:35] [INFO ] Invariant cache hit.
[2023-03-09 08:13:36] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-09 08:13:36] [INFO ] Invariant cache hit.
[2023-03-09 08:13:37] [INFO ] Dead Transitions using invariants and state equation in 902 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 2330 ms. Remains : 873/885 places, 848/861 transitions.
Stuttering acceptance computed with spot in 166 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 681 ms.
Product exploration explored 100000 steps with 50000 reset in 706 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 792 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 4717 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 81 ms. Remains 220 /885 variables (removed 665) and now considering 180/861 (removed 681) transitions.
// Phase 1: matrix 180 rows 220 cols
[2023-03-09 08:13:40] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-09 08:13:40] [INFO ] Implicit Places using invariants in 298 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 312 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 42 ms. Remains 179 /205 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 179 cols
[2023-03-09 08:13:40] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-09 08:13:40] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-09 08:13:40] [INFO ] Invariant cache hit.
[2023-03-09 08:13:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:13:40] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 364 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 800 ms. Remains : 179/885 places, 154/861 transitions.
Stuttering acceptance computed with spot in 171 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 2253 reset in 271 ms.
Product exploration explored 100000 steps with 2250 reset in 253 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 565 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 227 ms :[p1, true, p1]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 793541 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :{}
Probabilistic random walk after 793541 steps, saw 98602 distinct states, run finished after 3003 ms. (steps per millisecond=264 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:13:45] [INFO ] Invariant cache hit.
[2023-03-09 08:13:45] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-09 08:13:45] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 08:13:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 164 ms returned sat
[2023-03-09 08:13:46] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 08:13:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:13:46] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-09 08:13:46] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-09 08:13:46] [INFO ] After 1053ms 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 9 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 2 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 27 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 27 ms. Remains : 10/179 places, 10/154 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
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 154 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 6935 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 1 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 90 ms. Remains 217 /885 variables (removed 668) and now considering 177/861 (removed 684) transitions.
// Phase 1: matrix 177 rows 217 cols
[2023-03-09 08:13:47] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-09 08:13:47] [INFO ] Implicit Places using invariants in 205 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 206 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 27 ms. Remains 176 /202 variables (removed 26) and now considering 151/177 (removed 26) transitions.
// Phase 1: matrix 151 rows 176 cols
[2023-03-09 08:13:47] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-09 08:13:47] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 08:13:47] [INFO ] Invariant cache hit.
[2023-03-09 08:13:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:13:47] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 527 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 853 ms. Remains : 176/885 places, 151/861 transitions.
Stuttering acceptance computed with spot in 157 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 1757 steps with 40 reset in 7 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-14 finished in 1041 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 190 ms. Remains 873 /885 variables (removed 12) and now considering 847/861 (removed 14) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-09 08:13:48] [INFO ] Computed 76 place invariants in 6 ms
[2023-03-09 08:13:48] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-09 08:13:48] [INFO ] Invariant cache hit.
[2023-03-09 08:13:54] [INFO ] Implicit Places using invariants and state equation in 5683 ms returned []
Implicit Place search using SMT with State Equation took 6395 ms to find 0 implicit places.
[2023-03-09 08:13:54] [INFO ] Invariant cache hit.
[2023-03-09 08:13:55] [INFO ] Dead Transitions using invariants and state equation in 729 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 7315 ms. Remains : 873/885 places, 847/861 transitions.
Stuttering acceptance computed with spot in 205 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 803 reset in 291 ms.
Product exploration explored 100000 steps with 805 reset in 266 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 465 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 363 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:13:57] [INFO ] Invariant cache hit.
[2023-03-09 08:13:57] [INFO ] [Real]Absence check using 75 positive place invariants in 41 ms returned sat
[2023-03-09 08:13:57] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:13:57] [INFO ] After 482ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:13:58] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 1 ms to minimize.
[2023-03-09 08:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-09 08:13:58] [INFO ] After 918ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:13:58] [INFO ] After 1180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:13:58] [INFO ] [Nat]Absence check using 75 positive place invariants in 81 ms returned sat
[2023-03-09 08:13:58] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-09 08:13:58] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:13:58] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-09 08:13:59] [INFO ] After 780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 161 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 3 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 523 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 295 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 252 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 29 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2023-03-09 08:14:00] [INFO ] Invariant cache hit.
[2023-03-09 08:14:00] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-09 08:14:00] [INFO ] Invariant cache hit.
[2023-03-09 08:14:02] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
[2023-03-09 08:14:02] [INFO ] Invariant cache hit.
[2023-03-09 08:14:02] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2631 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 455 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 294 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:14:03] [INFO ] Invariant cache hit.
[2023-03-09 08:14:04] [INFO ] [Real]Absence check using 75 positive place invariants in 86 ms returned sat
[2023-03-09 08:14:04] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 08:14:04] [INFO ] After 484ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:14:04] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 1 ms to minimize.
[2023-03-09 08:14:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2023-03-09 08:14:04] [INFO ] After 883ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:14:04] [INFO ] After 1303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:14:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 26 ms returned sat
[2023-03-09 08:14:05] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:14:05] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:14:05] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-09 08:14:05] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 160 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 2 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 782 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 272 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 718 reset in 280 ms.
Product exploration explored 100000 steps with 760 reset in 286 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 279 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 1 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 154 ms. Remains 503 /873 variables (removed 370) and now considering 441/847 (removed 406) transitions.
[2023-03-09 08:14:08] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 441 rows 503 cols
[2023-03-09 08:14:08] [INFO ] Computed 76 place invariants in 11 ms
[2023-03-09 08:14:08] [INFO ] Dead Transitions using invariants and state equation in 402 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 583 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 23 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-09 08:14:08] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-09 08:14:09] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-09 08:14:09] [INFO ] Invariant cache hit.
[2023-03-09 08:14:10] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2023-03-09 08:14:10] [INFO ] Invariant cache hit.
[2023-03-09 08:14:10] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1717 ms. Remains : 873/873 places, 847/847 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-15 finished in 22682 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))))'
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 167 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 2 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 2 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 79 ms. Remains 220 /885 variables (removed 665) and now considering 180/861 (removed 681) transitions.
// Phase 1: matrix 180 rows 220 cols
[2023-03-09 08:14:11] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-09 08:14:11] [INFO ] Implicit Places using invariants in 212 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 226 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 6 ms. Remains 193 /207 variables (removed 14) and now considering 166/180 (removed 14) transitions.
// Phase 1: matrix 166 rows 193 cols
[2023-03-09 08:14:11] [INFO ] Computed 41 place invariants in 0 ms
[2023-03-09 08:14:11] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-09 08:14:11] [INFO ] Invariant cache hit.
[2023-03-09 08:14:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:14:11] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 455 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 766 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 138 steps with 4 reset in 0 ms.
Treatment of property AutoFlight-PT-12b-LTLFireability-11 finished in 1056 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 277 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 1 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 135 ms. Remains 220 /885 variables (removed 665) and now considering 180/861 (removed 681) transitions.
// Phase 1: matrix 180 rows 220 cols
[2023-03-09 08:14:12] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-09 08:14:12] [INFO ] Implicit Places using invariants in 245 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 259 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 46 ms. Remains 180 /206 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 180 cols
[2023-03-09 08:14:12] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-09 08:14:12] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-09 08:14:12] [INFO ] Invariant cache hit.
[2023-03-09 08:14:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 08:14:13] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 388 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 837 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 3869 reset in 264 ms.
Product exploration explored 100000 steps with 3798 reset in 271 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 771 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 359 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 139 steps, including 2 resets, run visited all 4 properties in 2 ms. (steps per millisecond=69 )
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 761 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 221 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 280 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-09 08:14:16] [INFO ] Invariant cache hit.
[2023-03-09 08:14:16] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-09 08:14:16] [INFO ] Invariant cache hit.
[2023-03-09 08:14:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 08:14:17] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2023-03-09 08:14:17] [INFO ] Invariant cache hit.
[2023-03-09 08:14:17] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1374 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 502 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 232 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 161 steps, including 3 resets, run visited all 4 properties in 2 ms. (steps per millisecond=80 )
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 898 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 285 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 3853 reset in 291 ms.
Product exploration explored 100000 steps with 3838 reset in 278 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 258 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 5 ms. Remains 180 /180 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-09 08:14:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:14:21] [INFO ] Invariant cache hit.
[2023-03-09 08:14:21] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 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 2 ms. Remains 180 /180 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-09 08:14:21] [INFO ] Invariant cache hit.
[2023-03-09 08:14:21] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-09 08:14:21] [INFO ] Invariant cache hit.
[2023-03-09 08:14:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 08:14:21] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2023-03-09 08:14:21] [INFO ] Invariant cache hit.
[2023-03-09 08:14:21] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 723 ms. Remains : 180/180 places, 154/154 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-15 finished in 9983 ms.
[2023-03-09 08:14:22] [INFO ] Flatten gal took : 39 ms
[2023-03-09 08:14:22] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-09 08:14:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 885 places, 861 transitions and 2092 arcs took 23 ms.
Total runtime 200644 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-12b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/404
LTLFireability

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

FORMULA AutoFlight-PT-12b-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678349877845

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/404/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/404/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/404/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 AutoFlight-PT-12b-LTLFireability-05
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for AutoFlight-PT-12b-LTLFireability-05
lola: result : false
lola: markings : 20082
lola: fired transitions : 42381
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 AutoFlight-PT-12b-LTLFireability-11
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for AutoFlight-PT-12b-LTLFireability-11
lola: result : false
lola: markings : 595
lola: fired transitions : 595
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 AutoFlight-PT-12b-LTLFireability-15
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/1200 2/32 AutoFlight-PT-12b-LTLFireability-15 175924 m, 35184 m/sec, 1048482 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 10/1200 4/32 AutoFlight-PT-12b-LTLFireability-15 339948 m, 32804 m/sec, 2139558 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 15/1200 6/32 AutoFlight-PT-12b-LTLFireability-15 503847 m, 32779 m/sec, 3234977 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 20/1200 7/32 AutoFlight-PT-12b-LTLFireability-15 670767 m, 33384 m/sec, 4341905 t fired, .

Time elapsed: 20 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 25/1200 9/32 AutoFlight-PT-12b-LTLFireability-15 825723 m, 30991 m/sec, 5441427 t fired, .

Time elapsed: 25 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 30/1200 10/32 AutoFlight-PT-12b-LTLFireability-15 968258 m, 28507 m/sec, 6539417 t fired, .

Time elapsed: 30 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 35/1200 12/32 AutoFlight-PT-12b-LTLFireability-15 1113451 m, 29038 m/sec, 7640537 t fired, .

Time elapsed: 35 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 40/1200 13/32 AutoFlight-PT-12b-LTLFireability-15 1256139 m, 28537 m/sec, 8740110 t fired, .

Time elapsed: 40 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 45/1200 15/32 AutoFlight-PT-12b-LTLFireability-15 1412496 m, 31271 m/sec, 9843601 t fired, .

Time elapsed: 45 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 50/1200 16/32 AutoFlight-PT-12b-LTLFireability-15 1557819 m, 29064 m/sec, 10941516 t fired, .

Time elapsed: 50 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 55/1200 18/32 AutoFlight-PT-12b-LTLFireability-15 1700374 m, 28511 m/sec, 12039695 t fired, .

Time elapsed: 55 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 60/1200 19/32 AutoFlight-PT-12b-LTLFireability-15 1842957 m, 28516 m/sec, 13138104 t fired, .

Time elapsed: 60 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 65/1200 20/32 AutoFlight-PT-12b-LTLFireability-15 1992653 m, 29939 m/sec, 14243307 t fired, .

Time elapsed: 65 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 70/1200 22/32 AutoFlight-PT-12b-LTLFireability-15 2145557 m, 30580 m/sec, 15344128 t fired, .

Time elapsed: 70 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 75/1200 23/32 AutoFlight-PT-12b-LTLFireability-15 2288243 m, 28537 m/sec, 16444663 t fired, .

Time elapsed: 75 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 80/1200 25/32 AutoFlight-PT-12b-LTLFireability-15 2433351 m, 29021 m/sec, 17545729 t fired, .

Time elapsed: 80 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 85/1200 26/32 AutoFlight-PT-12b-LTLFireability-15 2576479 m, 28625 m/sec, 18649209 t fired, .

Time elapsed: 85 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 90/1200 28/32 AutoFlight-PT-12b-LTLFireability-15 2734729 m, 31650 m/sec, 19749482 t fired, .

Time elapsed: 90 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 95/1200 29/32 AutoFlight-PT-12b-LTLFireability-15 2879015 m, 28857 m/sec, 20854747 t fired, .

Time elapsed: 95 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 100/1200 31/32 AutoFlight-PT-12b-LTLFireability-15 3022247 m, 28646 m/sec, 21958562 t fired, .

Time elapsed: 100 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 105/1200 32/32 AutoFlight-PT-12b-LTLFireability-15 3167043 m, 28959 m/sec, 23066015 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 13 (type EXCL) for AutoFlight-PT-12b-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 7 (type EXCL) for 6 AutoFlight-PT-12b-LTLFireability-06
lola: time limit : 1745 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1745 4/32 AutoFlight-PT-12b-LTLFireability-06 311216 m, 62243 m/sec, 1066475 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1745 6/32 AutoFlight-PT-12b-LTLFireability-06 591490 m, 56054 m/sec, 2145093 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1745 9/32 AutoFlight-PT-12b-LTLFireability-06 871365 m, 55975 m/sec, 3225459 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1745 12/32 AutoFlight-PT-12b-LTLFireability-06 1156317 m, 56990 m/sec, 4304884 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1745 15/32 AutoFlight-PT-12b-LTLFireability-06 1437168 m, 56170 m/sec, 5385592 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1745 17/32 AutoFlight-PT-12b-LTLFireability-06 1696290 m, 51824 m/sec, 6467887 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1745 20/32 AutoFlight-PT-12b-LTLFireability-06 1945738 m, 49889 m/sec, 7551011 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1745 22/32 AutoFlight-PT-12b-LTLFireability-06 2196311 m, 50114 m/sec, 8631134 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1745 25/32 AutoFlight-PT-12b-LTLFireability-06 2446750 m, 50087 m/sec, 9708738 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1745 28/32 AutoFlight-PT-12b-LTLFireability-06 2706671 m, 51984 m/sec, 10793330 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1745 30/32 AutoFlight-PT-12b-LTLFireability-06 2969976 m, 52661 m/sec, 11875976 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for AutoFlight-PT-12b-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 1 (type EXCL) for 0 AutoFlight-PT-12b-LTLFireability-02
lola: time limit : 3430 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3430 5/32 AutoFlight-PT-12b-LTLFireability-02 348915 m, 69783 m/sec, 1068680 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3430 9/32 AutoFlight-PT-12b-LTLFireability-02 666456 m, 63508 m/sec, 2148223 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3430 13/32 AutoFlight-PT-12b-LTLFireability-02 978558 m, 62420 m/sec, 3225126 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3430 18/32 AutoFlight-PT-12b-LTLFireability-02 1313069 m, 66902 m/sec, 4289828 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3430 21/32 AutoFlight-PT-12b-LTLFireability-02 1578388 m, 53063 m/sec, 5362082 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3430 25/32 AutoFlight-PT-12b-LTLFireability-02 1854484 m, 55219 m/sec, 6433907 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3430 28/32 AutoFlight-PT-12b-LTLFireability-02 2142688 m, 57640 m/sec, 7491741 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3430 32/32 AutoFlight-PT-12b-LTLFireability-02 2443314 m, 60125 m/sec, 8566178 t fired, .

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for AutoFlight-PT-12b-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12b-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12b-LTLFireability-02: LTL unknown AGGR
AutoFlight-PT-12b-LTLFireability-05: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-06: LTL unknown AGGR
AutoFlight-PT-12b-LTLFireability-11: LTL false LTL model checker
AutoFlight-PT-12b-LTLFireability-15: LTL unknown AGGR


Time elapsed: 215 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is AutoFlight-PT-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 r007-oct2-167813595600476"
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 ;