Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689400508.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-48b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689400508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 10K Apr 30 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 30 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 956K May 10 09:33 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-48b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652664330444

Running Version 202205111006
[2022-05-16 01:25:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:25:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:25:32] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2022-05-16 01:25:32] [INFO ] Transformed 3950 places.
[2022-05-16 01:25:32] [INFO ] Transformed 3936 transitions.
[2022-05-16 01:25:32] [INFO ] Found NUPN structural information;
[2022-05-16 01:25:32] [INFO ] Parsed PT model containing 3950 places and 3936 transitions in 692 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-48b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 3950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Discarding 501 places :
Symmetric choice reduction at 0 with 501 rule applications. Total rules 501 place count 3449 transition count 3435
Iterating global reduction 0 with 501 rules applied. Total rules applied 1002 place count 3449 transition count 3435
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 1073 place count 3449 transition count 3364
Discarding 234 places :
Symmetric choice reduction at 1 with 234 rule applications. Total rules 1307 place count 3215 transition count 3130
Iterating global reduction 1 with 234 rules applied. Total rules applied 1541 place count 3215 transition count 3130
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 1576 place count 3180 transition count 3095
Iterating global reduction 1 with 35 rules applied. Total rules applied 1611 place count 3180 transition count 3095
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 1644 place count 3147 transition count 3062
Iterating global reduction 1 with 33 rules applied. Total rules applied 1677 place count 3147 transition count 3062
Applied a total of 1677 rules in 2135 ms. Remains 3147 /3950 variables (removed 803) and now considering 3062/3936 (removed 874) transitions.
// Phase 1: matrix 3062 rows 3147 cols
[2022-05-16 01:25:35] [INFO ] Computed 258 place invariants in 96 ms
[2022-05-16 01:25:36] [INFO ] Implicit Places using invariants in 1512 ms returned []
// Phase 1: matrix 3062 rows 3147 cols
[2022-05-16 01:25:36] [INFO ] Computed 258 place invariants in 55 ms
[2022-05-16 01:25:40] [INFO ] Implicit Places using invariants and state equation in 4143 ms returned []
Implicit Place search using SMT with State Equation took 5713 ms to find 0 implicit places.
// Phase 1: matrix 3062 rows 3147 cols
[2022-05-16 01:25:40] [INFO ] Computed 258 place invariants in 16 ms
[2022-05-16 01:25:42] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3147/3950 places, 3062/3936 transitions.
Finished structural reductions, in 1 iterations. Remains : 3147/3950 places, 3062/3936 transitions.
Support contains 38 out of 3147 places after structural reductions.
[2022-05-16 01:25:43] [INFO ] Flatten gal took : 263 ms
[2022-05-16 01:25:43] [INFO ] Flatten gal took : 241 ms
[2022-05-16 01:25:43] [INFO ] Input system was already deterministic with 3062 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 32) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 3062 rows 3147 cols
[2022-05-16 01:25:44] [INFO ] Computed 258 place invariants in 24 ms
[2022-05-16 01:25:45] [INFO ] [Real]Absence check using 257 positive place invariants in 165 ms returned sat
[2022-05-16 01:25:45] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 9 ms returned sat
[2022-05-16 01:25:46] [INFO ] After 1546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-16 01:25:47] [INFO ] [Nat]Absence check using 257 positive place invariants in 214 ms returned sat
[2022-05-16 01:25:47] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 9 ms returned sat
[2022-05-16 01:25:51] [INFO ] After 3282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-16 01:25:52] [INFO ] Deduced a trap composed of 228 places in 1569 ms of which 18 ms to minimize.
[2022-05-16 01:25:54] [INFO ] Deduced a trap composed of 512 places in 1959 ms of which 15 ms to minimize.
[2022-05-16 01:25:56] [INFO ] Deduced a trap composed of 99 places in 1039 ms of which 12 ms to minimize.
[2022-05-16 01:25:57] [INFO ] Deduced a trap composed of 198 places in 887 ms of which 3 ms to minimize.
[2022-05-16 01:25:57] [INFO ] Deduced a trap composed of 200 places in 888 ms of which 9 ms to minimize.
[2022-05-16 01:25:58] [INFO ] Deduced a trap composed of 231 places in 863 ms of which 2 ms to minimize.
[2022-05-16 01:25:59] [INFO ] Deduced a trap composed of 227 places in 837 ms of which 2 ms to minimize.
[2022-05-16 01:26:00] [INFO ] Deduced a trap composed of 177 places in 650 ms of which 1 ms to minimize.
[2022-05-16 01:26:01] [INFO ] Deduced a trap composed of 204 places in 528 ms of which 2 ms to minimize.
[2022-05-16 01:26:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 10268 ms
[2022-05-16 01:26:03] [INFO ] Deduced a trap composed of 651 places in 1137 ms of which 1 ms to minimize.
[2022-05-16 01:26:04] [INFO ] Deduced a trap composed of 520 places in 1072 ms of which 2 ms to minimize.
[2022-05-16 01:26:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2609 ms
[2022-05-16 01:26:09] [INFO ] Deduced a trap composed of 36 places in 1078 ms of which 1 ms to minimize.
[2022-05-16 01:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1431 ms
[2022-05-16 01:26:09] [INFO ] After 21926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1338 ms.
[2022-05-16 01:26:11] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 8 properties in 918 ms.
Support contains 7 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Drop transitions removed 1271 transitions
Trivial Post-agglo rules discarded 1271 transitions
Performed 1271 trivial Post agglomeration. Transition count delta: 1271
Iterating post reduction 0 with 1271 rules applied. Total rules applied 1271 place count 3147 transition count 1791
Reduce places removed 1271 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1418 rules applied. Total rules applied 2689 place count 1876 transition count 1644
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2786 place count 1780 transition count 1643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2787 place count 1779 transition count 1643
Performed 353 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 353 Pre rules applied. Total rules applied 2787 place count 1779 transition count 1290
Deduced a syphon composed of 353 places in 7 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 4 with 706 rules applied. Total rules applied 3493 place count 1426 transition count 1290
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 3498 place count 1421 transition count 1285
Iterating global reduction 4 with 5 rules applied. Total rules applied 3503 place count 1421 transition count 1285
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 3503 place count 1421 transition count 1281
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3511 place count 1417 transition count 1281
Performed 569 Post agglomeration using F-continuation condition with reduction of 69 identical transitions.
Deduced a syphon composed of 569 places in 0 ms
Reduce places removed 569 places and 0 transitions.
Iterating global reduction 4 with 1138 rules applied. Total rules applied 4649 place count 848 transition count 643
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4650 place count 848 transition count 642
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 143 times.
Iterating global reduction 5 with 143 rules applied. Total rules applied 4793 place count 848 transition count 499
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 5 with 143 rules applied. Total rules applied 4936 place count 705 transition count 499
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4937 place count 704 transition count 498
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 6 with 502 rules applied. Total rules applied 5439 place count 505 transition count 195
Reduce places removed 303 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 304 rules applied. Total rules applied 5743 place count 202 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5744 place count 201 transition count 194
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 63 Pre rules applied. Total rules applied 5744 place count 201 transition count 131
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 9 with 126 rules applied. Total rules applied 5870 place count 138 transition count 131
Applied a total of 5870 rules in 663 ms. Remains 138 /3147 variables (removed 3009) and now considering 131/3062 (removed 2931) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/3147 places, 131/3062 transitions.
Finished random walk after 242 steps, including 2 resets, run visited all 7 properties in 7 ms. (steps per millisecond=34 )
Computed a total of 800 stabilizing places and 800 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(!(p1 U p2)&&p3))))'
Support contains 6 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1269 transitions
Trivial Post-agglo rules discarded 1269 transitions
Performed 1269 trivial Post agglomeration. Transition count delta: 1269
Iterating post reduction 0 with 1269 rules applied. Total rules applied 1269 place count 3146 transition count 1792
Reduce places removed 1269 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1416 rules applied. Total rules applied 2685 place count 1877 transition count 1645
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 98 rules applied. Total rules applied 2783 place count 1781 transition count 1643
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2785 place count 1779 transition count 1643
Performed 353 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 353 Pre rules applied. Total rules applied 2785 place count 1779 transition count 1290
Deduced a syphon composed of 353 places in 7 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 4 with 706 rules applied. Total rules applied 3491 place count 1426 transition count 1290
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 3497 place count 1420 transition count 1284
Iterating global reduction 4 with 6 rules applied. Total rules applied 3503 place count 1420 transition count 1284
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 3503 place count 1420 transition count 1279
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 3513 place count 1415 transition count 1279
Performed 565 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 565 places in 1 ms
Reduce places removed 565 places and 0 transitions.
Iterating global reduction 4 with 1130 rules applied. Total rules applied 4643 place count 850 transition count 644
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 4644 place count 849 transition count 643
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 4 with 79 rules applied. Total rules applied 4723 place count 796 transition count 617
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 4749 place count 770 transition count 617
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 27 Pre rules applied. Total rules applied 4749 place count 770 transition count 590
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 4803 place count 743 transition count 590
Applied a total of 4803 rules in 459 ms. Remains 743 /3147 variables (removed 2404) and now considering 590/3062 (removed 2472) transitions.
// Phase 1: matrix 590 rows 743 cols
[2022-05-16 01:26:13] [INFO ] Computed 205 place invariants in 2 ms
[2022-05-16 01:26:14] [INFO ] Implicit Places using invariants in 767 ms returned [676, 678, 680, 682, 684, 686, 688, 690, 692, 696, 700, 704, 708, 712, 716, 720, 725, 729, 733, 737, 742]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 771 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 722/3147 places, 590/3062 transitions.
Graph (trivial) has 184 edges and 722 vertex of which 9 / 722 are part of one of the 1 SCC in 3 ms
Free SCC test removed 8 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 714 transition count 571
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 710 transition count 571
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 23 place count 696 transition count 557
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 696 transition count 557
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 95 place count 667 transition count 528
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 667 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 666 transition count 527
Applied a total of 97 rules in 112 ms. Remains 666 /722 variables (removed 56) and now considering 527/590 (removed 63) transitions.
// Phase 1: matrix 527 rows 666 cols
[2022-05-16 01:26:14] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-16 01:26:15] [INFO ] Implicit Places using invariants in 686 ms returned []
// Phase 1: matrix 527 rows 666 cols
[2022-05-16 01:26:15] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-16 01:26:15] [INFO ] State equation strengthened by 185 read => feed constraints.
[2022-05-16 01:26:17] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned [255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 279, 281, 283, 285, 287, 289, 291, 293]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2404 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 646/3147 places, 527/3062 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 646 transition count 507
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 626 transition count 507
Applied a total of 40 rules in 33 ms. Remains 626 /646 variables (removed 20) and now considering 507/527 (removed 20) transitions.
// Phase 1: matrix 507 rows 626 cols
[2022-05-16 01:26:17] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-16 01:26:17] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 507 rows 626 cols
[2022-05-16 01:26:17] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-16 01:26:17] [INFO ] State equation strengthened by 165 read => feed constraints.
[2022-05-16 01:26:19] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 626/3147 places, 507/3062 transitions.
Finished structural reductions, in 3 iterations. Remains : 626/3147 places, 507/3062 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), acceptance={} source=1 dest: 0}, { cond=(OR p0 (AND p3 (NOT p1) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) p2), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p3 (NOT p1) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p1 (NOT p2)) (AND p3 p1 (NOT p2))), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s177 0), p3:(EQ s599 0), p2:(AND (EQ s277 1) (EQ s276 1) (EQ s588 1)), p1:(EQ s369 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 915 steps with 7 reset in 24 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 6237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!p1))))'
Support contains 2 out of 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3139 transition count 3054
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3139 transition count 3054
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 3139 transition count 3053
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 3134 transition count 3048
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 3134 transition count 3048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 3131 transition count 3045
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 3131 transition count 3045
Applied a total of 33 rules in 877 ms. Remains 3131 /3147 variables (removed 16) and now considering 3045/3062 (removed 17) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:26:20] [INFO ] Computed 258 place invariants in 10 ms
[2022-05-16 01:26:21] [INFO ] Implicit Places using invariants in 870 ms returned []
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:26:21] [INFO ] Computed 258 place invariants in 17 ms
[2022-05-16 01:26:25] [INFO ] Implicit Places using invariants and state equation in 3757 ms returned []
Implicit Place search using SMT with State Equation took 4655 ms to find 0 implicit places.
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:26:25] [INFO ] Computed 258 place invariants in 18 ms
[2022-05-16 01:26:26] [INFO ] Dead Transitions using invariants and state equation in 1798 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3147 places, 3045/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3131/3147 places, 3045/3062 transitions.
Stuttering acceptance computed with spot in 96 ms :[p1, p1, p1, true]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s145 1), p1:(OR (EQ s746 1) (EQ s145 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]]
Product exploration explored 100000 steps with 33277 reset in 1150 ms.
Product exploration explored 100000 steps with 33474 reset in 948 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Detected a total of 790/3131 stabilizing places and 790/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 317 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:26:29] [INFO ] Computed 258 place invariants in 16 ms
[2022-05-16 01:26:30] [INFO ] [Real]Absence check using 257 positive place invariants in 139 ms returned sat
[2022-05-16 01:26:30] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 01:26:30] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:26:30] [INFO ] [Nat]Absence check using 257 positive place invariants in 144 ms returned sat
[2022-05-16 01:26:30] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 01:26:31] [INFO ] After 1313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:26:33] [INFO ] Deduced a trap composed of 31 places in 1161 ms of which 2 ms to minimize.
[2022-05-16 01:26:34] [INFO ] Deduced a trap composed of 138 places in 1133 ms of which 2 ms to minimize.
[2022-05-16 01:26:35] [INFO ] Deduced a trap composed of 111 places in 1177 ms of which 2 ms to minimize.
[2022-05-16 01:26:36] [INFO ] Deduced a trap composed of 150 places in 1096 ms of which 1 ms to minimize.
[2022-05-16 01:26:38] [INFO ] Deduced a trap composed of 63 places in 1076 ms of which 2 ms to minimize.
[2022-05-16 01:26:39] [INFO ] Deduced a trap composed of 141 places in 1110 ms of which 2 ms to minimize.
[2022-05-16 01:26:40] [INFO ] Deduced a trap composed of 150 places in 1109 ms of which 2 ms to minimize.
[2022-05-16 01:26:41] [INFO ] Deduced a trap composed of 152 places in 1063 ms of which 2 ms to minimize.
[2022-05-16 01:26:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 9813 ms
[2022-05-16 01:26:41] [INFO ] After 11221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-16 01:26:41] [INFO ] After 11768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 3131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Drop transitions removed 1272 transitions
Trivial Post-agglo rules discarded 1272 transitions
Performed 1272 trivial Post agglomeration. Transition count delta: 1272
Iterating post reduction 0 with 1272 rules applied. Total rules applied 1272 place count 3131 transition count 1773
Reduce places removed 1272 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1416 rules applied. Total rules applied 2688 place count 1859 transition count 1629
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2784 place count 1763 transition count 1629
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 351 Pre rules applied. Total rules applied 2784 place count 1763 transition count 1278
Deduced a syphon composed of 351 places in 6 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 3 with 702 rules applied. Total rules applied 3486 place count 1412 transition count 1278
Performed 569 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 569 places in 1 ms
Reduce places removed 569 places and 0 transitions.
Iterating global reduction 3 with 1138 rules applied. Total rules applied 4624 place count 843 transition count 638
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4625 place count 843 transition count 637
Free-agglomeration rule applied 144 times.
Iterating global reduction 3 with 144 rules applied. Total rules applied 4769 place count 843 transition count 493
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 4913 place count 699 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4914 place count 698 transition count 492
Reduce places removed 140 places and 0 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 4 with 297 rules applied. Total rules applied 5211 place count 558 transition count 335
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 5 with 157 rules applied. Total rules applied 5368 place count 401 transition count 335
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 57 Pre rules applied. Total rules applied 5368 place count 401 transition count 278
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 6 with 114 rules applied. Total rules applied 5482 place count 344 transition count 278
Applied a total of 5482 rules in 437 ms. Remains 344 /3131 variables (removed 2787) and now considering 278/3045 (removed 2767) transitions.
Finished structural reductions, in 1 iterations. Remains : 344/3131 places, 278/3045 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F p0), (F (AND p1 (NOT p0))), (F p1)]
Knowledge based reduction with 9 factoid took 681 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[p1, p1, p1, true]
Stuttering acceptance computed with spot in 79 ms :[p1, p1, p1, true]
Support contains 2 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 225 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:26:43] [INFO ] Computed 258 place invariants in 17 ms
[2022-05-16 01:26:44] [INFO ] Implicit Places using invariants in 753 ms returned []
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:26:44] [INFO ] Computed 258 place invariants in 9 ms
[2022-05-16 01:26:47] [INFO ] Implicit Places using invariants and state equation in 3689 ms returned []
Implicit Place search using SMT with State Equation took 4468 ms to find 0 implicit places.
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:26:47] [INFO ] Computed 258 place invariants in 12 ms
[2022-05-16 01:26:49] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3131/3131 places, 3045/3045 transitions.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Detected a total of 790/3131 stabilizing places and 790/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 296 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:26:50] [INFO ] Computed 258 place invariants in 8 ms
[2022-05-16 01:26:50] [INFO ] [Real]Absence check using 257 positive place invariants in 151 ms returned sat
[2022-05-16 01:26:50] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-16 01:26:50] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:26:51] [INFO ] [Nat]Absence check using 257 positive place invariants in 147 ms returned sat
[2022-05-16 01:26:51] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 01:26:52] [INFO ] After 1199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:26:54] [INFO ] Deduced a trap composed of 31 places in 1537 ms of which 2 ms to minimize.
[2022-05-16 01:26:55] [INFO ] Deduced a trap composed of 138 places in 1084 ms of which 2 ms to minimize.
[2022-05-16 01:26:56] [INFO ] Deduced a trap composed of 111 places in 1097 ms of which 2 ms to minimize.
[2022-05-16 01:26:57] [INFO ] Deduced a trap composed of 150 places in 1098 ms of which 1 ms to minimize.
[2022-05-16 01:26:59] [INFO ] Deduced a trap composed of 63 places in 1331 ms of which 2 ms to minimize.
[2022-05-16 01:27:00] [INFO ] Deduced a trap composed of 141 places in 1107 ms of which 2 ms to minimize.
[2022-05-16 01:27:01] [INFO ] Deduced a trap composed of 150 places in 1058 ms of which 2 ms to minimize.
[2022-05-16 01:27:02] [INFO ] Deduced a trap composed of 152 places in 1099 ms of which 2 ms to minimize.
[2022-05-16 01:27:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 10358 ms
[2022-05-16 01:27:03] [INFO ] After 11662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-05-16 01:27:03] [INFO ] After 12276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2032 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=156 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F p0), (F (AND p1 (NOT p0))), (F p1)]
Knowledge based reduction with 9 factoid took 519 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[p1, p1, p1, true]
Stuttering acceptance computed with spot in 80 ms :[p1, p1, p1, true]
Stuttering acceptance computed with spot in 78 ms :[p1, p1, p1, true]
Product exploration explored 100000 steps with 33306 reset in 1052 ms.
Product exploration explored 100000 steps with 33234 reset in 1225 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 129 ms :[p1, p1, p1, true]
Support contains 2 out of 3131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Performed 1140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1140 rules applied. Total rules applied 1140 place count 3131 transition count 3045
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 96 rules applied. Total rules applied 1236 place count 3131 transition count 2997
Performed 422 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 422 Pre rules applied. Total rules applied 1236 place count 3131 transition count 2997
Deduced a syphon composed of 1610 places in 15 ms
Iterating global reduction 2 with 422 rules applied. Total rules applied 1658 place count 3131 transition count 2997
Discarding 1051 places :
Symmetric choice reduction at 2 with 1051 rule applications. Total rules 2709 place count 2080 transition count 1946
Deduced a syphon composed of 559 places in 23 ms
Iterating global reduction 2 with 1051 rules applied. Total rules applied 3760 place count 2080 transition count 1946
Performed 678 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 1237 places in 0 ms
Iterating global reduction 2 with 678 rules applied. Total rules applied 4438 place count 2080 transition count 1875
Renaming transitions due to excessive name length > 1024 char.
Discarding 423 places :
Symmetric choice reduction at 2 with 423 rule applications. Total rules 4861 place count 1657 transition count 1452
Deduced a syphon composed of 814 places in 0 ms
Iterating global reduction 2 with 423 rules applied. Total rules applied 5284 place count 1657 transition count 1452
Deduced a syphon composed of 814 places in 0 ms
Applied a total of 5284 rules in 2042 ms. Remains 1657 /3131 variables (removed 1474) and now considering 1452/3045 (removed 1593) transitions.
[2022-05-16 01:27:08] [INFO ] Redundant transitions in 95 ms returned []
// Phase 1: matrix 1452 rows 1657 cols
[2022-05-16 01:27:08] [INFO ] Computed 258 place invariants in 50 ms
[2022-05-16 01:27:10] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1657/3131 places, 1452/3045 transitions.
Finished structural reductions, in 1 iterations. Remains : 1657/3131 places, 1452/3045 transitions.
Product exploration explored 100000 steps with 33194 reset in 3580 ms.
Product exploration explored 100000 steps with 33414 reset in 3211 ms.
Built C files in :
/tmp/ltsmin813063258121572007
[2022-05-16 01:27:17] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin813063258121572007
Running compilation step : cd /tmp/ltsmin813063258121572007;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin813063258121572007;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin813063258121572007;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 412 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:27:20] [INFO ] Computed 258 place invariants in 17 ms
[2022-05-16 01:27:22] [INFO ] Implicit Places using invariants in 1582 ms returned []
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:27:22] [INFO ] Computed 258 place invariants in 8 ms
[2022-05-16 01:27:26] [INFO ] Implicit Places using invariants and state equation in 4614 ms returned []
Implicit Place search using SMT with State Equation took 6213 ms to find 0 implicit places.
// Phase 1: matrix 3045 rows 3131 cols
[2022-05-16 01:27:26] [INFO ] Computed 258 place invariants in 19 ms
[2022-05-16 01:27:28] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3131/3131 places, 3045/3045 transitions.
Built C files in :
/tmp/ltsmin5093463962700908318
[2022-05-16 01:27:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5093463962700908318
Running compilation step : cd /tmp/ltsmin5093463962700908318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5093463962700908318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5093463962700908318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 01:27:32] [INFO ] Flatten gal took : 202 ms
[2022-05-16 01:27:32] [INFO ] Flatten gal took : 161 ms
[2022-05-16 01:27:32] [INFO ] Time to serialize gal into /tmp/LTL13595094924323497803.gal : 45 ms
[2022-05-16 01:27:32] [INFO ] Time to serialize properties into /tmp/LTL5206733063338047105.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13595094924323497803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5206733063338047105.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1359509...267
Read 1 LTL properties
Checking formula 0 : !((G(("(p145==1)")U(X(!("((p1120==1)||(p145==1))"))))))
Formula 0 simplified : !G("(p145==1)" U X!"((p1120==1)||(p145==1))")
Detected timeout of ITS tools.
[2022-05-16 01:27:47] [INFO ] Flatten gal took : 105 ms
[2022-05-16 01:27:47] [INFO ] Applying decomposition
[2022-05-16 01:27:47] [INFO ] Flatten gal took : 141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13120884706975238307.txt' '-o' '/tmp/graph13120884706975238307.bin' '-w' '/tmp/graph13120884706975238307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13120884706975238307.bin' '-l' '-1' '-v' '-w' '/tmp/graph13120884706975238307.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:27:48] [INFO ] Decomposing Gal with order
[2022-05-16 01:27:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:27:49] [INFO ] Removed a total of 551 redundant transitions.
[2022-05-16 01:27:49] [INFO ] Flatten gal took : 385 ms
[2022-05-16 01:27:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2022-05-16 01:27:49] [INFO ] Time to serialize gal into /tmp/LTL14310395452082083421.gal : 54 ms
[2022-05-16 01:27:49] [INFO ] Time to serialize properties into /tmp/LTL3503156283453082640.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14310395452082083421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3503156283453082640.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1431039...246
Read 1 LTL properties
Checking formula 0 : !((G(("(i7.u64.p145==1)")U(X(!("((i6.u320.p1120==1)||(i7.u64.p145==1))"))))))
Formula 0 simplified : !G("(i7.u64.p145==1)" U X!"((i6.u320.p1120==1)||(i7.u64.p145==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4969153868416247910
[2022-05-16 01:28:04] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4969153868416247910
Running compilation step : cd /tmp/ltsmin4969153868416247910;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4969153868416247910;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4969153868416247910;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property AutoFlight-PT-48b-LTLFireability-02 finished in 108289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3139 transition count 3054
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3139 transition count 3054
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 3134 transition count 3049
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 3134 transition count 3049
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 3131 transition count 3046
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 3131 transition count 3046
Applied a total of 32 rules in 1094 ms. Remains 3131 /3147 variables (removed 16) and now considering 3046/3062 (removed 16) transitions.
// Phase 1: matrix 3046 rows 3131 cols
[2022-05-16 01:28:08] [INFO ] Computed 258 place invariants in 9 ms
[2022-05-16 01:28:11] [INFO ] Implicit Places using invariants in 2901 ms returned []
// Phase 1: matrix 3046 rows 3131 cols
[2022-05-16 01:28:11] [INFO ] Computed 258 place invariants in 8 ms
[2022-05-16 01:28:15] [INFO ] Implicit Places using invariants and state equation in 3584 ms returned []
Implicit Place search using SMT with State Equation took 6503 ms to find 0 implicit places.
// Phase 1: matrix 3046 rows 3131 cols
[2022-05-16 01:28:15] [INFO ] Computed 258 place invariants in 9 ms
[2022-05-16 01:28:16] [INFO ] Dead Transitions using invariants and state equation in 1619 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3147 places, 3046/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3131/3147 places, 3046/3062 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-03 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:(OR (EQ s98 1) (EQ s744 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 3233 steps with 1 reset in 17 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-03 finished in 9350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U X(!p0))))'
Support contains 1 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1275 transitions
Trivial Post-agglo rules discarded 1275 transitions
Performed 1275 trivial Post agglomeration. Transition count delta: 1275
Iterating post reduction 0 with 1275 rules applied. Total rules applied 1275 place count 3146 transition count 1786
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1422 rules applied. Total rules applied 2697 place count 1871 transition count 1639
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2794 place count 1775 transition count 1638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2795 place count 1774 transition count 1638
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 352 Pre rules applied. Total rules applied 2795 place count 1774 transition count 1286
Deduced a syphon composed of 352 places in 6 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 704 rules applied. Total rules applied 3499 place count 1422 transition count 1286
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 3506 place count 1415 transition count 1279
Iterating global reduction 4 with 7 rules applied. Total rules applied 3513 place count 1415 transition count 1279
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 3513 place count 1415 transition count 1273
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 3525 place count 1409 transition count 1273
Performed 568 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 568 places in 0 ms
Reduce places removed 568 places and 0 transitions.
Iterating global reduction 4 with 1136 rules applied. Total rules applied 4661 place count 841 transition count 635
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 4662 place count 840 transition count 634
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 142 rules applied. Total rules applied 4804 place count 745 transition count 587
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 4851 place count 698 transition count 587
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4851 place count 698 transition count 539
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4947 place count 650 transition count 539
Applied a total of 4947 rules in 543 ms. Remains 650 /3147 variables (removed 2497) and now considering 539/3062 (removed 2523) transitions.
// Phase 1: matrix 539 rows 650 cols
[2022-05-16 01:28:17] [INFO ] Computed 163 place invariants in 1 ms
[2022-05-16 01:28:17] [INFO ] Implicit Places using invariants in 354 ms returned [255, 329, 367, 441, 479, 483, 487, 491, 495, 499, 503, 507, 511, 515, 519, 523, 527, 531, 535, 539, 543, 547, 551, 555, 559, 563, 567, 571, 575, 577, 579, 581, 583, 585, 587, 589, 591, 593, 595, 597, 599, 603, 607, 611, 615, 619, 623, 627, 632, 636, 640, 644, 649]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 368 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 597/3147 places, 539/3062 transitions.
Graph (trivial) has 247 edges and 597 vertex of which 13 / 597 are part of one of the 1 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 546 transition count 477
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 546 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 544 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 544 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 542 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 542 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 540 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 540 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 538 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 538 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 536 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 536 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 534 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 534 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 532 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 532 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 530 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 530 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 528 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 528 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 526 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 526 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 524 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 524 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 522 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 522 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 128 place count 521 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 521 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 520 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 520 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 519 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 519 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 518 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 518 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 517 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 517 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 516 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 516 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 515 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 515 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 514 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 514 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 513 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 513 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 512 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 512 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 511 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 511 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 510 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 510 transition count 441
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 153 place count 509 transition count 440
Applied a total of 153 rules in 268 ms. Remains 509 /597 variables (removed 88) and now considering 440/539 (removed 99) transitions.
// Phase 1: matrix 440 rows 509 cols
[2022-05-16 01:28:18] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-16 01:28:18] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 440 rows 509 cols
[2022-05-16 01:28:18] [INFO ] Computed 110 place invariants in 5 ms
[2022-05-16 01:28:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:28:19] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 509/3147 places, 440/3062 transitions.
Finished structural reductions, in 2 iterations. Remains : 509/3147 places, 440/3062 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2321 steps with 27 reset in 20 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-04 finished in 2301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 2 out of 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3140 transition count 3055
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3140 transition count 3055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3140 transition count 3054
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 3135 transition count 3049
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 3135 transition count 3049
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 3132 transition count 3046
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 3132 transition count 3046
Applied a total of 31 rules in 862 ms. Remains 3132 /3147 variables (removed 15) and now considering 3046/3062 (removed 16) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:28:20] [INFO ] Computed 258 place invariants in 13 ms
[2022-05-16 01:28:21] [INFO ] Implicit Places using invariants in 958 ms returned []
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:28:21] [INFO ] Computed 258 place invariants in 16 ms
[2022-05-16 01:28:24] [INFO ] Implicit Places using invariants and state equation in 3483 ms returned []
Implicit Place search using SMT with State Equation took 4469 ms to find 0 implicit places.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:28:24] [INFO ] Computed 258 place invariants in 10 ms
[2022-05-16 01:28:26] [INFO ] Dead Transitions using invariants and state equation in 1610 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3147 places, 3046/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3132/3147 places, 3046/3062 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s325 1), p0:(EQ s766 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-06 finished in 7072 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(X(G((X(F(p1))&&p2)))&&p0)))))'
Support contains 5 out of 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3139 transition count 3054
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3139 transition count 3054
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 3139 transition count 3053
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 3135 transition count 3049
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 3135 transition count 3049
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 3132 transition count 3046
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 3132 transition count 3046
Applied a total of 31 rules in 859 ms. Remains 3132 /3147 variables (removed 15) and now considering 3046/3062 (removed 16) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:28:27] [INFO ] Computed 258 place invariants in 11 ms
[2022-05-16 01:28:28] [INFO ] Implicit Places using invariants in 694 ms returned []
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:28:28] [INFO ] Computed 258 place invariants in 8 ms
[2022-05-16 01:28:31] [INFO ] Implicit Places using invariants and state equation in 3537 ms returned []
Implicit Place search using SMT with State Equation took 4232 ms to find 0 implicit places.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:28:31] [INFO ] Computed 258 place invariants in 11 ms
[2022-05-16 01:28:33] [INFO ] Dead Transitions using invariants and state equation in 1595 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3147 places, 3046/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3132/3147 places, 3046/3062 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1603 0), p2:(OR (EQ s916 0) (EQ s2006 0)), p1:(OR (EQ s729 0) (EQ s2185 0))], nbAcceptance=2, 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 58 reset in 448 ms.
Product exploration explored 100000 steps with 57 reset in 602 ms.
Computed a total of 792 stabilizing places and 792 stable transitions
Computed a total of 792 stabilizing places and 792 stable transitions
Detected a total of 792/3132 stabilizing places and 792/3046 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 812 ms. Reduced automaton from 4 states, 17 edges and 3 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 76 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 20 factoid took 498 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 18 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 18 ms :[(NOT p0)]
Support contains 1 out of 3132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3132/3132 places, 3046/3046 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1269 transitions
Trivial Post-agglo rules discarded 1269 transitions
Performed 1269 trivial Post agglomeration. Transition count delta: 1269
Iterating post reduction 0 with 1269 rules applied. Total rules applied 1269 place count 3131 transition count 1776
Reduce places removed 1269 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1413 rules applied. Total rules applied 2682 place count 1862 transition count 1632
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2778 place count 1766 transition count 1632
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 351 Pre rules applied. Total rules applied 2778 place count 1766 transition count 1281
Deduced a syphon composed of 351 places in 7 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 3 with 702 rules applied. Total rules applied 3480 place count 1415 transition count 1281
Performed 573 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 573 places in 0 ms
Reduce places removed 573 places and 0 transitions.
Iterating global reduction 3 with 1146 rules applied. Total rules applied 4626 place count 842 transition count 636
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 4627 place count 841 transition count 635
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 3 with 142 rules applied. Total rules applied 4769 place count 746 transition count 588
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 4816 place count 699 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4816 place count 699 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4912 place count 651 transition count 540
Applied a total of 4912 rules in 288 ms. Remains 651 /3132 variables (removed 2481) and now considering 540/3046 (removed 2506) transitions.
// Phase 1: matrix 540 rows 651 cols
[2022-05-16 01:28:36] [INFO ] Computed 163 place invariants in 2 ms
[2022-05-16 01:28:36] [INFO ] Implicit Places using invariants in 286 ms returned [256, 330, 368, 442, 480, 484, 488, 492, 496, 500, 504, 508, 512, 516, 520, 524, 528, 532, 536, 540, 544, 548, 552, 556, 560, 564, 568, 572, 576, 578, 580, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 604, 608, 612, 616, 620, 624, 628, 633, 637, 641, 645, 650]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 301 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 598/3132 places, 540/3046 transitions.
Graph (trivial) has 247 edges and 598 vertex of which 13 / 598 are part of one of the 1 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 547 transition count 478
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 547 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 545 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 545 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 543 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 543 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 541 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 541 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 539 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 539 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 537 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 537 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 535 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 535 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 533 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 533 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 531 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 531 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 529 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 529 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 527 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 527 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 525 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 525 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 523 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 523 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 128 place count 522 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 522 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 521 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 521 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 520 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 520 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 519 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 519 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 518 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 518 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 517 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 517 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 516 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 516 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 515 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 515 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 514 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 514 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 513 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 513 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 512 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 512 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 511 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 511 transition count 442
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 153 place count 510 transition count 441
Applied a total of 153 rules in 223 ms. Remains 510 /598 variables (removed 88) and now considering 441/540 (removed 99) transitions.
// Phase 1: matrix 441 rows 510 cols
[2022-05-16 01:28:36] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-16 01:28:36] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 441 rows 510 cols
[2022-05-16 01:28:36] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-16 01:28:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:28:37] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 510/3132 places, 441/3046 transitions.
Finished structural reductions, in 2 iterations. Remains : 510/3132 places, 441/3046 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/510 stabilizing places and 2/441 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 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 19 ms :[(NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
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 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 2294 steps with 19 reset in 11 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-07 finished in 11391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1277 transitions
Trivial Post-agglo rules discarded 1277 transitions
Performed 1277 trivial Post agglomeration. Transition count delta: 1277
Iterating post reduction 0 with 1277 rules applied. Total rules applied 1277 place count 3146 transition count 1784
Reduce places removed 1277 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1424 rules applied. Total rules applied 2701 place count 1869 transition count 1637
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2797 place count 1773 transition count 1637
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2797 place count 1773 transition count 1285
Deduced a syphon composed of 352 places in 7 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3501 place count 1421 transition count 1285
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3508 place count 1414 transition count 1278
Iterating global reduction 3 with 7 rules applied. Total rules applied 3515 place count 1414 transition count 1278
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3515 place count 1414 transition count 1272
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 3527 place count 1408 transition count 1272
Performed 566 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 566 places in 0 ms
Reduce places removed 566 places and 0 transitions.
Iterating global reduction 3 with 1132 rules applied. Total rules applied 4659 place count 842 transition count 636
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 4660 place count 841 transition count 635
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 3 with 142 rules applied. Total rules applied 4802 place count 746 transition count 588
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 4849 place count 699 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4849 place count 699 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4945 place count 651 transition count 540
Applied a total of 4945 rules in 328 ms. Remains 651 /3147 variables (removed 2496) and now considering 540/3062 (removed 2522) transitions.
// Phase 1: matrix 540 rows 651 cols
[2022-05-16 01:28:38] [INFO ] Computed 163 place invariants in 2 ms
[2022-05-16 01:28:38] [INFO ] Implicit Places using invariants in 331 ms returned [536, 540, 544, 548, 552, 556, 560, 564, 568, 572, 576, 578, 580, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 604, 608, 612, 616, 620, 624, 628, 633, 637, 641, 645, 650]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 345 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 616/3147 places, 540/3062 transitions.
Graph (trivial) has 212 edges and 616 vertex of which 13 / 616 are part of one of the 1 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 583 transition count 496
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 583 transition count 496
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 81 place count 564 transition count 477
Applied a total of 81 rules in 26 ms. Remains 564 /616 variables (removed 52) and now considering 477/540 (removed 63) transitions.
// Phase 1: matrix 477 rows 564 cols
[2022-05-16 01:28:38] [INFO ] Computed 128 place invariants in 1 ms
[2022-05-16 01:28:38] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 477 rows 564 cols
[2022-05-16 01:28:38] [INFO ] Computed 128 place invariants in 2 ms
[2022-05-16 01:28:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:28:39] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 564/3147 places, 477/3062 transitions.
Finished structural reductions, in 2 iterations. Remains : 564/3147 places, 477/3062 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-08 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 s255 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 907 steps with 8 reset in 4 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-08 finished in 1505 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((G(p0)||p1||F(p2)))&&p3))))'
Support contains 2 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1275 transitions
Trivial Post-agglo rules discarded 1275 transitions
Performed 1275 trivial Post agglomeration. Transition count delta: 1275
Iterating post reduction 0 with 1275 rules applied. Total rules applied 1275 place count 3146 transition count 1786
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1422 rules applied. Total rules applied 2697 place count 1871 transition count 1639
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2793 place count 1775 transition count 1639
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2793 place count 1775 transition count 1287
Deduced a syphon composed of 352 places in 6 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3497 place count 1423 transition count 1287
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3503 place count 1417 transition count 1281
Iterating global reduction 3 with 6 rules applied. Total rules applied 3509 place count 1417 transition count 1281
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 3509 place count 1417 transition count 1276
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 3519 place count 1412 transition count 1276
Performed 569 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 569 places in 0 ms
Reduce places removed 569 places and 0 transitions.
Iterating global reduction 3 with 1138 rules applied. Total rules applied 4657 place count 843 transition count 637
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 4658 place count 842 transition count 636
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 141 rules applied. Total rules applied 4799 place count 747 transition count 590
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4845 place count 701 transition count 590
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4845 place count 701 transition count 542
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4941 place count 653 transition count 542
Applied a total of 4941 rules in 324 ms. Remains 653 /3147 variables (removed 2494) and now considering 542/3062 (removed 2520) transitions.
// Phase 1: matrix 542 rows 653 cols
[2022-05-16 01:28:39] [INFO ] Computed 163 place invariants in 2 ms
[2022-05-16 01:28:40] [INFO ] Implicit Places using invariants in 346 ms returned [256, 330, 368, 442, 480, 484, 488, 492, 496, 500, 504, 508, 512, 516, 520, 524, 528, 532, 536, 540, 544, 548, 552, 556, 560, 564, 568, 572, 576, 578, 580, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 604, 610, 614, 618, 622, 626, 630, 635, 639, 643, 647, 652]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 360 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/3147 places, 542/3062 transitions.
Graph (trivial) has 248 edges and 600 vertex of which 13 / 600 are part of one of the 1 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 549 transition count 480
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 549 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 547 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 547 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 545 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 545 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 543 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 543 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 541 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 541 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 539 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 539 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 537 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 537 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 535 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 535 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 533 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 533 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 531 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 531 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 529 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 529 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 527 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 527 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 525 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 525 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 128 place count 524 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 524 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 523 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 523 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 522 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 522 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 521 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 521 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 520 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 520 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 519 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 519 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 518 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 518 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 517 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 517 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 516 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 516 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 515 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 515 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 149 place count 514 transition count 445
Applied a total of 149 rules in 156 ms. Remains 514 /600 variables (removed 86) and now considering 445/542 (removed 97) transitions.
// Phase 1: matrix 445 rows 514 cols
[2022-05-16 01:28:40] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-16 01:28:40] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 445 rows 514 cols
[2022-05-16 01:28:40] [INFO ] Computed 110 place invariants in 3 ms
[2022-05-16 01:28:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:28:40] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/3147 places, 445/3062 transitions.
Finished structural reductions, in 2 iterations. Remains : 514/3147 places, 445/3062 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s160 0), p0:(EQ s490 1), p1:(EQ s160 1), p2:(EQ s490 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 871 reset in 466 ms.
Product exploration explored 100000 steps with 868 reset in 742 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) p2), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 498 ms. Reduced automaton from 2 states, 5 edges and 4 AP to 2 states, 5 edges and 4 AP.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 445 rows 514 cols
[2022-05-16 01:28:43] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-16 01:28:43] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 01:28:43] [INFO ] [Nat]Absence check using 110 positive place invariants in 15 ms returned sat
[2022-05-16 01:28:43] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-16 01:28:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:28:43] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-05-16 01:28:43] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-16 01:28:43] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 514/514 places, 445/445 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 514 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 512 transition count 442
Free-agglomeration rule applied 184 times.
Iterating global reduction 2 with 184 rules applied. Total rules applied 189 place count 512 transition count 258
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t325.t631 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 248 edges and 220 vertex of which 93 / 220 are part of one of the 1 SCC in 0 ms
Free SCC test removed 92 places
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 2 with 117 rules applied. Total rules applied 306 place count 128 transition count 142
Reduce places removed 114 places and 0 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 3 with 242 rules applied. Total rules applied 548 place count 14 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 548 place count 14 transition count 12
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 552 place count 12 transition count 12
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 553 place count 11 transition count 11
Iterating global reduction 4 with 1 rules applied. Total rules applied 554 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 556 place count 10 transition count 10
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 15 edges and 10 vertex of which 8 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 4 with 2 rules applied. Total rules applied 558 place count 8 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 559 place count 8 transition count 8
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 561 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 563 place count 6 transition count 6
Applied a total of 563 rules in 16 ms. Remains 6 /514 variables (removed 508) and now considering 6/445 (removed 439) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/514 places, 6/445 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) p2), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (NOT p3)), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 337 ms. Reduced automaton from 2 states, 5 edges and 4 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 19 ms :[(NOT p3)]
Support contains 1 out of 514 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 514 /514 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 514 cols
[2022-05-16 01:28:44] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-16 01:28:44] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 445 rows 514 cols
[2022-05-16 01:28:44] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-16 01:28:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:28:44] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2022-05-16 01:28:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 445 rows 514 cols
[2022-05-16 01:28:44] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-16 01:28:45] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 514/514 places, 445/445 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p3)]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 738685 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 738685 steps, saw 108271 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 445 rows 514 cols
[2022-05-16 01:28:48] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-16 01:28:48] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:28:48] [INFO ] [Nat]Absence check using 110 positive place invariants in 13 ms returned sat
[2022-05-16 01:28:48] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:28:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:28:48] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 01:28:48] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-16 01:28:48] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 514/514 places, 445/445 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 514 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 512 transition count 442
Free-agglomeration rule applied 184 times.
Iterating global reduction 2 with 184 rules applied. Total rules applied 189 place count 512 transition count 258
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t325.t631 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 248 edges and 220 vertex of which 93 / 220 are part of one of the 1 SCC in 1 ms
Free SCC test removed 92 places
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 2 with 117 rules applied. Total rules applied 306 place count 128 transition count 142
Reduce places removed 114 places and 0 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 3 with 242 rules applied. Total rules applied 548 place count 14 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 548 place count 14 transition count 12
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 552 place count 12 transition count 12
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 553 place count 11 transition count 11
Iterating global reduction 4 with 1 rules applied. Total rules applied 554 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 556 place count 10 transition count 10
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 15 edges and 10 vertex of which 8 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 558 place count 8 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 559 place count 8 transition count 8
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 561 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 563 place count 6 transition count 6
Applied a total of 563 rules in 14 ms. Remains 6 /514 variables (removed 508) and now considering 6/445 (removed 439) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/514 places, 6/445 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p3)]
Product exploration explored 100000 steps with 866 reset in 516 ms.
Product exploration explored 100000 steps with 865 reset in 478 ms.
Built C files in :
/tmp/ltsmin16548692202129259375
[2022-05-16 01:28:50] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2022-05-16 01:28:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:28:50] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2022-05-16 01:28:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:28:50] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2022-05-16 01:28:50] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:28:50] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16548692202129259375
Running compilation step : cd /tmp/ltsmin16548692202129259375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 748 ms.
Running link step : cd /tmp/ltsmin16548692202129259375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16548692202129259375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13021945417883620637.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 445/445 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 514 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 512 transition count 443
Applied a total of 4 rules in 11 ms. Remains 512 /514 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 512 cols
[2022-05-16 01:29:05] [INFO ] Computed 110 place invariants in 4 ms
[2022-05-16 01:29:05] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 443 rows 512 cols
[2022-05-16 01:29:05] [INFO ] Computed 110 place invariants in 3 ms
[2022-05-16 01:29:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:29:05] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2022-05-16 01:29:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 443 rows 512 cols
[2022-05-16 01:29:05] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-16 01:29:06] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/514 places, 443/445 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/514 places, 443/445 transitions.
Built C files in :
/tmp/ltsmin14188462429098520290
[2022-05-16 01:29:06] [INFO ] Computing symmetric may disable matrix : 443 transitions.
[2022-05-16 01:29:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:29:06] [INFO ] Computing symmetric may enable matrix : 443 transitions.
[2022-05-16 01:29:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:29:06] [INFO ] Computing Do-Not-Accords matrix : 443 transitions.
[2022-05-16 01:29:06] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:29:06] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14188462429098520290
Running compilation step : cd /tmp/ltsmin14188462429098520290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 818 ms.
Running link step : cd /tmp/ltsmin14188462429098520290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14188462429098520290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16386117307053094522.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:29:21] [INFO ] Flatten gal took : 22 ms
[2022-05-16 01:29:21] [INFO ] Flatten gal took : 18 ms
[2022-05-16 01:29:21] [INFO ] Time to serialize gal into /tmp/LTL3258085340075590064.gal : 2 ms
[2022-05-16 01:29:21] [INFO ] Time to serialize properties into /tmp/LTL3826072777193451190.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3258085340075590064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3826072777193451190.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3258085...266
Read 1 LTL properties
Checking formula 0 : !((F(G((F(((G("(p3765==1)"))||("(p1091==1)"))||(F("(p3765==0)"))))&&("(p1091==0)")))))
Formula 0 simplified : !FG("(p1091==0)" & F("(p1091==1)" | G"(p3765==1)" | F"(p3765==0)"))
Detected timeout of ITS tools.
[2022-05-16 01:29:36] [INFO ] Flatten gal took : 26 ms
[2022-05-16 01:29:36] [INFO ] Applying decomposition
[2022-05-16 01:29:36] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8279106475554883658.txt' '-o' '/tmp/graph8279106475554883658.bin' '-w' '/tmp/graph8279106475554883658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8279106475554883658.bin' '-l' '-1' '-v' '-w' '/tmp/graph8279106475554883658.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:29:36] [INFO ] Decomposing Gal with order
[2022-05-16 01:29:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:29:36] [INFO ] Removed a total of 3 redundant transitions.
[2022-05-16 01:29:36] [INFO ] Flatten gal took : 35 ms
[2022-05-16 01:29:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-16 01:29:36] [INFO ] Time to serialize gal into /tmp/LTL4386344312238517340.gal : 4 ms
[2022-05-16 01:29:36] [INFO ] Time to serialize properties into /tmp/LTL11427823170192856908.ltl : 123 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4386344312238517340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11427823170192856908.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4386344...246
Read 1 LTL properties
Checking formula 0 : !((F(G((F(((G("(i5.i0.i1.u187.p3765==1)"))||("(i3.i0.i0.u70.p1091==1)"))||(F("(i5.i0.i1.u187.p3765==0)"))))&&("(i3.i0.i0.u70.p1091==0)...161
Formula 0 simplified : !FG("(i3.i0.i0.u70.p1091==0)" & F("(i3.i0.i0.u70.p1091==1)" | G"(i5.i0.i1.u187.p3765==1)" | F"(i5.i0.i1.u187.p3765==0)"))
Reverse transition relation is NOT exact ! Due to transitions t507_t631, i3.i0.i0.t0, Intersection with reachable at each step enabled. (destroyed/reverse...185
Computing Next relation with stutter on 1.99286e+13 deadlock states
1 unique states visited
1 strongly connected components in search stack
2 transitions explored
1 items max in DFS search stack
89 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.98616,61624,1,0,55947,79363,5659,92760,1930,249431,74598
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-48b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-48b-LTLFireability-09 finished in 58501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!(X(p0)&&F((X(p1) U !p0)))) U X(p2))))'
Support contains 3 out of 3147 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3138 transition count 3053
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3138 transition count 3053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 3138 transition count 3052
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 3133 transition count 3047
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 3133 transition count 3047
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 3130 transition count 3044
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 3130 transition count 3044
Applied a total of 35 rules in 853 ms. Remains 3130 /3147 variables (removed 17) and now considering 3044/3062 (removed 18) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:29:38] [INFO ] Computed 258 place invariants in 25 ms
[2022-05-16 01:29:39] [INFO ] Implicit Places using invariants in 973 ms returned []
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:29:39] [INFO ] Computed 258 place invariants in 14 ms
[2022-05-16 01:29:43] [INFO ] Implicit Places using invariants and state equation in 3772 ms returned []
Implicit Place search using SMT with State Equation took 4759 ms to find 0 implicit places.
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:29:43] [INFO ] Computed 258 place invariants in 21 ms
[2022-05-16 01:29:45] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3147 places, 3044/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3130/3147 places, 3044/3062 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) p0), (OR (NOT p0) (NOT p2)), p0, (NOT p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={} source=7 dest: 4}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=7, aps=[p0:(NEQ s2529 1), p2:(AND (EQ s1480 1) (EQ s2909 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 659 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-10 finished in 7623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(F(p0))||p1)))))'
Support contains 2 out of 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3139 transition count 3054
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3139 transition count 3054
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 3139 transition count 3053
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 3135 transition count 3049
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 3135 transition count 3049
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 3132 transition count 3046
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 3132 transition count 3046
Applied a total of 31 rules in 1216 ms. Remains 3132 /3147 variables (removed 15) and now considering 3046/3062 (removed 16) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:29:46] [INFO ] Computed 258 place invariants in 19 ms
[2022-05-16 01:29:47] [INFO ] Implicit Places using invariants in 916 ms returned []
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:29:47] [INFO ] Computed 258 place invariants in 11 ms
[2022-05-16 01:29:55] [INFO ] Implicit Places using invariants and state equation in 7536 ms returned []
Implicit Place search using SMT with State Equation took 8457 ms to find 0 implicit places.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:29:55] [INFO ] Computed 258 place invariants in 25 ms
[2022-05-16 01:29:57] [INFO ] Dead Transitions using invariants and state equation in 1915 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3147 places, 3046/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3132/3147 places, 3046/3062 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(EQ s824 1), p0:(EQ s221 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 880 ms.
Product exploration explored 100000 steps with 25000 reset in 879 ms.
Computed a total of 792 stabilizing places and 792 stable transitions
Computed a total of 792 stabilizing places and 792 stable transitions
Detected a total of 792/3132 stabilizing places and 792/3046 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1872 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3132/3132 places, 3046/3046 transitions.
Applied a total of 0 rules in 261 ms. Remains 3132 /3132 variables (removed 0) and now considering 3046/3046 (removed 0) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:30:00] [INFO ] Computed 258 place invariants in 24 ms
[2022-05-16 01:30:01] [INFO ] Implicit Places using invariants in 871 ms returned []
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:30:01] [INFO ] Computed 258 place invariants in 23 ms
[2022-05-16 01:30:04] [INFO ] Implicit Places using invariants and state equation in 3840 ms returned []
Implicit Place search using SMT with State Equation took 4726 ms to find 0 implicit places.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:30:04] [INFO ] Computed 258 place invariants in 9 ms
[2022-05-16 01:30:06] [INFO ] Dead Transitions using invariants and state equation in 1620 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3132/3132 places, 3046/3046 transitions.
Computed a total of 792 stabilizing places and 792 stable transitions
Computed a total of 792 stabilizing places and 792 stable transitions
Detected a total of 792/3132 stabilizing places and 792/3046 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1836 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=131 )
Knowledge obtained : [(AND (NOT p1) p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 942 ms.
Product exploration explored 100000 steps with 25000 reset in 1068 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3132/3132 places, 3046/3046 transitions.
Performed 1138 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1138 rules applied. Total rules applied 1138 place count 3132 transition count 3046
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 96 rules applied. Total rules applied 1234 place count 3132 transition count 2998
Performed 423 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 423 Pre rules applied. Total rules applied 1234 place count 3132 transition count 3000
Deduced a syphon composed of 1609 places in 17 ms
Iterating global reduction 2 with 423 rules applied. Total rules applied 1657 place count 3132 transition count 3000
Discarding 1051 places :
Symmetric choice reduction at 2 with 1051 rule applications. Total rules 2708 place count 2081 transition count 1949
Deduced a syphon composed of 558 places in 12 ms
Iterating global reduction 2 with 1051 rules applied. Total rules applied 3759 place count 2081 transition count 1949
Performed 680 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 1238 places in 1 ms
Iterating global reduction 2 with 680 rules applied. Total rules applied 4439 place count 2081 transition count 1878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4440 place count 2081 transition count 1877
Renaming transitions due to excessive name length > 1024 char.
Discarding 422 places :
Symmetric choice reduction at 3 with 422 rule applications. Total rules 4862 place count 1659 transition count 1455
Deduced a syphon composed of 816 places in 0 ms
Iterating global reduction 3 with 422 rules applied. Total rules applied 5284 place count 1659 transition count 1455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 817 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 5285 place count 1659 transition count 1455
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5286 place count 1658 transition count 1454
Deduced a syphon composed of 816 places in 7 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 5287 place count 1658 transition count 1454
Deduced a syphon composed of 816 places in 1 ms
Applied a total of 5287 rules in 1832 ms. Remains 1658 /3132 variables (removed 1474) and now considering 1454/3046 (removed 1592) transitions.
[2022-05-16 01:30:11] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1454 rows 1658 cols
[2022-05-16 01:30:11] [INFO ] Computed 258 place invariants in 66 ms
[2022-05-16 01:30:13] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1658/3132 places, 1454/3046 transitions.
Finished structural reductions, in 1 iterations. Remains : 1658/3132 places, 1454/3046 transitions.
Product exploration explored 100000 steps with 25000 reset in 2688 ms.
Product exploration explored 100000 steps with 25000 reset in 2695 ms.
Built C files in :
/tmp/ltsmin4042470243638081969
[2022-05-16 01:30:18] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4042470243638081969
Running compilation step : cd /tmp/ltsmin4042470243638081969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4042470243638081969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4042470243638081969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3132/3132 places, 3046/3046 transitions.
Applied a total of 0 rules in 331 ms. Remains 3132 /3132 variables (removed 0) and now considering 3046/3046 (removed 0) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:30:21] [INFO ] Computed 258 place invariants in 23 ms
[2022-05-16 01:30:22] [INFO ] Implicit Places using invariants in 884 ms returned []
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:30:22] [INFO ] Computed 258 place invariants in 17 ms
[2022-05-16 01:30:26] [INFO ] Implicit Places using invariants and state equation in 3807 ms returned []
Implicit Place search using SMT with State Equation took 4712 ms to find 0 implicit places.
// Phase 1: matrix 3046 rows 3132 cols
[2022-05-16 01:30:26] [INFO ] Computed 258 place invariants in 24 ms
[2022-05-16 01:30:28] [INFO ] Dead Transitions using invariants and state equation in 1799 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3132/3132 places, 3046/3046 transitions.
Built C files in :
/tmp/ltsmin9650173513344244826
[2022-05-16 01:30:28] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9650173513344244826
Running compilation step : cd /tmp/ltsmin9650173513344244826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9650173513344244826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9650173513344244826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 01:30:31] [INFO ] Flatten gal took : 84 ms
[2022-05-16 01:30:31] [INFO ] Flatten gal took : 87 ms
[2022-05-16 01:30:31] [INFO ] Time to serialize gal into /tmp/LTL3268762123026905862.gal : 10 ms
[2022-05-16 01:30:31] [INFO ] Time to serialize properties into /tmp/LTL6610098812784369853.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3268762123026905862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6610098812784369853.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3268762...266
Read 1 LTL properties
Checking formula 0 : !((F(X(X((X(F("(p227==0)")))||("(p1246==1)"))))))
Formula 0 simplified : !FXX("(p1246==1)" | XF"(p227==0)")
Detected timeout of ITS tools.
[2022-05-16 01:30:46] [INFO ] Flatten gal took : 61 ms
[2022-05-16 01:30:46] [INFO ] Applying decomposition
[2022-05-16 01:30:46] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18133507972021649188.txt' '-o' '/tmp/graph18133507972021649188.bin' '-w' '/tmp/graph18133507972021649188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18133507972021649188.bin' '-l' '-1' '-v' '-w' '/tmp/graph18133507972021649188.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:30:47] [INFO ] Decomposing Gal with order
[2022-05-16 01:30:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:30:47] [INFO ] Removed a total of 557 redundant transitions.
[2022-05-16 01:30:47] [INFO ] Flatten gal took : 157 ms
[2022-05-16 01:30:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2022-05-16 01:30:47] [INFO ] Time to serialize gal into /tmp/LTL13684360609084027496.gal : 24 ms
[2022-05-16 01:30:47] [INFO ] Time to serialize properties into /tmp/LTL13965533739851575213.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13684360609084027496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13965533739851575213.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1368436...247
Read 1 LTL properties
Checking formula 0 : !((F(X(X((X(F("(i8.u95.p227==0)")))||("(i17.u358.p1246==1)"))))))
Formula 0 simplified : !FXX("(i17.u358.p1246==1)" | XF"(i8.u95.p227==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16635769640068347882
[2022-05-16 01:31:02] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16635769640068347882
Running compilation step : cd /tmp/ltsmin16635769640068347882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16635769640068347882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16635769640068347882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property AutoFlight-PT-48b-LTLFireability-11 finished in 80470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(G(X(p0))))) U (p1 U X(X(p2)))))))'
Support contains 3 out of 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3139 transition count 3054
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3139 transition count 3054
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 3139 transition count 3053
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 3135 transition count 3049
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 3135 transition count 3049
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 3133 transition count 3047
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 3133 transition count 3047
Applied a total of 29 rules in 1277 ms. Remains 3133 /3147 variables (removed 14) and now considering 3047/3062 (removed 15) transitions.
// Phase 1: matrix 3047 rows 3133 cols
[2022-05-16 01:31:07] [INFO ] Computed 258 place invariants in 19 ms
[2022-05-16 01:31:08] [INFO ] Implicit Places using invariants in 977 ms returned []
// Phase 1: matrix 3047 rows 3133 cols
[2022-05-16 01:31:08] [INFO ] Computed 258 place invariants in 10 ms
[2022-05-16 01:31:12] [INFO ] Implicit Places using invariants and state equation in 3987 ms returned []
Implicit Place search using SMT with State Equation took 4985 ms to find 0 implicit places.
// Phase 1: matrix 3047 rows 3133 cols
[2022-05-16 01:31:12] [INFO ] Computed 258 place invariants in 21 ms
[2022-05-16 01:31:13] [INFO ] Dead Transitions using invariants and state equation in 1578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3133/3147 places, 3047/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3133/3147 places, 3047/3062 transitions.
Stuttering acceptance computed with spot in 6242 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), false, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}, { cond=true, acceptance={0, 1} source=0 dest: 2}, { cond=p1, acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 4}, { cond=true, acceptance={0, 1} source=1 dest: 5}, { cond=true, acceptance={1} source=1 dest: 6}, { cond=p1, acceptance={0, 1} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 8}, { cond=true, acceptance={0, 1} source=2 dest: 9}, { cond=p1, acceptance={0, 1} source=2 dest: 10}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 4}, { cond=true, acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0, 1} source=3 dest: 7}, { cond=(NOT p1), acceptance={1} source=3 dest: 11}, { cond=p1, acceptance={1} source=3 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 13}, { cond=(NOT p2), acceptance={0, 1} source=4 dest: 14}, { cond=(NOT p2), acceptance={1} source=4 dest: 15}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 17}, { cond=(NOT p2), acceptance={0, 1} source=5 dest: 18}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 19}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 20}, { cond=(NOT p2), acceptance={0, 1} source=6 dest: 21}, { cond=(NOT p2), acceptance={1} source=6 dest: 22}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=6 dest: 23}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 13}, { cond=(NOT p2), acceptance={0, 1} source=7 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=7 dest: 16}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 24}, { cond=(AND p1 (NOT p2)), acceptance={1} source=7 dest: 25}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=8 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=8 dest: 5}, { cond=(NOT p2), acceptance={1} source=8 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=8 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=9 dest: 8}, { cond=(NOT p2), acceptance={0, 1} source=9 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=10 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=10 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=10 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={1} source=10 dest: 12}], [{ cond=(NOT p2), acceptance={1} source=11 dest: 26}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=12 dest: 27}, { cond=(AND p1 (NOT p2)), acceptance={1} source=12 dest: 28}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=13 dest: 29}, { cond=(NOT p2), acceptance={0, 1} source=13 dest: 30}, { cond=(NOT p2), acceptance={1} source=13 dest: 31}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=13 dest: 32}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=14 dest: 33}, { cond=(NOT p2), acceptance={0, 1} source=14 dest: 34}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=14 dest: 35}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=15 dest: 36}, { cond=(NOT p2), acceptance={0, 1} source=15 dest: 37}, { cond=(NOT p2), acceptance={1} source=15 dest: 38}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=15 dest: 39}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=16 dest: 29}, { cond=(NOT p2), acceptance={0, 1} source=16 dest: 30}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=16 dest: 32}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=16 dest: 40}, { cond=(AND p1 (NOT p2)), acceptance={1} source=16 dest: 41}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=17 dest: 42}, { cond=(NOT p2), acceptance={0, 1} source=17 dest: 43}, { cond=(NOT p2), acceptance={1} source=17 dest: 44}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=17 dest: 45}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=18 dest: 46}, { cond=(NOT p2), acceptance={0, 1} source=18 dest: 47}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=18 dest: 48}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=19 dest: 42}, { cond=(NOT p2), acceptance={0, 1} source=19 dest: 43}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=19 dest: 45}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=19 dest: 49}, { cond=(AND p1 (NOT p2)), acceptance={1} source=19 dest: 50}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=20 dest: 42}, { cond=p2, acceptance={0, 1} source=20 dest: 43}, { cond=p2, acceptance={1} source=20 dest: 44}, { cond=(AND p1 p2), acceptance={0, 1} source=20 dest: 45}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=21 dest: 46}, { cond=p2, acceptance={0, 1} source=21 dest: 47}, { cond=(AND p1 p2), acceptance={0, 1} source=21 dest: 48}], [{ cond=(NOT p1), acceptance={0, 1} source=22 dest: 51}, { cond=true, acceptance={0, 1} source=22 dest: 52}, { cond=true, acceptance={1} source=22 dest: 53}, { cond=p1, acceptance={0, 1} source=22 dest: 54}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=23 dest: 42}, { cond=p2, acceptance={0, 1} source=23 dest: 43}, { cond=(AND p1 p2), acceptance={0, 1} source=23 dest: 45}, { cond=(AND (NOT p1) p2), acceptance={1} source=23 dest: 49}, { cond=(AND p1 p2), acceptance={1} source=23 dest: 50}], [{ cond=(NOT p2), acceptance={1} source=24 dest: 55}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=25 dest: 56}, { cond=(AND p1 (NOT p2)), acceptance={1} source=25 dest: 57}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=26 dest: 51}, { cond=(NOT p2), acceptance={0, 1} source=26 dest: 52}, { cond=(NOT p2), acceptance={1} source=26 dest: 53}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=26 dest: 54}], [{ cond=(NOT p2), acceptance={1} source=27 dest: 58}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=28 dest: 59}, { cond=(AND p1 (NOT p2)), acceptance={1} source=28 dest: 60}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=29 dest: 29}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=29 dest: 30}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=29 dest: 31}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=29 dest: 32}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=30 dest: 33}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=30 dest: 34}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=30 dest: 35}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=31 dest: 36}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=31 dest: 37}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=31 dest: 38}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=31 dest: 39}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=32 dest: 29}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=32 dest: 30}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=32 dest: 32}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=32 dest: 40}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=32 dest: 41}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=33 dest: 42}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=33 dest: 43}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=33 dest: 44}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=33 dest: 45}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=34 dest: 46}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=34 dest: 47}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=34 dest: 48}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=35 dest: 42}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=35 dest: 43}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=35 dest: 45}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=35 dest: 49}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=35 dest: 50}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0} source=36 dest: 42}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=36 dest: 42}, { cond=(AND p2 p0), acceptance={0} source=36 dest: 43}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=36 dest: 43}, { cond=(AND p2 p0), acceptance={} source=36 dest: 44}, { cond=(AND p2 (NOT p0)), acceptance={1} source=36 dest: 44}, { cond=(AND p1 p2 p0), acceptance={0} source=36 dest: 45}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=36 dest: 45}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0} source=37 dest: 46}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=37 dest: 46}, { cond=(AND p2 p0), acceptance={0} source=37 dest: 47}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=37 dest: 47}, { cond=(AND p1 p2 p0), acceptance={0} source=37 dest: 48}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=37 dest: 48}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=38 dest: 51}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=38 dest: 51}, { cond=p0, acceptance={0} source=38 dest: 52}, { cond=(NOT p0), acceptance={0, 1} source=38 dest: 52}, { cond=p0, acceptance={} source=38 dest: 53}, { cond=(NOT p0), acceptance={1} source=38 dest: 53}, { cond=(AND p1 p0), acceptance={0} source=38 dest: 54}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=38 dest: 54}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0} source=39 dest: 42}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=39 dest: 42}, { cond=(AND p2 p0), acceptance={0} source=39 dest: 43}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=39 dest: 43}, { cond=(AND p1 p2 p0), acceptance={0} source=39 dest: 45}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=39 dest: 45}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=39 dest: 49}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=39 dest: 49}, { cond=(AND p1 p2 p0), acceptance={} source=39 dest: 50}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=39 dest: 50}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=40 dest: 55}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=41 dest: 56}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=41 dest: 57}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=42 dest: 13}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=42 dest: 14}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=42 dest: 15}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=42 dest: 16}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=42 dest: 29}, { cond=(AND (NOT p2) p0), acceptance={0} source=42 dest: 30}, { cond=(AND (NOT p2) p0), acceptance={} source=42 dest: 31}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=42 dest: 32}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=43 dest: 17}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=43 dest: 18}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=43 dest: 19}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=43 dest: 33}, { cond=(AND (NOT p2) p0), acceptance={0} source=43 dest: 34}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=43 dest: 35}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=44 dest: 20}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=44 dest: 21}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=44 dest: 22}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=44 dest: 23}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=44 dest: 36}, { cond=(AND (NOT p2) p0), acceptance={0} source=44 dest: 37}, { cond=(AND (NOT p2) p0), acceptance={} source=44 dest: 38}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=44 dest: 39}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=45 dest: 13}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=45 dest: 14}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=45 dest: 16}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=45 dest: 24}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=45 dest: 25}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=45 dest: 29}, { cond=(AND (NOT p2) p0), acceptance={0} source=45 dest: 30}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=45 dest: 32}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=45 dest: 40}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=45 dest: 41}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=46 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=46 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=46 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=46 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=46 dest: 42}, { cond=(AND (NOT p2) p0), acceptance={0} source=46 dest: 43}, { cond=(AND (NOT p2) p0), acceptance={} source=46 dest: 44}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=46 dest: 45}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=47 dest: 8}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=47 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=47 dest: 10}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=47 dest: 46}, { cond=(AND (NOT p2) p0), acceptance={0} source=47 dest: 47}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=47 dest: 48}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=48 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=48 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=48 dest: 7}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=48 dest: 11}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=48 dest: 12}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=48 dest: 42}, { cond=(AND (NOT p2) p0), acceptance={0} source=48 dest: 43}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=48 dest: 45}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=48 dest: 49}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=48 dest: 50}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=49 dest: 26}, { cond=(AND (NOT p2) p0), acceptance={} source=49 dest: 55}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=50 dest: 27}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=50 dest: 28}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=50 dest: 56}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=50 dest: 57}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=51 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=51 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={1} source=51 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=51 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=51 dest: 42}, { cond=(AND p2 p0), acceptance={0} source=51 dest: 43}, { cond=(AND p2 p0), acceptance={} source=51 dest: 44}, { cond=(AND p1 p2 p0), acceptance={0} source=51 dest: 45}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=52 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=52 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=52 dest: 10}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=52 dest: 46}, { cond=(AND p2 p0), acceptance={0} source=52 dest: 47}, { cond=(AND p1 p2 p0), acceptance={0} source=52 dest: 48}], [{ cond=(NOT p0), acceptance={1} source=53 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=53 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=53 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=53 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=53 dest: 51}, { cond=p0, acceptance={0} source=53 dest: 52}, { cond=p0, acceptance={} source=53 dest: 53}, { cond=(AND p1 p0), acceptance={0} source=53 dest: 54}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=54 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=54 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=54 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=54 dest: 11}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=54 dest: 12}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=54 dest: 42}, { cond=(AND p2 p0), acceptance={0} source=54 dest: 43}, { cond=(AND p1 p2 p0), acceptance={0} source=54 dest: 45}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=54 dest: 49}, { cond=(AND p1 p2 p0), acceptance={} source=54 dest: 50}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=55 dest: 51}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=55 dest: 51}, { cond=(AND (NOT p2) p0), acceptance={0} source=55 dest: 52}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=55 dest: 52}, { cond=(AND (NOT p2) p0), acceptance={} source=55 dest: 53}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=55 dest: 53}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=55 dest: 54}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=55 dest: 54}], [{ cond=(AND (NOT p2) p0), acceptance={} source=56 dest: 58}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=56 dest: 58}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=57 dest: 59}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=57 dest: 59}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=57 dest: 60}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=57 dest: 60}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=58 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=58 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=58 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=58 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=59 dest: 61}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=60 dest: 62}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=60 dest: 63}], [{ cond=(AND (NOT p2) p0), acceptance={1} source=61 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=61 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=61 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=61 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={1} source=62 dest: 61}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={1} source=63 dest: 62}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=63 dest: 63}]], initial=0, aps=[p1:(EQ s1500 1), p2:(EQ s348 1), p0:(EQ s547 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9151 reset in 559 ms.
Product exploration explored 100000 steps with 9126 reset in 449 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96874 ms. Reduced automaton from 64 states, 286 edges and 3 AP to 64 states, 286 edges and 3 AP.
Stuttering acceptance computed with spot in 7162 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), false, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 23) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 3047 rows 3133 cols
[2022-05-16 01:33:06] [INFO ] Computed 258 place invariants in 12 ms
[2022-05-16 01:33:07] [INFO ] [Real]Absence check using 257 positive place invariants in 210 ms returned sat
[2022-05-16 01:33:07] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 10 ms returned sat
[2022-05-16 01:33:10] [INFO ] After 2166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:12
[2022-05-16 01:33:11] [INFO ] Deduced a trap composed of 43 places in 1194 ms of which 2 ms to minimize.
[2022-05-16 01:33:13] [INFO ] Deduced a trap composed of 93 places in 1083 ms of which 1 ms to minimize.
[2022-05-16 01:33:14] [INFO ] Deduced a trap composed of 109 places in 900 ms of which 1 ms to minimize.
[2022-05-16 01:33:15] [INFO ] Deduced a trap composed of 234 places in 984 ms of which 2 ms to minimize.
[2022-05-16 01:33:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5087 ms
[2022-05-16 01:33:16] [INFO ] After 8589ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-16 01:33:16] [INFO ] After 10807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-16 01:33:18] [INFO ] [Nat]Absence check using 257 positive place invariants in 223 ms returned sat
[2022-05-16 01:33:18] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 12 ms returned sat
[2022-05-16 01:33:22] [INFO ] After 3725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-16 01:33:24] [INFO ] Deduced a trap composed of 43 places in 1107 ms of which 2 ms to minimize.
[2022-05-16 01:33:25] [INFO ] Deduced a trap composed of 93 places in 1132 ms of which 2 ms to minimize.
[2022-05-16 01:33:26] [INFO ] Deduced a trap composed of 109 places in 1069 ms of which 1 ms to minimize.
[2022-05-16 01:33:27] [INFO ] Deduced a trap composed of 234 places in 804 ms of which 2 ms to minimize.
[2022-05-16 01:33:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4898 ms
[2022-05-16 01:33:28] [INFO ] Deduced a trap composed of 204 places in 888 ms of which 2 ms to minimize.
[2022-05-16 01:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1311 ms
[2022-05-16 01:33:34] [INFO ] After 15383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 2667 ms.
[2022-05-16 01:33:37] [INFO ] After 20333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 9 different solutions.
Parikh walk visited 5 properties in 950 ms.
Support contains 3 out of 3133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3133/3133 places, 3047/3047 transitions.
Drop transitions removed 1269 transitions
Trivial Post-agglo rules discarded 1269 transitions
Performed 1269 trivial Post agglomeration. Transition count delta: 1269
Iterating post reduction 0 with 1269 rules applied. Total rules applied 1269 place count 3133 transition count 1778
Reduce places removed 1269 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 1412 rules applied. Total rules applied 2681 place count 1864 transition count 1635
Reduce places removed 95 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 96 rules applied. Total rules applied 2777 place count 1769 transition count 1634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2778 place count 1768 transition count 1634
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 352 Pre rules applied. Total rules applied 2778 place count 1768 transition count 1282
Deduced a syphon composed of 352 places in 6 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 704 rules applied. Total rules applied 3482 place count 1416 transition count 1282
Performed 572 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 572 places in 0 ms
Reduce places removed 572 places and 0 transitions.
Iterating global reduction 4 with 1144 rules applied. Total rules applied 4626 place count 844 transition count 639
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4627 place count 844 transition count 638
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 144 times.
Iterating global reduction 5 with 144 rules applied. Total rules applied 4771 place count 844 transition count 494
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 4915 place count 700 transition count 494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4916 place count 699 transition count 493
Reduce places removed 201 places and 0 transitions.
Drop transitions removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 6 with 521 rules applied. Total rules applied 5437 place count 498 transition count 173
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 7 with 320 rules applied. Total rules applied 5757 place count 178 transition count 173
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 57 Pre rules applied. Total rules applied 5757 place count 178 transition count 116
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 8 with 114 rules applied. Total rules applied 5871 place count 121 transition count 116
Applied a total of 5871 rules in 335 ms. Remains 121 /3133 variables (removed 3012) and now considering 116/3047 (removed 2931) transitions.
Finished structural reductions, in 1 iterations. Remains : 121/3133 places, 116/3047 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 121 cols
[2022-05-16 01:33:38] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 01:33:38] [INFO ] [Real]Absence check using 55 positive place invariants in 7 ms returned sat
[2022-05-16 01:33:38] [INFO ] [Real]Absence check using 55 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 01:33:38] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 01:33:38] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 01:33:38] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND p1 p0 p2)), (F (AND (NOT p0) p2)), (F (AND p1 p2)), (F (AND p1 (NOT p0))), (F p1), (F (AND p1 p0)), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 101761 ms. Reduced automaton from 64 states, 286 edges and 3 AP to 64 states, 286 edges and 3 AP.
Stuttering acceptance computed with spot in 6810 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), false, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 6622 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), false, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
// Phase 1: matrix 3047 rows 3133 cols
[2022-05-16 01:35:34] [INFO ] Computed 258 place invariants in 16 ms
[2022-05-16 01:35:36] [INFO ] [Real]Absence check using 257 positive place invariants in 265 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND p1 p0 p2)), (F (AND (NOT p0) p2)), (F (AND p1 p2)), (F (AND p1 (NOT p0))), (F p1), (F (AND p1 p0)), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) p0 (NOT p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 5 factoid took 34930 ms. Reduced automaton from 64 states, 286 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA AutoFlight-PT-48b-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLFireability-12 finished in 305749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(p0)||p1)))'
Support contains 2 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1276 transitions
Trivial Post-agglo rules discarded 1276 transitions
Performed 1276 trivial Post agglomeration. Transition count delta: 1276
Iterating post reduction 0 with 1276 rules applied. Total rules applied 1276 place count 3146 transition count 1785
Reduce places removed 1276 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1423 rules applied. Total rules applied 2699 place count 1870 transition count 1638
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2796 place count 1774 transition count 1637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2797 place count 1773 transition count 1637
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 352 Pre rules applied. Total rules applied 2797 place count 1773 transition count 1285
Deduced a syphon composed of 352 places in 8 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 704 rules applied. Total rules applied 3501 place count 1421 transition count 1285
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 3508 place count 1414 transition count 1278
Iterating global reduction 4 with 7 rules applied. Total rules applied 3515 place count 1414 transition count 1278
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 3515 place count 1414 transition count 1272
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 3527 place count 1408 transition count 1272
Performed 564 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 564 places in 0 ms
Reduce places removed 564 places and 0 transitions.
Iterating global reduction 4 with 1128 rules applied. Total rules applied 4655 place count 844 transition count 638
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 4656 place count 843 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4657 place count 842 transition count 637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4657 place count 842 transition count 636
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4659 place count 841 transition count 636
Applied a total of 4659 rules in 401 ms. Remains 841 /3147 variables (removed 2306) and now considering 636/3062 (removed 2426) transitions.
// Phase 1: matrix 636 rows 841 cols
[2022-05-16 01:36:12] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 01:36:12] [INFO ] Implicit Places using invariants in 578 ms returned [612, 618, 624, 630, 636, 642, 648, 654, 660, 666, 672, 678, 684, 690, 696, 702, 708, 714, 720, 724, 728, 732, 736, 740, 744, 748, 752, 756, 760, 764, 768, 774, 780, 786, 792, 798, 804, 810, 816, 822, 828, 834, 840]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 584 ms to find 43 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 798/3147 places, 636/3062 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 757 transition count 595
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 757 transition count 595
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 104 place count 746 transition count 584
Applied a total of 104 rules in 83 ms. Remains 746 /798 variables (removed 52) and now considering 584/636 (removed 52) transitions.
// Phase 1: matrix 584 rows 746 cols
[2022-05-16 01:36:12] [INFO ] Computed 214 place invariants in 3 ms
[2022-05-16 01:36:13] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 584 rows 746 cols
[2022-05-16 01:36:13] [INFO ] Computed 214 place invariants in 13 ms
[2022-05-16 01:36:13] [INFO ] State equation strengthened by 239 read => feed constraints.
[2022-05-16 01:36:15] [INFO ] Implicit Places using invariants and state equation in 2478 ms returned [254, 256, 258, 260, 262, 264, 266, 268, 270, 272, 274, 276, 278, 280, 282, 284, 286, 288, 290, 292, 294, 296, 298, 300, 302, 304, 306, 308, 310, 312, 314, 316, 318, 320, 322, 324, 326, 328, 330, 332, 334, 336, 338, 343, 345, 347]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 2917 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 700/3147 places, 584/3062 transitions.
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 34 Pre rules applied. Total rules applied 0 place count 700 transition count 550
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 68 place count 666 transition count 550
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 655 transition count 539
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 655 transition count 539
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 654 transition count 538
Applied a total of 92 rules in 53 ms. Remains 654 /700 variables (removed 46) and now considering 538/584 (removed 46) transitions.
// Phase 1: matrix 538 rows 654 cols
[2022-05-16 01:36:15] [INFO ] Computed 168 place invariants in 2 ms
[2022-05-16 01:36:16] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 538 rows 654 cols
[2022-05-16 01:36:16] [INFO ] Computed 168 place invariants in 3 ms
[2022-05-16 01:36:16] [INFO ] State equation strengthened by 193 read => feed constraints.
[2022-05-16 01:36:17] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 654/3147 places, 538/3062 transitions.
Finished structural reductions, in 3 iterations. Remains : 654/3147 places, 538/3062 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1 0), p0:(EQ s545 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1025 reset in 789 ms.
Product exploration explored 100000 steps with 1025 reset in 621 ms.
Computed a total of 54 stabilizing places and 5 stable transitions
Computed a total of 54 stabilizing places and 5 stable transitions
Detected a total of 54/654 stabilizing places and 5/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 538/538 transitions.
Applied a total of 0 rules in 27 ms. Remains 654 /654 variables (removed 0) and now considering 538/538 (removed 0) transitions.
// Phase 1: matrix 538 rows 654 cols
[2022-05-16 01:36:20] [INFO ] Computed 168 place invariants in 2 ms
[2022-05-16 01:36:20] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 538 rows 654 cols
[2022-05-16 01:36:20] [INFO ] Computed 168 place invariants in 6 ms
[2022-05-16 01:36:20] [INFO ] State equation strengthened by 193 read => feed constraints.
[2022-05-16 01:36:22] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
[2022-05-16 01:36:22] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 538 rows 654 cols
[2022-05-16 01:36:22] [INFO ] Computed 168 place invariants in 3 ms
[2022-05-16 01:36:22] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 654/654 places, 538/538 transitions.
Computed a total of 54 stabilizing places and 5 stable transitions
Computed a total of 54 stabilizing places and 5 stable transitions
Detected a total of 54/654 stabilizing places and 5/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 1032 reset in 820 ms.
Product exploration explored 100000 steps with 1031 reset in 890 ms.
Built C files in :
/tmp/ltsmin11544060476928451393
[2022-05-16 01:36:25] [INFO ] Computing symmetric may disable matrix : 538 transitions.
[2022-05-16 01:36:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:36:25] [INFO ] Computing symmetric may enable matrix : 538 transitions.
[2022-05-16 01:36:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:36:25] [INFO ] Computing Do-Not-Accords matrix : 538 transitions.
[2022-05-16 01:36:25] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:36:25] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11544060476928451393
Running compilation step : cd /tmp/ltsmin11544060476928451393;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1309 ms.
Running link step : cd /tmp/ltsmin11544060476928451393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin11544060476928451393;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12124368083415555896.hoa' '--buchi-type=spotba'
LTSmin run took 2733 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-48b-LTLFireability-13 finished in 17698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&X(G((X(p1)&&p2)))))'
Support contains 5 out of 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3138 transition count 3053
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3138 transition count 3053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 3138 transition count 3052
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 3133 transition count 3047
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 3133 transition count 3047
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 3130 transition count 3044
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 3130 transition count 3044
Applied a total of 35 rules in 920 ms. Remains 3130 /3147 variables (removed 17) and now considering 3044/3062 (removed 18) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:36:30] [INFO ] Computed 258 place invariants in 11 ms
[2022-05-16 01:36:31] [INFO ] Implicit Places using invariants in 805 ms returned []
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:36:31] [INFO ] Computed 258 place invariants in 13 ms
[2022-05-16 01:36:35] [INFO ] Implicit Places using invariants and state equation in 4271 ms returned []
Implicit Place search using SMT with State Equation took 5098 ms to find 0 implicit places.
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:36:35] [INFO ] Computed 258 place invariants in 21 ms
[2022-05-16 01:36:37] [INFO ] Dead Transitions using invariants and state equation in 1748 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3147 places, 3044/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3130/3147 places, 3044/3062 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s778 0) (EQ s1998 0)), p1:(EQ s2665 0), p0:(AND (EQ s2607 1) (EQ s3126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1862 steps with 0 reset in 15 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-14 finished in 8029 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3138 transition count 3053
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3138 transition count 3053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 3138 transition count 3052
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 3133 transition count 3047
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 3133 transition count 3047
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 3130 transition count 3044
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 3130 transition count 3044
Applied a total of 35 rules in 1122 ms. Remains 3130 /3147 variables (removed 17) and now considering 3044/3062 (removed 18) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:36:38] [INFO ] Computed 258 place invariants in 20 ms
[2022-05-16 01:36:39] [INFO ] Implicit Places using invariants in 824 ms returned []
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:36:39] [INFO ] Computed 258 place invariants in 9 ms
[2022-05-16 01:36:46] [INFO ] Implicit Places using invariants and state equation in 7115 ms returned []
Implicit Place search using SMT with State Equation took 7957 ms to find 0 implicit places.
// Phase 1: matrix 3044 rows 3130 cols
[2022-05-16 01:36:46] [INFO ] Computed 258 place invariants in 28 ms
[2022-05-16 01:36:48] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3147 places, 3044/3062 transitions.
Finished structural reductions, in 1 iterations. Remains : 3130/3147 places, 3044/3062 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-15 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 s2937 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 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-15 finished in 10913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!p1))))'
Found a SL insensitive property : AutoFlight-PT-48b-LTLFireability-02
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, true]
Support contains 2 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1276 transitions
Trivial Post-agglo rules discarded 1276 transitions
Performed 1276 trivial Post agglomeration. Transition count delta: 1276
Iterating post reduction 0 with 1276 rules applied. Total rules applied 1276 place count 3146 transition count 1785
Reduce places removed 1276 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1422 rules applied. Total rules applied 2698 place count 1870 transition count 1639
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2794 place count 1774 transition count 1639
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2794 place count 1774 transition count 1287
Deduced a syphon composed of 352 places in 9 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3498 place count 1422 transition count 1287
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3504 place count 1416 transition count 1281
Iterating global reduction 3 with 6 rules applied. Total rules applied 3510 place count 1416 transition count 1281
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 3510 place count 1416 transition count 1276
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 3520 place count 1411 transition count 1276
Performed 567 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 567 places in 0 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 3 with 1134 rules applied. Total rules applied 4654 place count 844 transition count 639
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4655 place count 844 transition count 639
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4656 place count 843 transition count 638
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 3 with 142 rules applied. Total rules applied 4798 place count 748 transition count 591
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 4845 place count 701 transition count 591
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4845 place count 701 transition count 543
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4941 place count 653 transition count 543
Applied a total of 4941 rules in 414 ms. Remains 653 /3147 variables (removed 2494) and now considering 543/3062 (removed 2519) transitions.
// Phase 1: matrix 543 rows 653 cols
[2022-05-16 01:36:48] [INFO ] Computed 163 place invariants in 2 ms
[2022-05-16 01:36:49] [INFO ] Implicit Places using invariants in 375 ms returned [258, 332, 370, 444, 482, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 526, 530, 534, 538, 542, 546, 550, 554, 558, 562, 566, 570, 574, 578, 580, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 602, 606, 610, 614, 618, 622, 626, 630, 635, 639, 643, 647, 652]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 381 ms to find 53 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 600/3147 places, 543/3062 transitions.
Graph (trivial) has 248 edges and 600 vertex of which 13 / 600 are part of one of the 1 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 549 transition count 481
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 549 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 547 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 547 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 545 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 545 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 543 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 541 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 539 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 537 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 537 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 535 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 531 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 531 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 529 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 529 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 527 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 527 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 525 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 525 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 128 place count 524 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 524 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 523 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 522 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 513 transition count 445
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 153 place count 512 transition count 444
Applied a total of 153 rules in 188 ms. Remains 512 /600 variables (removed 88) and now considering 444/543 (removed 99) transitions.
// Phase 1: matrix 444 rows 512 cols
[2022-05-16 01:36:49] [INFO ] Computed 110 place invariants in 3 ms
[2022-05-16 01:36:49] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 444 rows 512 cols
[2022-05-16 01:36:49] [INFO ] Computed 110 place invariants in 3 ms
[2022-05-16 01:36:49] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-05-16 01:36:50] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 512/3147 places, 444/3062 transitions.
Finished structural reductions, in 2 iterations. Remains : 512/3147 places, 444/3062 transitions.
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1 1), p1:(OR (EQ s167 1) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 5 reset in 1 ms.
Treatment of property AutoFlight-PT-48b-LTLFireability-02 finished in 2267 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-02 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(F(p0))||p1)))))'
Found a CL insensitive property : AutoFlight-PT-48b-LTLFireability-11
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3147/3147 places, 3062/3062 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1275 transitions
Trivial Post-agglo rules discarded 1275 transitions
Performed 1275 trivial Post agglomeration. Transition count delta: 1275
Iterating post reduction 0 with 1275 rules applied. Total rules applied 1275 place count 3146 transition count 1786
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1422 rules applied. Total rules applied 2697 place count 1871 transition count 1639
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2793 place count 1775 transition count 1639
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2793 place count 1775 transition count 1287
Deduced a syphon composed of 352 places in 9 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3497 place count 1423 transition count 1287
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3503 place count 1417 transition count 1281
Iterating global reduction 3 with 6 rules applied. Total rules applied 3509 place count 1417 transition count 1281
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 3509 place count 1417 transition count 1276
Deduced a syphon composed of 5 places in 9 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 3519 place count 1412 transition count 1276
Performed 569 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 569 places in 1 ms
Reduce places removed 569 places and 0 transitions.
Iterating global reduction 3 with 1138 rules applied. Total rules applied 4657 place count 843 transition count 637
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 4658 place count 842 transition count 636
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 3 with 142 rules applied. Total rules applied 4800 place count 747 transition count 589
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 4847 place count 700 transition count 589
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4847 place count 700 transition count 541
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4943 place count 652 transition count 541
Applied a total of 4943 rules in 497 ms. Remains 652 /3147 variables (removed 2495) and now considering 541/3062 (removed 2521) transitions.
// Phase 1: matrix 541 rows 652 cols
[2022-05-16 01:36:51] [INFO ] Computed 163 place invariants in 2 ms
[2022-05-16 01:36:51] [INFO ] Implicit Places using invariants in 377 ms returned [257, 331, 369, 443, 481, 485, 489, 493, 497, 501, 505, 509, 513, 517, 521, 525, 529, 533, 537, 541, 545, 549, 553, 557, 561, 565, 569, 573, 577, 579, 581, 583, 585, 587, 589, 591, 593, 595, 597, 599, 601, 605, 609, 613, 617, 621, 625, 629, 634, 638, 642, 646, 651]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 378 ms to find 53 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 599/3147 places, 541/3062 transitions.
Graph (trivial) has 247 edges and 599 vertex of which 13 / 599 are part of one of the 1 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 548 transition count 479
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 548 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 546 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 546 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 544 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 544 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 542 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 542 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 540 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 540 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 538 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 538 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 536 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 536 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 534 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 534 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 532 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 532 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 530 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 530 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 528 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 528 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 526 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 526 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 524 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 524 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 128 place count 523 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 523 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 522 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 522 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 521 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 521 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 520 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 520 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 519 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 519 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 518 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 518 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 517 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 517 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 516 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 516 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 515 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 515 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 514 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 514 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 513 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 513 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 512 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 512 transition count 443
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 153 place count 511 transition count 442
Applied a total of 153 rules in 244 ms. Remains 511 /599 variables (removed 88) and now considering 442/541 (removed 99) transitions.
// Phase 1: matrix 442 rows 511 cols
[2022-05-16 01:36:52] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-16 01:36:52] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 442 rows 511 cols
[2022-05-16 01:36:52] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-16 01:36:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:36:52] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 511/3147 places, 442/3062 transitions.
Finished structural reductions, in 2 iterations. Remains : 511/3147 places, 442/3062 transitions.
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(EQ s190 1), p0:(EQ s5 0)], 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 34 reset in 2 ms.
Treatment of property AutoFlight-PT-48b-LTLFireability-11 finished in 2278 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-16 01:36:52] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13909209403820758583
[2022-05-16 01:36:52] [INFO ] Too many transitions (3062) to apply POR reductions. Disabling POR matrices.
[2022-05-16 01:36:53] [INFO ] Applying decomposition
[2022-05-16 01:36:53] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13909209403820758583
Running compilation step : cd /tmp/ltsmin13909209403820758583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 01:36:53] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8259184192530793534.txt' '-o' '/tmp/graph8259184192530793534.bin' '-w' '/tmp/graph8259184192530793534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8259184192530793534.bin' '-l' '-1' '-v' '-w' '/tmp/graph8259184192530793534.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:36:53] [INFO ] Decomposing Gal with order
[2022-05-16 01:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:36:53] [INFO ] Removed a total of 545 redundant transitions.
[2022-05-16 01:36:53] [INFO ] Flatten gal took : 211 ms
[2022-05-16 01:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 91 ms.
[2022-05-16 01:36:53] [INFO ] Time to serialize gal into /tmp/LTLFireability14901367074015550497.gal : 31 ms
[2022-05-16 01:36:53] [INFO ] Time to serialize properties into /tmp/LTLFireability11299995368397827356.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14901367074015550497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11299995368397827356.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((F(X(X((X(F("(i16.u96.p227==0)")))||("(i20.u358.p1246==1)"))))))
Formula 0 simplified : !FXX("(i20.u358.p1246==1)" | XF"(i16.u96.p227==0)")
Compilation finished in 7340 ms.
Running link step : cd /tmp/ltsmin13909209403820758583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin13909209403820758583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X((X(<>((LTLAPp2==true)))||(LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 1765 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 690291 ms.

BK_STOP 1652665022355

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-48b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-48b, 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 r006-tajo-165245689400508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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