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-165245689400524.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-96b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689400524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.2K Apr 30 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 02:15 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.4K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 1.9M 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-96b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-96b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652665294582

Running Version 202205111006
[2022-05-16 01:41:37] [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:41:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:41:38] [INFO ] Load time of PNML (sax parser for PT used): 503 ms
[2022-05-16 01:41:39] [INFO ] Transformed 7894 places.
[2022-05-16 01:41:39] [INFO ] Transformed 7868 transitions.
[2022-05-16 01:41:39] [INFO ] Found NUPN structural information;
[2022-05-16 01:41:39] [INFO ] Parsed PT model containing 7894 places and 7868 transitions in 1672 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-96b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 7894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Discarding 1004 places :
Symmetric choice reduction at 0 with 1004 rule applications. Total rules 1004 place count 6890 transition count 6864
Iterating global reduction 0 with 1004 rules applied. Total rules applied 2008 place count 6890 transition count 6864
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 142 transitions.
Iterating post reduction 0 with 142 rules applied. Total rules applied 2150 place count 6890 transition count 6722
Discarding 468 places :
Symmetric choice reduction at 1 with 468 rule applications. Total rules 2618 place count 6422 transition count 6254
Iterating global reduction 1 with 468 rules applied. Total rules applied 3086 place count 6422 transition count 6254
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 3157 place count 6351 transition count 6183
Iterating global reduction 1 with 71 rules applied. Total rules applied 3228 place count 6351 transition count 6183
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 3299 place count 6280 transition count 6112
Iterating global reduction 1 with 71 rules applied. Total rules applied 3370 place count 6280 transition count 6112
Applied a total of 3370 rules in 9282 ms. Remains 6280 /7894 variables (removed 1614) and now considering 6112/7868 (removed 1756) transitions.
// Phase 1: matrix 6112 rows 6280 cols
[2022-05-16 01:41:49] [INFO ] Computed 514 place invariants in 181 ms
[2022-05-16 01:41:52] [INFO ] Implicit Places using invariants in 3114 ms returned []
// Phase 1: matrix 6112 rows 6280 cols
[2022-05-16 01:41:53] [INFO ] Computed 514 place invariants in 150 ms
[2022-05-16 01:41:55] [INFO ] Implicit Places using invariants and state equation in 2563 ms returned []
Implicit Place search using SMT with State Equation took 5739 ms to find 0 implicit places.
// Phase 1: matrix 6112 rows 6280 cols
[2022-05-16 01:41:55] [INFO ] Computed 514 place invariants in 58 ms
[2022-05-16 01:42:00] [INFO ] Dead Transitions using invariants and state equation in 5012 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6280/7894 places, 6112/7868 transitions.
Finished structural reductions, in 1 iterations. Remains : 6280/7894 places, 6112/7868 transitions.
Support contains 36 out of 6280 places after structural reductions.
[2022-05-16 01:42:01] [INFO ] Flatten gal took : 425 ms
[2022-05-16 01:42:01] [INFO ] Flatten gal took : 198 ms
[2022-05-16 01:42:01] [INFO ] Input system was already deterministic with 6112 transitions.
Support contains 34 out of 6280 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 884 ms. (steps per millisecond=11 ) properties (out of 35) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 6112 rows 6280 cols
[2022-05-16 01:42:03] [INFO ] Computed 514 place invariants in 98 ms
[2022-05-16 01:42:07] [INFO ] [Real]Absence check using 513 positive place invariants in 1069 ms returned sat
[2022-05-16 01:42:07] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 49 ms returned sat
[2022-05-16 01:42:08] [INFO ] After 4716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-16 01:42:13] [INFO ] [Nat]Absence check using 513 positive place invariants in 1081 ms returned sat
[2022-05-16 01:42:13] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 50 ms returned sat
[2022-05-16 01:42:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 01:42:33] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 6280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Drop transitions removed 2539 transitions
Trivial Post-agglo rules discarded 2539 transitions
Performed 2539 trivial Post agglomeration. Transition count delta: 2539
Iterating post reduction 0 with 2539 rules applied. Total rules applied 2539 place count 6280 transition count 3573
Reduce places removed 2539 places and 0 transitions.
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 1 with 2820 rules applied. Total rules applied 5359 place count 3741 transition count 3292
Reduce places removed 186 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 187 rules applied. Total rules applied 5546 place count 3555 transition count 3291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5547 place count 3554 transition count 3291
Performed 700 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 700 Pre rules applied. Total rules applied 5547 place count 3554 transition count 2591
Deduced a syphon composed of 700 places in 25 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 4 with 1400 rules applied. Total rules applied 6947 place count 2854 transition count 2591
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 6949 place count 2852 transition count 2589
Iterating global reduction 4 with 2 rules applied. Total rules applied 6951 place count 2852 transition count 2589
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 6951 place count 2852 transition count 2587
Deduced a syphon composed of 2 places in 68 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 6955 place count 2850 transition count 2587
Performed 1146 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1146 places in 1 ms
Reduce places removed 1146 places and 0 transitions.
Iterating global reduction 4 with 2292 rules applied. Total rules applied 9247 place count 1704 transition count 1299
Renaming transitions due to excessive name length > 1024 char.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 9253 place count 1701 transition count 1303
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 9255 place count 1701 transition count 1301
Free-agglomeration rule applied 288 times.
Iterating global reduction 4 with 288 rules applied. Total rules applied 9543 place count 1701 transition count 1013
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 4 with 288 rules applied. Total rules applied 9831 place count 1413 transition count 1013
Applied a total of 9831 rules in 2628 ms. Remains 1413 /6280 variables (removed 4867) and now considering 1013/6112 (removed 5099) transitions.
Finished structural reductions, in 1 iterations. Remains : 1413/6280 places, 1013/6112 transitions.
Finished random walk after 6822 steps, including 18 resets, run visited all 21 properties in 398 ms. (steps per millisecond=17 )
FORMULA AutoFlight-PT-96b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1590 stabilizing places and 1590 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(p0))||p1)))'
Support contains 1 out of 6280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2550 transitions
Trivial Post-agglo rules discarded 2550 transitions
Performed 2550 trivial Post agglomeration. Transition count delta: 2550
Iterating post reduction 0 with 2550 rules applied. Total rules applied 2550 place count 6279 transition count 3561
Reduce places removed 2550 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2841 rules applied. Total rules applied 5391 place count 3729 transition count 3270
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5583 place count 3537 transition count 3270
Performed 705 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 705 Pre rules applied. Total rules applied 5583 place count 3537 transition count 2565
Deduced a syphon composed of 705 places in 40 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 3 with 1410 rules applied. Total rules applied 6993 place count 2832 transition count 2565
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 7000 place count 2825 transition count 2558
Iterating global reduction 3 with 7 rules applied. Total rules applied 7007 place count 2825 transition count 2558
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 7007 place count 2825 transition count 2553
Deduced a syphon composed of 5 places in 51 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 7017 place count 2820 transition count 2553
Performed 1139 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1139 places in 1 ms
Reduce places removed 1139 places and 0 transitions.
Iterating global reduction 3 with 2278 rules applied. Total rules applied 9295 place count 1681 transition count 1272
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 9296 place count 1681 transition count 1272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9297 place count 1680 transition count 1271
Reduce places removed 188 places and 0 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 3 with 280 rules applied. Total rules applied 9577 place count 1492 transition count 1179
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 4 with 92 rules applied. Total rules applied 9669 place count 1400 transition count 1179
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 9669 place count 1400 transition count 1083
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 9861 place count 1304 transition count 1083
Applied a total of 9861 rules in 2003 ms. Remains 1304 /6280 variables (removed 4976) and now considering 1083/6112 (removed 5029) transitions.
// Phase 1: matrix 1083 rows 1304 cols
[2022-05-16 01:42:38] [INFO ] Computed 326 place invariants in 6 ms
[2022-05-16 01:42:40] [INFO ] Implicit Places using invariants in 1870 ms returned [514, 588, 662, 700, 738, 812, 886, 924, 962, 966, 970, 974, 978, 982, 986, 991, 995, 999, 1003, 1007, 1011, 1015, 1019, 1023, 1028, 1032, 1037, 1041, 1045, 1049, 1053, 1057, 1061, 1065, 1069, 1073, 1077, 1081, 1085, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1150, 1154, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1176, 1178, 1180, 1182, 1186, 1190, 1194, 1198, 1202, 1206, 1210, 1214, 1218, 1222, 1226, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1248, 1250, 1252, 1254, 1258, 1262, 1266, 1270, 1274, 1278, 1282, 1286, 1290, 1294, 1298, 1303]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1896 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1199/6280 places, 1083/6112 transitions.
Graph (trivial) has 496 edges and 1199 vertex of which 25 / 1199 are part of one of the 1 SCC in 6 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1096 transition count 957
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1096 transition count 957
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1092 transition count 953
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1092 transition count 953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1088 transition count 949
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1088 transition count 949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1084 transition count 945
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1084 transition count 945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1080 transition count 941
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1080 transition count 941
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1076 transition count 937
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1076 transition count 937
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1072 transition count 933
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1072 transition count 933
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1068 transition count 929
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1068 transition count 929
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1064 transition count 925
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1064 transition count 925
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1060 transition count 921
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1060 transition count 921
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1056 transition count 917
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1056 transition count 917
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1052 transition count 913
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1052 transition count 913
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1048 transition count 909
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1048 transition count 909
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1046 transition count 907
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1046 transition count 907
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1044 transition count 905
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1044 transition count 905
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1042 transition count 903
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1042 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1040 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1040 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1038 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1038 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1036 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1036 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1034 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1034 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1032 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1032 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1030 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1030 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1028 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1028 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1026 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1026 transition count 887
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1024 transition count 885
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1024 transition count 885
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 305 place count 1023 transition count 884
Applied a total of 305 rules in 1731 ms. Remains 1023 /1199 variables (removed 176) and now considering 884/1083 (removed 199) transitions.
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:42:42] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-16 01:42:43] [INFO ] Implicit Places using invariants in 848 ms returned []
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:42:43] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-16 01:42:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:42:44] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1023/6280 places, 884/6112 transitions.
Finished structural reductions, in 2 iterations. Remains : 1023/6280 places, 884/6112 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s359 1), p0:(EQ s359 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 33347 reset in 1855 ms.
Product exploration explored 100000 steps with 33212 reset in 2273 ms.
Computed a total of 8 stabilizing places and 4 stable transitions
Computed a total of 8 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 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 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 201296 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201296 steps, saw 85000 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:42:53] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-16 01:42:53] [INFO ] [Real]Absence check using 221 positive place invariants in 28 ms returned sat
[2022-05-16 01:42:53] [INFO ] After 358ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-16 01:42:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:42:53] [INFO ] After 54ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:42:53] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:42:53] [INFO ] [Nat]Absence check using 221 positive place invariants in 36 ms returned sat
[2022-05-16 01:42:54] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 01:42:54] [INFO ] After 87ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 01:42:54] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-16 01:42:54] [INFO ] After 824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1023 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1023/1023 places, 884/884 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1023 transition count 883
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 369 place count 1023 transition count 515
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t643.t1253 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 500 edges and 439 vertex of which 372 / 439 are part of one of the 1 SCC in 1 ms
Free SCC test removed 371 places
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 1 with 52 rules applied. Total rules applied 421 place count 68 transition count 464
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 444 transitions
Reduce isomorphic transitions removed 444 transitions.
Iterating post reduction 2 with 493 rules applied. Total rules applied 914 place count 19 transition count 20
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 918 place count 15 transition count 16
Iterating global reduction 3 with 4 rules applied. Total rules applied 922 place count 15 transition count 16
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 925 place count 12 transition count 13
Iterating global reduction 3 with 3 rules applied. Total rules applied 928 place count 12 transition count 13
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 931 place count 9 transition count 10
Iterating global reduction 3 with 3 rules applied. Total rules applied 934 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 936 place count 8 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 11 edges and 8 vertex of which 6 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 3 with 2 rules applied. Total rules applied 938 place count 6 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 939 place count 6 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 941 place count 6 transition count 5
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 946 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 946 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 948 place count 2 transition count 2
Applied a total of 948 rules in 159 ms. Remains 2 /1023 variables (removed 1021) and now considering 2/884 (removed 882) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1023 places, 2/884 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 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 60 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 1 out of 1023 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1023/1023 places, 884/884 transitions.
Applied a total of 0 rules in 50 ms. Remains 1023 /1023 variables (removed 0) and now considering 884/884 (removed 0) transitions.
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:42:55] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-16 01:42:55] [INFO ] Implicit Places using invariants in 664 ms returned []
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:42:55] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-16 01:42:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:42:57] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2022-05-16 01:42:57] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:42:57] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-16 01:42:58] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1023/1023 places, 884/884 transitions.
Computed a total of 8 stabilizing places and 4 stable transitions
Computed a total of 8 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 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 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 172813 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172813 steps, saw 80853 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:43:02] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-16 01:43:02] [INFO ] [Real]Absence check using 221 positive place invariants in 39 ms returned sat
[2022-05-16 01:43:02] [INFO ] After 378ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-16 01:43:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:43:02] [INFO ] After 93ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:43:02] [INFO ] After 725ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:43:02] [INFO ] [Nat]Absence check using 221 positive place invariants in 37 ms returned sat
[2022-05-16 01:43:03] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 01:43:03] [INFO ] After 58ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 01:43:03] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-16 01:43:03] [INFO ] After 890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 93 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 218 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 87 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33328 reset in 1858 ms.
Product exploration explored 100000 steps with 33360 reset in 2056 ms.
Built C files in :
/tmp/ltsmin4498286536294276086
[2022-05-16 01:43:08] [INFO ] Computing symmetric may disable matrix : 884 transitions.
[2022-05-16 01:43:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:43:08] [INFO ] Computing symmetric may enable matrix : 884 transitions.
[2022-05-16 01:43:08] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:43:08] [INFO ] Computing Do-Not-Accords matrix : 884 transitions.
[2022-05-16 01:43:08] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:43:08] [INFO ] Built C files in 233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4498286536294276086
Running compilation step : cd /tmp/ltsmin4498286536294276086;'/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 2940 ms.
Running link step : cd /tmp/ltsmin4498286536294276086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 117 ms.
Running LTSmin : cd /tmp/ltsmin4498286536294276086;'/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/stateBased16133256465847688834.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1023 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1023/1023 places, 884/884 transitions.
Applied a total of 0 rules in 39 ms. Remains 1023 /1023 variables (removed 0) and now considering 884/884 (removed 0) transitions.
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:43:23] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-16 01:43:23] [INFO ] Implicit Places using invariants in 529 ms returned []
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:43:23] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-16 01:43:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:43:26] [INFO ] Implicit Places using invariants and state equation in 2328 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
[2022-05-16 01:43:26] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 884 rows 1023 cols
[2022-05-16 01:43:26] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-16 01:43:26] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1023/1023 places, 884/884 transitions.
Built C files in :
/tmp/ltsmin511830721432435883
[2022-05-16 01:43:26] [INFO ] Computing symmetric may disable matrix : 884 transitions.
[2022-05-16 01:43:26] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:43:26] [INFO ] Computing symmetric may enable matrix : 884 transitions.
[2022-05-16 01:43:26] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:43:27] [INFO ] Computing Do-Not-Accords matrix : 884 transitions.
[2022-05-16 01:43:27] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:43:27] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin511830721432435883
Running compilation step : cd /tmp/ltsmin511830721432435883;'/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 2477 ms.
Running link step : cd /tmp/ltsmin511830721432435883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin511830721432435883;'/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/stateBased4848324230102472676.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:43:42] [INFO ] Flatten gal took : 28 ms
[2022-05-16 01:43:42] [INFO ] Flatten gal took : 27 ms
[2022-05-16 01:43:42] [INFO ] Time to serialize gal into /tmp/LTL12975178863038493258.gal : 8 ms
[2022-05-16 01:43:42] [INFO ] Time to serialize properties into /tmp/LTL16035178746739281672.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/LTL12975178863038493258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16035178746739281672.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/LTL1297517...268
Read 1 LTL properties
Checking formula 0 : !((G((F(X("(p2405==0)")))||("(p2405==1)"))))
Formula 0 simplified : !G("(p2405==1)" | FX"(p2405==0)")
Detected timeout of ITS tools.
[2022-05-16 01:43:57] [INFO ] Flatten gal took : 53 ms
[2022-05-16 01:43:57] [INFO ] Applying decomposition
[2022-05-16 01:43:57] [INFO ] Flatten gal took : 38 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/graph6553939789717817512.txt' '-o' '/tmp/graph6553939789717817512.bin' '-w' '/tmp/graph6553939789717817512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6553939789717817512.bin' '-l' '-1' '-v' '-w' '/tmp/graph6553939789717817512.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:43:57] [INFO ] Decomposing Gal with order
[2022-05-16 01:43:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:43:57] [INFO ] Removed a total of 15 redundant transitions.
[2022-05-16 01:43:57] [INFO ] Flatten gal took : 238 ms
[2022-05-16 01:43:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 24 ms.
[2022-05-16 01:43:58] [INFO ] Time to serialize gal into /tmp/LTL16063483646690809947.gal : 46 ms
[2022-05-16 01:43:58] [INFO ] Time to serialize properties into /tmp/LTL7950165526984434227.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/LTL16063483646690809947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7950165526984434227.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/LTL1606348...246
Read 1 LTL properties
Checking formula 0 : !((G((F(X("(i19.i0.i0.u155.p2405==0)")))||("(i19.i0.i0.u155.p2405==1)"))))
Formula 0 simplified : !G("(i19.i0.i0.u155.p2405==1)" | FX"(i19.i0.i0.u155.p2405==0)")
Reverse transition relation is NOT exact ! Due to transitions t679_t1253, t731_t1253, t743_t1253, t893_t1253, i19.i0.i0.t1, i22.t74, Intersection with rea...232
Computing Next relation with stutter on 2.14584e+25 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
947 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,9.62708,390808,1,0,254919,782671,11430,516675,3498,2.89726e+06,126204
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-96b-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-96b-LTLFireability-01 finished in 94403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&!(p1 U p2)&&X(X(p3))))'
Support contains 6 out of 6280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 6263 transition count 6095
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 6263 transition count 6095
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 6263 transition count 6093
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 6258 transition count 6088
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 6258 transition count 6088
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 6257 transition count 6087
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 6257 transition count 6087
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 6256 transition count 6086
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 6256 transition count 6086
Applied a total of 50 rules in 4868 ms. Remains 6256 /6280 variables (removed 24) and now considering 6086/6112 (removed 26) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:44:16] [INFO ] Computed 514 place invariants in 104 ms
[2022-05-16 01:44:18] [INFO ] Implicit Places using invariants in 2220 ms returned []
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:44:18] [INFO ] Computed 514 place invariants in 55 ms
[2022-05-16 01:44:20] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 3993 ms to find 0 implicit places.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:44:20] [INFO ] Computed 514 place invariants in 57 ms
[2022-05-16 01:44:24] [INFO ] Dead Transitions using invariants and state equation in 3960 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6280 places, 6086/6112 transitions.
Finished structural reductions, in 1 iterations. Remains : 6256/6280 places, 6086/6112 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p3) (NOT p0) p2), true, p2, (OR (NOT p3) (NOT p0)), (NOT p3), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s1784 1) (EQ s4417 1)), p1:(NEQ s2461 1), p0:(EQ s1948 0), p3:(OR (EQ s2834 0) (EQ s5652 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 59 reset in 1047 ms.
Product exploration explored 100000 steps with 49 reset in 1142 ms.
Computed a total of 1579 stabilizing places and 1579 stable transitions
Computed a total of 1579 stabilizing places and 1579 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0 p3), (X (NOT p2)), (X p0), (X (AND p1 (NOT p2))), (X (X (NOT p2))), true, (X (X p3)), (X (X p0)), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 592 ms. Reduced automaton from 6 states, 10 edges and 4 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[true, p2, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 176022 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176022 steps, saw 175182 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:44:31] [INFO ] Computed 514 place invariants in 71 ms
[2022-05-16 01:44:33] [INFO ] [Real]Absence check using 513 positive place invariants in 737 ms returned sat
[2022-05-16 01:44:33] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 32 ms returned sat
[2022-05-16 01:44:37] [INFO ] After 4307ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 01:44:43] [INFO ] Deduced a trap composed of 65 places in 5193 ms of which 10 ms to minimize.
[2022-05-16 01:44:46] [INFO ] Deduced a trap composed of 129 places in 2929 ms of which 4 ms to minimize.
[2022-05-16 01:44:49] [INFO ] Deduced a trap composed of 115 places in 2997 ms of which 18 ms to minimize.
[2022-05-16 01:44:53] [INFO ] Deduced a trap composed of 205 places in 3804 ms of which 15 ms to minimize.
[2022-05-16 01:44:57] [INFO ] Deduced a trap composed of 1075 places in 3244 ms of which 8 ms to minimize.
[2022-05-16 01:44:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 01:44:57] [INFO ] After 25627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Finished Parikh walk after 1326 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=53 )
Parikh walk visited 2 properties in 27 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0 p3), (X (NOT p2)), (X p0), (X (AND p1 (NOT p2))), (X (X (NOT p2))), true, (X (X p3)), (X (X p0)), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 457 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 103 ms :[true, p2, p2]
Support contains 3 out of 6256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Applied a total of 0 rules in 1103 ms. Remains 6256 /6256 variables (removed 0) and now considering 6086/6086 (removed 0) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:44:59] [INFO ] Computed 514 place invariants in 92 ms
[2022-05-16 01:45:00] [INFO ] Implicit Places using invariants in 1656 ms returned []
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:45:00] [INFO ] Computed 514 place invariants in 40 ms
[2022-05-16 01:45:02] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 3358 ms to find 0 implicit places.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:45:02] [INFO ] Computed 514 place invariants in 31 ms
[2022-05-16 01:45:06] [INFO ] Dead Transitions using invariants and state equation in 3695 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6256/6256 places, 6086/6086 transitions.
Computed a total of 1579 stabilizing places and 1579 stable transitions
Computed a total of 1579 stabilizing places and 1579 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (X (NOT p2))), true, (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[true, p2, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 118503 steps, run timeout after 3005 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118503 steps, saw 117863 distinct states, run finished after 3007 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:45:10] [INFO ] Computed 514 place invariants in 60 ms
[2022-05-16 01:45:12] [INFO ] [Real]Absence check using 513 positive place invariants in 874 ms returned sat
[2022-05-16 01:45:12] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 45 ms returned sat
[2022-05-16 01:45:17] [INFO ] After 4510ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 01:45:20] [INFO ] Deduced a trap composed of 65 places in 3133 ms of which 4 ms to minimize.
[2022-05-16 01:45:24] [INFO ] Deduced a trap composed of 129 places in 3538 ms of which 3 ms to minimize.
[2022-05-16 01:45:28] [INFO ] Deduced a trap composed of 115 places in 3422 ms of which 13 ms to minimize.
[2022-05-16 01:45:31] [INFO ] Deduced a trap composed of 205 places in 2915 ms of which 3 ms to minimize.
[2022-05-16 01:45:35] [INFO ] Deduced a trap composed of 1075 places in 2976 ms of which 4 ms to minimize.
[2022-05-16 01:45:38] [INFO ] Deduced a trap composed of 1074 places in 3007 ms of which 3 ms to minimize.
[2022-05-16 01:45:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 01:45:38] [INFO ] After 27430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Finished Parikh walk after 1306 steps, including 0 resets, run visited all 2 properties in 24 ms. (steps per millisecond=54 )
Parikh walk visited 2 properties in 26 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (X (NOT p2))), true, (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 111 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 88 ms :[true, p2, p2]
Product exploration explored 100000 steps with 26 reset in 822 ms.
Product exploration explored 100000 steps with 26 reset in 1202 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 89 ms :[true, p2, p2]
Support contains 3 out of 6256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6256/6256 places, 6086/6086 transitions.
Performed 2277 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2277 rules applied. Total rules applied 2277 place count 6256 transition count 6086
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 191 rules applied. Total rules applied 2468 place count 6256 transition count 5990
Performed 844 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 844 Pre rules applied. Total rules applied 2468 place count 6256 transition count 5990
Deduced a syphon composed of 3216 places in 83 ms
Iterating global reduction 2 with 844 rules applied. Total rules applied 3312 place count 6256 transition count 5990
Discarding 2101 places :
Symmetric choice reduction at 2 with 2101 rule applications. Total rules 5413 place count 4155 transition count 3889
Deduced a syphon composed of 1116 places in 84 ms
Iterating global reduction 2 with 2101 rules applied. Total rules applied 7514 place count 4155 transition count 3889
Performed 1362 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 2478 places in 2 ms
Iterating global reduction 2 with 1362 rules applied. Total rules applied 8876 place count 4155 transition count 3745
Renaming transitions due to excessive name length > 1024 char.
Discarding 848 places :
Symmetric choice reduction at 2 with 848 rule applications. Total rules 9724 place count 3307 transition count 2897
Deduced a syphon composed of 1630 places in 2 ms
Iterating global reduction 2 with 848 rules applied. Total rules applied 10572 place count 3307 transition count 2897
Deduced a syphon composed of 1630 places in 2 ms
Applied a total of 10572 rules in 9943 ms. Remains 3307 /6256 variables (removed 2949) and now considering 2897/6086 (removed 3189) transitions.
[2022-05-16 01:45:51] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 2897 rows 3307 cols
[2022-05-16 01:45:51] [INFO ] Computed 514 place invariants in 544 ms
[2022-05-16 01:45:53] [INFO ] Dead Transitions using invariants and state equation in 2518 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3307/6256 places, 2897/6086 transitions.
Finished structural reductions, in 1 iterations. Remains : 3307/6256 places, 2897/6086 transitions.
Entered a terminal (fully accepting) state of product in 1162 steps with 4 reset in 23 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-02 finished in 102790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((X(p0)&&p1)))&&G(F(p1)))))'
Support contains 2 out of 6280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 6262 transition count 6094
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 6262 transition count 6094
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 6262 transition count 6092
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 6258 transition count 6088
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 6258 transition count 6088
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 6257 transition count 6087
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 6257 transition count 6087
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 6256 transition count 6086
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 6256 transition count 6086
Applied a total of 50 rules in 4776 ms. Remains 6256 /6280 variables (removed 24) and now considering 6086/6112 (removed 26) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:45:58] [INFO ] Computed 514 place invariants in 58 ms
[2022-05-16 01:46:00] [INFO ] Implicit Places using invariants in 1852 ms returned []
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:46:00] [INFO ] Computed 514 place invariants in 56 ms
[2022-05-16 01:46:02] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 3615 ms to find 0 implicit places.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:46:02] [INFO ] Computed 514 place invariants in 57 ms
[2022-05-16 01:46:06] [INFO ] Dead Transitions using invariants and state equation in 4600 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6280 places, 6086/6112 transitions.
Finished structural reductions, in 1 iterations. Remains : 6256/6280 places, 6086/6112 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(EQ s2262 1), p0:(EQ s4161 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-03 finished in 13363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0)&&(X(X(p1))||p2)))))))'
Support contains 2 out of 6280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 6261 transition count 6093
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 6261 transition count 6093
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 6261 transition count 6091
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 6256 transition count 6086
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 6256 transition count 6086
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 6255 transition count 6085
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 6255 transition count 6085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 6254 transition count 6084
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 6254 transition count 6084
Applied a total of 54 rules in 5213 ms. Remains 6254 /6280 variables (removed 26) and now considering 6084/6112 (removed 28) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2022-05-16 01:46:12] [INFO ] Computed 514 place invariants in 32 ms
[2022-05-16 01:46:13] [INFO ] Implicit Places using invariants in 787 ms returned []
// Phase 1: matrix 6084 rows 6254 cols
[2022-05-16 01:46:13] [INFO ] Computed 514 place invariants in 61 ms
[2022-05-16 01:46:14] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
// Phase 1: matrix 6084 rows 6254 cols
[2022-05-16 01:46:14] [INFO ] Computed 514 place invariants in 39 ms
[2022-05-16 01:46:18] [INFO ] Dead Transitions using invariants and state equation in 4399 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6280 places, 6084/6112 transitions.
Finished structural reductions, in 1 iterations. Remains : 6254/6280 places, 6084/6112 transitions.
Stuttering acceptance computed with spot in 550 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2), acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 4}]], initial=7, aps=[p0:(EQ s6125 0), p1:(EQ s6125 1), p2:(EQ s88 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-04 finished in 11999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(p0))) U p1))'
Support contains 2 out of 6280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2547 transitions
Trivial Post-agglo rules discarded 2547 transitions
Performed 2547 trivial Post agglomeration. Transition count delta: 2547
Iterating post reduction 0 with 2547 rules applied. Total rules applied 2547 place count 6279 transition count 3564
Reduce places removed 2547 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2838 rules applied. Total rules applied 5385 place count 3732 transition count 3273
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5578 place count 3540 transition count 3272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5579 place count 3539 transition count 3272
Performed 705 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 705 Pre rules applied. Total rules applied 5579 place count 3539 transition count 2567
Deduced a syphon composed of 705 places in 52 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 4 with 1410 rules applied. Total rules applied 6989 place count 2834 transition count 2567
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 6996 place count 2827 transition count 2560
Iterating global reduction 4 with 7 rules applied. Total rules applied 7003 place count 2827 transition count 2560
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 7003 place count 2827 transition count 2555
Deduced a syphon composed of 5 places in 60 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 7013 place count 2822 transition count 2555
Performed 1139 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1139 places in 2 ms
Reduce places removed 1139 places and 0 transitions.
Iterating global reduction 4 with 2278 rules applied. Total rules applied 9291 place count 1683 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 9292 place count 1683 transition count 1274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9293 place count 1682 transition count 1273
Reduce places removed 188 places and 0 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 4 with 280 rules applied. Total rules applied 9573 place count 1494 transition count 1181
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 5 with 92 rules applied. Total rules applied 9665 place count 1402 transition count 1181
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9665 place count 1402 transition count 1085
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9857 place count 1306 transition count 1085
Applied a total of 9857 rules in 1849 ms. Remains 1306 /6280 variables (removed 4974) and now considering 1085/6112 (removed 5027) transitions.
// Phase 1: matrix 1085 rows 1306 cols
[2022-05-16 01:46:21] [INFO ] Computed 326 place invariants in 10 ms
[2022-05-16 01:46:21] [INFO ] Implicit Places using invariants in 797 ms returned [514, 590, 664, 702, 740, 814, 888, 926, 964, 968, 972, 976, 980, 984, 988, 993, 997, 1001, 1005, 1009, 1013, 1017, 1021, 1025, 1030, 1034, 1039, 1043, 1047, 1051, 1055, 1059, 1063, 1067, 1071, 1075, 1079, 1083, 1087, 1092, 1096, 1100, 1104, 1108, 1112, 1116, 1120, 1124, 1128, 1132, 1136, 1140, 1144, 1148, 1152, 1156, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1176, 1178, 1180, 1182, 1184, 1188, 1192, 1196, 1200, 1204, 1208, 1212, 1216, 1220, 1224, 1228, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1248, 1250, 1252, 1254, 1256, 1260, 1264, 1268, 1272, 1276, 1280, 1284, 1288, 1292, 1296, 1300, 1305]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 803 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1201/6280 places, 1085/6112 transitions.
Graph (trivial) has 496 edges and 1201 vertex of which 25 / 1201 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1098 transition count 959
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1098 transition count 959
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1094 transition count 955
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1094 transition count 955
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1090 transition count 951
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1090 transition count 951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1086 transition count 947
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1086 transition count 947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1082 transition count 943
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1082 transition count 943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1078 transition count 939
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1078 transition count 939
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1074 transition count 935
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1074 transition count 935
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1070 transition count 931
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1070 transition count 931
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1066 transition count 927
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1066 transition count 927
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1062 transition count 923
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1062 transition count 923
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1058 transition count 919
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1058 transition count 919
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1054 transition count 915
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1054 transition count 915
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1050 transition count 911
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1050 transition count 911
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1048 transition count 909
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1048 transition count 909
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1046 transition count 907
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1046 transition count 907
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1044 transition count 905
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1044 transition count 905
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1042 transition count 903
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1042 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1040 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1040 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1038 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1038 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1036 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1036 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1034 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1034 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1032 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1032 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1030 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1030 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1028 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1028 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1026 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1026 transition count 887
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 305 place count 1025 transition count 886
Applied a total of 305 rules in 677 ms. Remains 1025 /1201 variables (removed 176) and now considering 886/1085 (removed 199) transitions.
// Phase 1: matrix 886 rows 1025 cols
[2022-05-16 01:46:22] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-16 01:46:23] [INFO ] Implicit Places using invariants in 659 ms returned []
// Phase 1: matrix 886 rows 1025 cols
[2022-05-16 01:46:23] [INFO ] Computed 221 place invariants in 10 ms
[2022-05-16 01:46:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:46:24] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1025/6280 places, 886/6112 transitions.
Finished structural reductions, in 2 iterations. Remains : 1025/6280 places, 886/6112 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s93 1), p0:(EQ s538 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-06 finished in 5368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((X(p0)&&p1)||X(p2)))||F(p3)))'
Support contains 4 out of 6280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 6263 transition count 6095
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 6263 transition count 6095
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 6263 transition count 6093
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 6259 transition count 6089
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 6259 transition count 6089
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 6258 transition count 6088
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 6258 transition count 6088
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 6257 transition count 6087
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 6257 transition count 6087
Applied a total of 48 rules in 4857 ms. Remains 6257 /6280 variables (removed 23) and now considering 6087/6112 (removed 25) transitions.
// Phase 1: matrix 6087 rows 6257 cols
[2022-05-16 01:46:29] [INFO ] Computed 514 place invariants in 58 ms
[2022-05-16 01:46:30] [INFO ] Implicit Places using invariants in 750 ms returned []
// Phase 1: matrix 6087 rows 6257 cols
[2022-05-16 01:46:30] [INFO ] Computed 514 place invariants in 38 ms
[2022-05-16 01:46:32] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2562 ms to find 0 implicit places.
// Phase 1: matrix 6087 rows 6257 cols
[2022-05-16 01:46:32] [INFO ] Computed 514 place invariants in 28 ms
[2022-05-16 01:46:35] [INFO ] Dead Transitions using invariants and state equation in 3827 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6257/6280 places, 6087/6112 transitions.
Finished structural reductions, in 1 iterations. Remains : 6257/6280 places, 6087/6112 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p1) (NOT p3) p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p3) p2) (AND p1 (NOT p3) p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1829 1), p3:(EQ s1013 1), p2:(EQ s1811 1), p0:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 31 reset in 1096 ms.
Product exploration explored 100000 steps with 31 reset in 1433 ms.
Computed a total of 1580 stabilizing places and 1580 stable transitions
Computed a total of 1580 stabilizing places and 1580 stable transitions
Detected a total of 1580/6257 stabilizing places and 1580/6087 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (AND (NOT p3) (NOT p2))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p1 (NOT p3) p0)))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND p1 (NOT p3) p2) (AND p1 (NOT p3) p0))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p1) (NOT p3) p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 792 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p3), (NOT p3)]
Finished random walk after 3226 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (AND (NOT p3) (NOT p2))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p1 (NOT p3) p0)))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND p1 (NOT p3) p2) (AND p1 (NOT p3) p0))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p1) (NOT p3) p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 16 factoid took 809 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p3)]
// Phase 1: matrix 6087 rows 6257 cols
[2022-05-16 01:46:41] [INFO ] Computed 514 place invariants in 57 ms
[2022-05-16 01:46:51] [INFO ] [Real]Absence check using 513 positive place invariants in 2695 ms returned sat
[2022-05-16 01:46:51] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 44 ms returned sat
[2022-05-16 01:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:46:56] [INFO ] [Real]Absence check using state equation in 5403 ms returned unknown
Could not prove EG (NOT p3)
Support contains 1 out of 6257 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 : 6257/6257 places, 6087/6087 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2539 transitions
Trivial Post-agglo rules discarded 2539 transitions
Performed 2539 trivial Post agglomeration. Transition count delta: 2539
Iterating post reduction 0 with 2539 rules applied. Total rules applied 2539 place count 6256 transition count 3547
Reduce places removed 2539 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2827 rules applied. Total rules applied 5366 place count 3717 transition count 3259
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5559 place count 3525 transition count 3258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5560 place count 3524 transition count 3258
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5560 place count 3524 transition count 2557
Deduced a syphon composed of 701 places in 38 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6962 place count 2823 transition count 2557
Performed 1142 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1142 places in 2 ms
Reduce places removed 1142 places and 0 transitions.
Iterating global reduction 4 with 2284 rules applied. Total rules applied 9246 place count 1681 transition count 1271
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 9247 place count 1680 transition count 1270
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 76 rules applied. Total rules applied 9323 place count 1629 transition count 1245
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 9348 place count 1604 transition count 1245
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 9348 place count 1604 transition count 1219
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 9400 place count 1578 transition count 1219
Applied a total of 9400 rules in 953 ms. Remains 1578 /6257 variables (removed 4679) and now considering 1219/6087 (removed 4868) transitions.
// Phase 1: matrix 1219 rows 1578 cols
[2022-05-16 01:46:57] [INFO ] Computed 463 place invariants in 9 ms
[2022-05-16 01:46:58] [INFO ] Implicit Places using invariants in 1044 ms returned [651, 725, 799, 837, 875, 949, 1023, 1061, 1099, 1105, 1111, 1117, 1123, 1129, 1135, 1141, 1147, 1153, 1159, 1165, 1171, 1177, 1183, 1189, 1195, 1201, 1207, 1213, 1219, 1225, 1231, 1237, 1243, 1249, 1255, 1261, 1267, 1273, 1279, 1285, 1291, 1297, 1303, 1309, 1315, 1321, 1327, 1333, 1339, 1345, 1351, 1357, 1363, 1369, 1375, 1381, 1387, 1391, 1395, 1399, 1403, 1407, 1411, 1415, 1419, 1423, 1427, 1431, 1435, 1441, 1447, 1453, 1459, 1465, 1471, 1477, 1483, 1489, 1495, 1500, 1504, 1506, 1508, 1510, 1512, 1514, 1516, 1518, 1520, 1522, 1524, 1526, 1528, 1532, 1536, 1540, 1544, 1548, 1552, 1556, 1560, 1564, 1568, 1572, 1577]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1048 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1473/6257 places, 1219/6087 transitions.
Graph (trivial) has 495 edges and 1473 vertex of which 13 / 1473 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 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 92 place count 1370 transition count 1105
Iterating global reduction 0 with 91 rules applied. Total rules applied 183 place count 1370 transition count 1105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 186 place count 1367 transition count 1102
Iterating global reduction 0 with 3 rules applied. Total rules applied 189 place count 1367 transition count 1102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 192 place count 1364 transition count 1099
Iterating global reduction 0 with 3 rules applied. Total rules applied 195 place count 1364 transition count 1099
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 1361 transition count 1096
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 1361 transition count 1096
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 204 place count 1358 transition count 1093
Iterating global reduction 0 with 3 rules applied. Total rules applied 207 place count 1358 transition count 1093
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 210 place count 1355 transition count 1090
Iterating global reduction 0 with 3 rules applied. Total rules applied 213 place count 1355 transition count 1090
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 216 place count 1352 transition count 1087
Iterating global reduction 0 with 3 rules applied. Total rules applied 219 place count 1352 transition count 1087
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 222 place count 1349 transition count 1084
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1349 transition count 1084
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 228 place count 1346 transition count 1081
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1346 transition count 1081
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 234 place count 1343 transition count 1078
Iterating global reduction 0 with 3 rules applied. Total rules applied 237 place count 1343 transition count 1078
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 240 place count 1340 transition count 1075
Iterating global reduction 0 with 3 rules applied. Total rules applied 243 place count 1340 transition count 1075
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 246 place count 1337 transition count 1072
Iterating global reduction 0 with 3 rules applied. Total rules applied 249 place count 1337 transition count 1072
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 252 place count 1334 transition count 1069
Iterating global reduction 0 with 3 rules applied. Total rules applied 255 place count 1334 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1332 transition count 1067
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1332 transition count 1067
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1330 transition count 1065
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1330 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1328 transition count 1063
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1328 transition count 1063
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1326 transition count 1061
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1326 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1324 transition count 1059
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1324 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1322 transition count 1057
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1322 transition count 1057
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1320 transition count 1055
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1320 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1318 transition count 1053
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1318 transition count 1053
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1316 transition count 1051
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1316 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1314 transition count 1049
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1314 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1312 transition count 1047
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1312 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1310 transition count 1045
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1310 transition count 1045
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 305 place count 1309 transition count 1044
Applied a total of 305 rules in 1014 ms. Remains 1309 /1473 variables (removed 164) and now considering 1044/1219 (removed 175) transitions.
// Phase 1: matrix 1044 rows 1309 cols
[2022-05-16 01:46:59] [INFO ] Computed 358 place invariants in 7 ms
[2022-05-16 01:47:00] [INFO ] Implicit Places using invariants in 598 ms returned []
// Phase 1: matrix 1044 rows 1309 cols
[2022-05-16 01:47:00] [INFO ] Computed 358 place invariants in 6 ms
[2022-05-16 01:47:00] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-05-16 01:47:07] [INFO ] Implicit Places using invariants and state equation in 7237 ms returned [510, 512, 514, 516, 518, 520, 522, 524, 526, 528, 530, 532, 534, 536, 538, 540, 542, 544, 546, 548, 550, 552, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 622, 624, 626, 628, 630, 632, 634, 636, 638, 640, 642, 644, 646, 648]
Discarding 70 places :
Implicit Place search using SMT with State Equation took 7853 ms to find 70 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1239/6257 places, 1044/6087 transitions.
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 58 Pre rules applied. Total rules applied 0 place count 1239 transition count 986
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 1181 transition count 986
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 127 place count 1170 transition count 975
Iterating global reduction 0 with 11 rules applied. Total rules applied 138 place count 1170 transition count 975
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 140 place count 1169 transition count 974
Applied a total of 140 rules in 188 ms. Remains 1169 /1239 variables (removed 70) and now considering 974/1044 (removed 70) transitions.
// Phase 1: matrix 974 rows 1169 cols
[2022-05-16 01:47:07] [INFO ] Computed 288 place invariants in 12 ms
[2022-05-16 01:47:08] [INFO ] Implicit Places using invariants in 661 ms returned []
// Phase 1: matrix 974 rows 1169 cols
[2022-05-16 01:47:08] [INFO ] Computed 288 place invariants in 5 ms
[2022-05-16 01:47:09] [INFO ] State equation strengthened by 297 read => feed constraints.
[2022-05-16 01:47:14] [INFO ] Implicit Places using invariants and state equation in 5893 ms returned []
Implicit Place search using SMT with State Equation took 6569 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1169/6257 places, 974/6087 transitions.
Finished structural reductions, in 3 iterations. Remains : 1169/6257 places, 974/6087 transitions.
Computed a total of 75 stabilizing places and 4 stable transitions
Computed a total of 75 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p3)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p3)]
// Phase 1: matrix 974 rows 1169 cols
[2022-05-16 01:47:14] [INFO ] Computed 288 place invariants in 6 ms
[2022-05-16 01:47:16] [INFO ] [Real]Absence check using 288 positive place invariants in 135 ms returned sat
[2022-05-16 01:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:47:20] [INFO ] [Real]Absence check using state equation in 3976 ms returned sat
[2022-05-16 01:47:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:47:20] [INFO ] [Nat]Absence check using 288 positive place invariants in 124 ms returned sat
[2022-05-16 01:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:47:22] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2022-05-16 01:47:22] [INFO ] State equation strengthened by 297 read => feed constraints.
[2022-05-16 01:47:22] [INFO ] [Nat]Added 297 Read/Feed constraints in 47 ms returned sat
[2022-05-16 01:47:22] [INFO ] Computed and/alt/rep : 880/2218/880 causal constraints (skipped 0 transitions) in 65 ms.
[2022-05-16 01:47:28] [INFO ] Added : 277 causal constraints over 56 iterations in 6518 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 67 ms :[(NOT p3)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-07 finished in 64095 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 2 out of 6280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 6263 transition count 6095
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 6263 transition count 6095
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 6263 transition count 6093
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 6259 transition count 6089
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 6259 transition count 6089
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 6258 transition count 6088
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 6258 transition count 6088
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 6257 transition count 6087
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 6257 transition count 6087
Applied a total of 48 rules in 5462 ms. Remains 6257 /6280 variables (removed 23) and now considering 6087/6112 (removed 25) transitions.
// Phase 1: matrix 6087 rows 6257 cols
[2022-05-16 01:47:34] [INFO ] Computed 514 place invariants in 55 ms
[2022-05-16 01:47:35] [INFO ] Implicit Places using invariants in 809 ms returned []
// Phase 1: matrix 6087 rows 6257 cols
[2022-05-16 01:47:35] [INFO ] Computed 514 place invariants in 58 ms
[2022-05-16 01:47:36] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
// Phase 1: matrix 6087 rows 6257 cols
[2022-05-16 01:47:36] [INFO ] Computed 514 place invariants in 28 ms
[2022-05-16 01:47:58] [INFO ] Dead Transitions using invariants and state equation in 21430 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6257/6280 places, 6087/6112 transitions.
Finished structural reductions, in 1 iterations. Remains : 6257/6280 places, 6087/6112 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2287 1), p1:(EQ s3213 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3709 steps with 0 reset in 48 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-09 finished in 29824 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(p0 U G((p1 U p0))))))'
Support contains 2 out of 6280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2551 transitions
Trivial Post-agglo rules discarded 2551 transitions
Performed 2551 trivial Post agglomeration. Transition count delta: 2551
Iterating post reduction 0 with 2551 rules applied. Total rules applied 2551 place count 6279 transition count 3560
Reduce places removed 2551 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2843 rules applied. Total rules applied 5394 place count 3728 transition count 3268
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5586 place count 3536 transition count 3268
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 703 Pre rules applied. Total rules applied 5586 place count 3536 transition count 2565
Deduced a syphon composed of 703 places in 36 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 3 with 1406 rules applied. Total rules applied 6992 place count 2833 transition count 2565
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 7000 place count 2825 transition count 2557
Iterating global reduction 3 with 8 rules applied. Total rules applied 7008 place count 2825 transition count 2557
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 7008 place count 2825 transition count 2551
Deduced a syphon composed of 6 places in 48 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 7020 place count 2819 transition count 2551
Performed 1139 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1139 places in 2 ms
Reduce places removed 1139 places and 0 transitions.
Iterating global reduction 3 with 2278 rules applied. Total rules applied 9298 place count 1680 transition count 1270
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 9299 place count 1679 transition count 1269
Reduce places removed 188 places and 0 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 3 with 280 rules applied. Total rules applied 9579 place count 1491 transition count 1177
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 4 with 92 rules applied. Total rules applied 9671 place count 1399 transition count 1177
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 9671 place count 1399 transition count 1081
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 9863 place count 1303 transition count 1081
Applied a total of 9863 rules in 1486 ms. Remains 1303 /6280 variables (removed 4977) and now considering 1081/6112 (removed 5031) transitions.
// Phase 1: matrix 1081 rows 1303 cols
[2022-05-16 01:48:00] [INFO ] Computed 326 place invariants in 9 ms
[2022-05-16 01:48:01] [INFO ] Implicit Places using invariants in 931 ms returned [512, 586, 660, 698, 736, 810, 884, 922, 960, 964, 968, 972, 976, 980, 984, 989, 993, 997, 1001, 1005, 1009, 1013, 1017, 1021, 1026, 1030, 1035, 1039, 1043, 1047, 1051, 1055, 1059, 1063, 1067, 1071, 1075, 1079, 1083, 1088, 1092, 1096, 1100, 1104, 1108, 1112, 1116, 1120, 1124, 1128, 1132, 1136, 1140, 1144, 1148, 1152, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1176, 1178, 1180, 1184, 1188, 1192, 1196, 1200, 1204, 1208, 1212, 1216, 1220, 1224, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1248, 1250, 1252, 1256, 1261, 1265, 1269, 1273, 1277, 1281, 1285, 1289, 1293, 1297, 1302]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 934 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1198/6280 places, 1081/6112 transitions.
Graph (trivial) has 496 edges and 1198 vertex of which 25 / 1198 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1174 transition count 1033
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1173 transition count 1033
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 81 place count 1095 transition count 955
Iterating global reduction 2 with 78 rules applied. Total rules applied 159 place count 1095 transition count 955
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 163 place count 1091 transition count 951
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 1091 transition count 951
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 1087 transition count 947
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 1087 transition count 947
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 1083 transition count 943
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 1083 transition count 943
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 1079 transition count 939
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 1079 transition count 939
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 1075 transition count 935
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 1075 transition count 935
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 1071 transition count 931
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 1071 transition count 931
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 1067 transition count 927
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 1067 transition count 927
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 219 place count 1063 transition count 923
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 1063 transition count 923
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 227 place count 1059 transition count 919
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 1059 transition count 919
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 235 place count 1055 transition count 915
Iterating global reduction 2 with 4 rules applied. Total rules applied 239 place count 1055 transition count 915
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 243 place count 1051 transition count 911
Iterating global reduction 2 with 4 rules applied. Total rules applied 247 place count 1051 transition count 911
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 251 place count 1047 transition count 907
Iterating global reduction 2 with 4 rules applied. Total rules applied 255 place count 1047 transition count 907
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 257 place count 1045 transition count 905
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 1045 transition count 905
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 1043 transition count 903
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 1043 transition count 903
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 265 place count 1041 transition count 901
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 1041 transition count 901
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 269 place count 1039 transition count 899
Iterating global reduction 2 with 2 rules applied. Total rules applied 271 place count 1039 transition count 899
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 273 place count 1037 transition count 897
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 1037 transition count 897
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 277 place count 1035 transition count 895
Iterating global reduction 2 with 2 rules applied. Total rules applied 279 place count 1035 transition count 895
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 281 place count 1033 transition count 893
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 1033 transition count 893
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 285 place count 1031 transition count 891
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 1031 transition count 891
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 289 place count 1029 transition count 889
Iterating global reduction 2 with 2 rules applied. Total rules applied 291 place count 1029 transition count 889
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 293 place count 1027 transition count 887
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 1027 transition count 887
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 297 place count 1025 transition count 885
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 1025 transition count 885
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 1023 transition count 883
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 1023 transition count 883
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 2 with 2 rules applied. Total rules applied 305 place count 1022 transition count 882
Applied a total of 305 rules in 596 ms. Remains 1022 /1198 variables (removed 176) and now considering 882/1081 (removed 199) transitions.
// Phase 1: matrix 882 rows 1022 cols
[2022-05-16 01:48:01] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-16 01:48:02] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 882 rows 1022 cols
[2022-05-16 01:48:02] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-16 01:48:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:48:03] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1022/6280 places, 882/6112 transitions.
Finished structural reductions, in 2 iterations. Remains : 1022/6280 places, 882/6112 transitions.
Stuttering acceptance computed with spot in 104 ms :[p0, p0]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s505 1), p1:(EQ s998 1)], 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 448 reset in 851 ms.
Product exploration explored 100000 steps with 448 reset in 902 ms.
Computed a total of 6 stabilizing places and 3 stable transitions
Computed a total of 6 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 257 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 234700 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234700 steps, saw 89622 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 882 rows 1022 cols
[2022-05-16 01:48:09] [INFO ] Computed 221 place invariants in 10 ms
[2022-05-16 01:48:09] [INFO ] [Real]Absence check using 221 positive place invariants in 49 ms returned sat
[2022-05-16 01:48:09] [INFO ] After 498ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 01:48:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:48:09] [INFO ] After 79ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:48:09] [INFO ] After 884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:48:10] [INFO ] [Nat]Absence check using 221 positive place invariants in 38 ms returned sat
[2022-05-16 01:48:10] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 01:48:10] [INFO ] After 62ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 01:48:10] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-16 01:48:10] [INFO ] After 909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 130 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[p0, p0]
Stuttering acceptance computed with spot in 114 ms :[p0, p0]
Support contains 2 out of 1022 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1022/1022 places, 882/882 transitions.
Applied a total of 0 rules in 40 ms. Remains 1022 /1022 variables (removed 0) and now considering 882/882 (removed 0) transitions.
// Phase 1: matrix 882 rows 1022 cols
[2022-05-16 01:48:11] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-16 01:48:11] [INFO ] Implicit Places using invariants in 511 ms returned []
// Phase 1: matrix 882 rows 1022 cols
[2022-05-16 01:48:11] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-16 01:48:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:48:13] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
[2022-05-16 01:48:13] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 882 rows 1022 cols
[2022-05-16 01:48:13] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-16 01:48:13] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1022/1022 places, 882/882 transitions.
Computed a total of 6 stabilizing places and 3 stable transitions
Computed a total of 6 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 250856 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250856 steps, saw 91534 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 882 rows 1022 cols
[2022-05-16 01:48:18] [INFO ] Computed 221 place invariants in 10 ms
[2022-05-16 01:48:18] [INFO ] [Real]Absence check using 221 positive place invariants in 29 ms returned sat
[2022-05-16 01:48:18] [INFO ] After 271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 01:48:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:48:18] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:48:18] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:48:18] [INFO ] [Nat]Absence check using 221 positive place invariants in 36 ms returned sat
[2022-05-16 01:48:19] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 01:48:19] [INFO ] After 58ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 01:48:19] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-05-16 01:48:19] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 1581 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[p0, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
Product exploration explored 100000 steps with 448 reset in 1087 ms.
Product exploration explored 100000 steps with 447 reset in 950 ms.
Built C files in :
/tmp/ltsmin15585419024050032135
[2022-05-16 01:48:23] [INFO ] Computing symmetric may disable matrix : 882 transitions.
[2022-05-16 01:48:23] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:48:23] [INFO ] Computing symmetric may enable matrix : 882 transitions.
[2022-05-16 01:48:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:48:23] [INFO ] Computing Do-Not-Accords matrix : 882 transitions.
[2022-05-16 01:48:23] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:48:23] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15585419024050032135
Running compilation step : cd /tmp/ltsmin15585419024050032135;'/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 2829 ms.
Running link step : cd /tmp/ltsmin15585419024050032135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin15585419024050032135;'/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/stateBased5050916342811252451.hoa' '--buchi-type=spotba'
LTSmin run took 7537 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-96b-LTLFireability-10 finished in 35431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 6280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2550 transitions
Trivial Post-agglo rules discarded 2550 transitions
Performed 2550 trivial Post agglomeration. Transition count delta: 2550
Iterating post reduction 0 with 2550 rules applied. Total rules applied 2550 place count 6279 transition count 3561
Reduce places removed 2550 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2841 rules applied. Total rules applied 5391 place count 3729 transition count 3270
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5583 place count 3537 transition count 3270
Performed 705 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 705 Pre rules applied. Total rules applied 5583 place count 3537 transition count 2565
Deduced a syphon composed of 705 places in 27 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 3 with 1410 rules applied. Total rules applied 6993 place count 2832 transition count 2565
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 7001 place count 2824 transition count 2557
Iterating global reduction 3 with 8 rules applied. Total rules applied 7009 place count 2824 transition count 2557
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 7009 place count 2824 transition count 2551
Deduced a syphon composed of 6 places in 25 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 7021 place count 2818 transition count 2551
Performed 1138 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1138 places in 1 ms
Reduce places removed 1138 places and 0 transitions.
Iterating global reduction 3 with 2276 rules applied. Total rules applied 9297 place count 1680 transition count 1271
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 9298 place count 1679 transition count 1270
Reduce places removed 188 places and 0 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 3 with 280 rules applied. Total rules applied 9578 place count 1491 transition count 1178
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 4 with 92 rules applied. Total rules applied 9670 place count 1399 transition count 1178
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 9670 place count 1399 transition count 1082
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 9862 place count 1303 transition count 1082
Applied a total of 9862 rules in 944 ms. Remains 1303 /6280 variables (removed 4977) and now considering 1082/6112 (removed 5030) transitions.
// Phase 1: matrix 1082 rows 1303 cols
[2022-05-16 01:48:35] [INFO ] Computed 326 place invariants in 8 ms
[2022-05-16 01:48:35] [INFO ] Implicit Places using invariants in 895 ms returned [513, 587, 661, 699, 737, 811, 885, 923, 961, 965, 969, 973, 977, 981, 985, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1027, 1031, 1036, 1040, 1044, 1048, 1052, 1056, 1060, 1064, 1068, 1072, 1076, 1080, 1084, 1089, 1093, 1097, 1101, 1105, 1109, 1113, 1117, 1121, 1125, 1129, 1133, 1137, 1141, 1145, 1149, 1153, 1157, 1159, 1161, 1163, 1165, 1167, 1169, 1171, 1173, 1175, 1177, 1179, 1181, 1185, 1189, 1193, 1197, 1201, 1205, 1209, 1213, 1217, 1221, 1225, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1249, 1251, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1285, 1289, 1293, 1297, 1302]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 899 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1198/6280 places, 1082/6112 transitions.
Graph (trivial) has 496 edges and 1198 vertex of which 25 / 1198 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1095 transition count 956
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1095 transition count 956
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 1091 transition count 952
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 1091 transition count 952
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 171 place count 1087 transition count 948
Iterating global reduction 0 with 4 rules applied. Total rules applied 175 place count 1087 transition count 948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 179 place count 1083 transition count 944
Iterating global reduction 0 with 4 rules applied. Total rules applied 183 place count 1083 transition count 944
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 1079 transition count 940
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 1079 transition count 940
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 195 place count 1075 transition count 936
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 1075 transition count 936
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 203 place count 1071 transition count 932
Iterating global reduction 0 with 4 rules applied. Total rules applied 207 place count 1071 transition count 932
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 211 place count 1067 transition count 928
Iterating global reduction 0 with 4 rules applied. Total rules applied 215 place count 1067 transition count 928
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 219 place count 1063 transition count 924
Iterating global reduction 0 with 4 rules applied. Total rules applied 223 place count 1063 transition count 924
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 227 place count 1059 transition count 920
Iterating global reduction 0 with 4 rules applied. Total rules applied 231 place count 1059 transition count 920
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 235 place count 1055 transition count 916
Iterating global reduction 0 with 4 rules applied. Total rules applied 239 place count 1055 transition count 916
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 243 place count 1051 transition count 912
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 1051 transition count 912
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 251 place count 1047 transition count 908
Iterating global reduction 0 with 4 rules applied. Total rules applied 255 place count 1047 transition count 908
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1045 transition count 906
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1045 transition count 906
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1043 transition count 904
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1043 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1041 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1041 transition count 902
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1039 transition count 900
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1039 transition count 900
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1037 transition count 898
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1037 transition count 898
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1035 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1035 transition count 896
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1033 transition count 894
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1033 transition count 894
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1031 transition count 892
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1031 transition count 892
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1029 transition count 890
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1029 transition count 890
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1027 transition count 888
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1027 transition count 888
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 297 place count 1025 transition count 886
Iterating global reduction 0 with 2 rules applied. Total rules applied 299 place count 1025 transition count 886
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 301 place count 1023 transition count 884
Iterating global reduction 0 with 2 rules applied. Total rules applied 303 place count 1023 transition count 884
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 305 place count 1022 transition count 883
Applied a total of 305 rules in 806 ms. Remains 1022 /1198 variables (removed 176) and now considering 883/1082 (removed 199) transitions.
// Phase 1: matrix 883 rows 1022 cols
[2022-05-16 01:48:36] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-16 01:48:37] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 883 rows 1022 cols
[2022-05-16 01:48:37] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-16 01:48:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:48:38] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1022/6280 places, 883/6112 transitions.
Finished structural reductions, in 2 iterations. Remains : 1022/6280 places, 883/6112 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s205 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]]
Stuttering criterion allowed to conclude after 196 steps with 1 reset in 4 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-11 finished in 4357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X((F(!(p0 U p1))&&p2))||p3))))'
Support contains 3 out of 6280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 6263 transition count 6095
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 6263 transition count 6095
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 6263 transition count 6093
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 6258 transition count 6088
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 6258 transition count 6088
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 6257 transition count 6087
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 6257 transition count 6087
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 6256 transition count 6086
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 6256 transition count 6086
Applied a total of 50 rules in 5428 ms. Remains 6256 /6280 variables (removed 24) and now considering 6086/6112 (removed 26) transitions.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:48:43] [INFO ] Computed 514 place invariants in 64 ms
[2022-05-16 01:48:45] [INFO ] Implicit Places using invariants in 1636 ms returned []
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:48:45] [INFO ] Computed 514 place invariants in 38 ms
[2022-05-16 01:48:46] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 3132 ms to find 0 implicit places.
// Phase 1: matrix 6086 rows 6256 cols
[2022-05-16 01:48:47] [INFO ] Computed 514 place invariants in 28 ms
[2022-05-16 01:48:50] [INFO ] Dead Transitions using invariants and state equation in 3512 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6256/6280 places, 6086/6112 transitions.
Finished structural reductions, in 1 iterations. Remains : 6256/6280 places, 6086/6112 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND p1 (NOT p3))]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s5484 1), p2:(EQ s5484 0), p0:(EQ s3322 1), p1:(EQ s1438 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3448 ms.
Product exploration explored 100000 steps with 33333 reset in 2644 ms.
Computed a total of 1579 stabilizing places and 1579 stable transitions
Computed a total of 1579 stabilizing places and 1579 stable transitions
Detected a total of 1579/6256 stabilizing places and 1579/6086 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p0) (NOT p1)), (X (NOT p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1)))))
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-96b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96b-LTLFireability-12 finished in 19004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!G(p0)) U (G(p1)&&p2)))'
Support contains 3 out of 6280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2546 transitions
Trivial Post-agglo rules discarded 2546 transitions
Performed 2546 trivial Post agglomeration. Transition count delta: 2546
Iterating post reduction 0 with 2546 rules applied. Total rules applied 2546 place count 6279 transition count 3565
Reduce places removed 2546 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 1 with 2833 rules applied. Total rules applied 5379 place count 3733 transition count 3278
Reduce places removed 189 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 190 rules applied. Total rules applied 5569 place count 3544 transition count 3277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5570 place count 3543 transition count 3277
Performed 706 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 706 Pre rules applied. Total rules applied 5570 place count 3543 transition count 2571
Deduced a syphon composed of 706 places in 28 ms
Reduce places removed 706 places and 0 transitions.
Iterating global reduction 4 with 1412 rules applied. Total rules applied 6982 place count 2837 transition count 2571
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 6990 place count 2829 transition count 2563
Iterating global reduction 4 with 8 rules applied. Total rules applied 6998 place count 2829 transition count 2563
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 6998 place count 2829 transition count 2557
Deduced a syphon composed of 6 places in 59 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 7010 place count 2823 transition count 2557
Performed 1138 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1138 places in 1 ms
Reduce places removed 1138 places and 0 transitions.
Iterating global reduction 4 with 2276 rules applied. Total rules applied 9286 place count 1685 transition count 1277
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 9288 place count 1684 transition count 1277
Applied a total of 9288 rules in 1284 ms. Remains 1684 /6280 variables (removed 4596) and now considering 1277/6112 (removed 4835) transitions.
// Phase 1: matrix 1277 rows 1684 cols
[2022-05-16 01:48:58] [INFO ] Computed 514 place invariants in 13 ms
[2022-05-16 01:49:12] [INFO ] Implicit Places using invariants in 13386 ms returned [506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 539, 540, 541, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 562, 563, 564, 565, 566, 567, 568, 569, 570, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 780, 854, 892, 930, 1004, 1078, 1116, 1154, 1160, 1166, 1172, 1178, 1184, 1190, 1196, 1202, 1208, 1214, 1220, 1226, 1232, 1238, 1244, 1250, 1256, 1262, 1268, 1274, 1280, 1286, 1292, 1298, 1304, 1310, 1316, 1322, 1328, 1334, 1340, 1346, 1352, 1358, 1364, 1370, 1376, 1382, 1388, 1394, 1400, 1406, 1412, 1418, 1424, 1430, 1436, 1442, 1446, 1450, 1454, 1458, 1462, 1466, 1470, 1474, 1478, 1482, 1486, 1490, 1496, 1502, 1508, 1514, 1520, 1526, 1532, 1538, 1544, 1550, 1556, 1562, 1566, 1570, 1574, 1578, 1582, 1586, 1590, 1594, 1598, 1602, 1606, 1610, 1616, 1622, 1628, 1634, 1640, 1646, 1652, 1658, 1664, 1670, 1676, 1683]
Discarding 291 places :
Implicit Place search using SMT only with invariants took 13407 ms to find 291 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1393/6280 places, 1277/6112 transitions.
Graph (trivial) has 682 edges and 1393 vertex of which 73 / 1393 are part of one of the 1 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 139 place count 1321 transition count 1044
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 277 place count 1183 transition count 1044
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 356 place count 1104 transition count 965
Iterating global reduction 2 with 79 rules applied. Total rules applied 435 place count 1104 transition count 965
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 439 place count 1100 transition count 961
Iterating global reduction 2 with 4 rules applied. Total rules applied 443 place count 1100 transition count 961
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 447 place count 1096 transition count 957
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 1096 transition count 957
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 455 place count 1092 transition count 953
Iterating global reduction 2 with 4 rules applied. Total rules applied 459 place count 1092 transition count 953
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 463 place count 1088 transition count 949
Iterating global reduction 2 with 4 rules applied. Total rules applied 467 place count 1088 transition count 949
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 471 place count 1084 transition count 945
Iterating global reduction 2 with 4 rules applied. Total rules applied 475 place count 1084 transition count 945
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 479 place count 1080 transition count 941
Iterating global reduction 2 with 4 rules applied. Total rules applied 483 place count 1080 transition count 941
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 487 place count 1076 transition count 937
Iterating global reduction 2 with 4 rules applied. Total rules applied 491 place count 1076 transition count 937
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 495 place count 1072 transition count 933
Iterating global reduction 2 with 4 rules applied. Total rules applied 499 place count 1072 transition count 933
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 503 place count 1068 transition count 929
Iterating global reduction 2 with 4 rules applied. Total rules applied 507 place count 1068 transition count 929
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 511 place count 1064 transition count 925
Iterating global reduction 2 with 4 rules applied. Total rules applied 515 place count 1064 transition count 925
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 519 place count 1060 transition count 921
Iterating global reduction 2 with 4 rules applied. Total rules applied 523 place count 1060 transition count 921
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 527 place count 1056 transition count 917
Iterating global reduction 2 with 4 rules applied. Total rules applied 531 place count 1056 transition count 917
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 533 place count 1054 transition count 915
Iterating global reduction 2 with 2 rules applied. Total rules applied 535 place count 1054 transition count 915
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 537 place count 1052 transition count 913
Iterating global reduction 2 with 2 rules applied. Total rules applied 539 place count 1052 transition count 913
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 541 place count 1050 transition count 911
Iterating global reduction 2 with 2 rules applied. Total rules applied 543 place count 1050 transition count 911
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 545 place count 1048 transition count 909
Iterating global reduction 2 with 2 rules applied. Total rules applied 547 place count 1048 transition count 909
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 549 place count 1046 transition count 907
Iterating global reduction 2 with 2 rules applied. Total rules applied 551 place count 1046 transition count 907
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 553 place count 1044 transition count 905
Iterating global reduction 2 with 2 rules applied. Total rules applied 555 place count 1044 transition count 905
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 557 place count 1042 transition count 903
Iterating global reduction 2 with 2 rules applied. Total rules applied 559 place count 1042 transition count 903
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 561 place count 1040 transition count 901
Iterating global reduction 2 with 2 rules applied. Total rules applied 563 place count 1040 transition count 901
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 565 place count 1038 transition count 899
Iterating global reduction 2 with 2 rules applied. Total rules applied 567 place count 1038 transition count 899
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 569 place count 1036 transition count 897
Iterating global reduction 2 with 2 rules applied. Total rules applied 571 place count 1036 transition count 897
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 573 place count 1034 transition count 895
Iterating global reduction 2 with 2 rules applied. Total rules applied 575 place count 1034 transition count 895
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 577 place count 1032 transition count 893
Iterating global reduction 2 with 2 rules applied. Total rules applied 579 place count 1032 transition count 893
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 2 with 2 rules applied. Total rules applied 581 place count 1031 transition count 892
Applied a total of 581 rules in 784 ms. Remains 1031 /1393 variables (removed 362) and now considering 892/1277 (removed 385) transitions.
// Phase 1: matrix 892 rows 1031 cols
[2022-05-16 01:49:12] [INFO ] Computed 223 place invariants in 8 ms
[2022-05-16 01:49:13] [INFO ] Implicit Places using invariants in 516 ms returned []
// Phase 1: matrix 892 rows 1031 cols
[2022-05-16 01:49:13] [INFO ] Computed 223 place invariants in 5 ms
[2022-05-16 01:49:13] [INFO ] State equation strengthened by 222 read => feed constraints.
[2022-05-16 01:49:16] [INFO ] Implicit Places using invariants and state equation in 3527 ms returned []
Implicit Place search using SMT with State Equation took 4054 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1031/6280 places, 892/6112 transitions.
Finished structural reductions, in 2 iterations. Remains : 1031/6280 places, 892/6112 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s514 1), p1:(EQ s518 1), p0:(EQ s292 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-13 finished in 19679 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 6280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6280/6280 places, 6112/6112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2550 transitions
Trivial Post-agglo rules discarded 2550 transitions
Performed 2550 trivial Post agglomeration. Transition count delta: 2550
Iterating post reduction 0 with 2550 rules applied. Total rules applied 2550 place count 6279 transition count 3561
Reduce places removed 2550 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 1 with 2839 rules applied. Total rules applied 5389 place count 3729 transition count 3272
Reduce places removed 190 places and 0 transitions.
Iterating post reduction 2 with 190 rules applied. Total rules applied 5579 place count 3539 transition count 3272
Performed 705 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 705 Pre rules applied. Total rules applied 5579 place count 3539 transition count 2567
Deduced a syphon composed of 705 places in 38 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 3 with 1410 rules applied. Total rules applied 6989 place count 2834 transition count 2567
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 6997 place count 2826 transition count 2559
Iterating global reduction 3 with 8 rules applied. Total rules applied 7005 place count 2826 transition count 2559
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 7005 place count 2826 transition count 2553
Deduced a syphon composed of 6 places in 34 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 7017 place count 2820 transition count 2553
Performed 1138 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1138 places in 1 ms
Reduce places removed 1138 places and 0 transitions.
Iterating global reduction 3 with 2276 rules applied. Total rules applied 9293 place count 1682 transition count 1273
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 9294 place count 1681 transition count 1272
Reduce places removed 186 places and 0 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 3 with 276 rules applied. Total rules applied 9570 place count 1495 transition count 1182
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 9660 place count 1405 transition count 1182
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 9660 place count 1405 transition count 1086
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 9852 place count 1309 transition count 1086
Applied a total of 9852 rules in 1209 ms. Remains 1309 /6280 variables (removed 4971) and now considering 1086/6112 (removed 5026) transitions.
// Phase 1: matrix 1086 rows 1309 cols
[2022-05-16 01:49:18] [INFO ] Computed 328 place invariants in 10 ms
[2022-05-16 01:49:19] [INFO ] Implicit Places using invariants in 889 ms returned [517, 591, 665, 703, 741, 815, 889, 927, 965, 969, 973, 977, 981, 985, 989, 994, 998, 1002, 1007, 1011, 1015, 1019, 1023, 1027, 1032, 1036, 1041, 1045, 1049, 1053, 1057, 1061, 1065, 1069, 1073, 1077, 1081, 1085, 1089, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1150, 1154, 1158, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1176, 1178, 1180, 1182, 1184, 1186, 1190, 1194, 1198, 1202, 1206, 1210, 1214, 1218, 1222, 1226, 1230, 1234, 1237, 1239, 1241, 1243, 1245, 1247, 1249, 1251, 1253, 1255, 1257, 1259, 1263, 1267, 1271, 1275, 1279, 1283, 1287, 1291, 1295, 1299, 1303, 1308]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 897 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1204/6280 places, 1086/6112 transitions.
Graph (trivial) has 496 edges and 1204 vertex of which 24 / 1204 are part of one of the 1 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 81 place count 1101 transition count 961
Iterating global reduction 0 with 80 rules applied. Total rules applied 161 place count 1101 transition count 961
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 165 place count 1097 transition count 957
Iterating global reduction 0 with 4 rules applied. Total rules applied 169 place count 1097 transition count 957
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 173 place count 1093 transition count 953
Iterating global reduction 0 with 4 rules applied. Total rules applied 177 place count 1093 transition count 953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 181 place count 1089 transition count 949
Iterating global reduction 0 with 4 rules applied. Total rules applied 185 place count 1089 transition count 949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 189 place count 1085 transition count 945
Iterating global reduction 0 with 4 rules applied. Total rules applied 193 place count 1085 transition count 945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 197 place count 1081 transition count 941
Iterating global reduction 0 with 4 rules applied. Total rules applied 201 place count 1081 transition count 941
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 205 place count 1077 transition count 937
Iterating global reduction 0 with 4 rules applied. Total rules applied 209 place count 1077 transition count 937
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 213 place count 1073 transition count 933
Iterating global reduction 0 with 4 rules applied. Total rules applied 217 place count 1073 transition count 933
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 221 place count 1069 transition count 929
Iterating global reduction 0 with 4 rules applied. Total rules applied 225 place count 1069 transition count 929
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 229 place count 1065 transition count 925
Iterating global reduction 0 with 4 rules applied. Total rules applied 233 place count 1065 transition count 925
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 237 place count 1061 transition count 921
Iterating global reduction 0 with 4 rules applied. Total rules applied 241 place count 1061 transition count 921
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 245 place count 1057 transition count 917
Iterating global reduction 0 with 4 rules applied. Total rules applied 249 place count 1057 transition count 917
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 253 place count 1053 transition count 913
Iterating global reduction 0 with 4 rules applied. Total rules applied 257 place count 1053 transition count 913
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 259 place count 1051 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 261 place count 1051 transition count 911
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 263 place count 1049 transition count 909
Iterating global reduction 0 with 2 rules applied. Total rules applied 265 place count 1049 transition count 909
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 267 place count 1047 transition count 907
Iterating global reduction 0 with 2 rules applied. Total rules applied 269 place count 1047 transition count 907
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 271 place count 1045 transition count 905
Iterating global reduction 0 with 2 rules applied. Total rules applied 273 place count 1045 transition count 905
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 275 place count 1043 transition count 903
Iterating global reduction 0 with 2 rules applied. Total rules applied 277 place count 1043 transition count 903
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 279 place count 1041 transition count 901
Iterating global reduction 0 with 2 rules applied. Total rules applied 281 place count 1041 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 283 place count 1039 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 285 place count 1039 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 287 place count 1037 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 289 place count 1037 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 291 place count 1035 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 293 place count 1035 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 295 place count 1033 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 297 place count 1033 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 299 place count 1031 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 301 place count 1031 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 303 place count 1029 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1029 transition count 889
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 307 place count 1028 transition count 888
Applied a total of 307 rules in 890 ms. Remains 1028 /1204 variables (removed 176) and now considering 888/1086 (removed 198) transitions.
// Phase 1: matrix 888 rows 1028 cols
[2022-05-16 01:49:20] [INFO ] Computed 223 place invariants in 9 ms
[2022-05-16 01:49:20] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 888 rows 1028 cols
[2022-05-16 01:49:20] [INFO ] Computed 223 place invariants in 6 ms
[2022-05-16 01:49:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:49:21] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1028/6280 places, 888/6112 transitions.
Finished structural reductions, in 2 iterations. Remains : 1028/6280 places, 888/6112 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s516 1), p0:(AND (EQ s507 1) (EQ s898 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2225 steps with 9 reset in 27 ms.
FORMULA AutoFlight-PT-96b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLFireability-15 finished in 4971 ms.
All properties solved by simple procedures.
Total runtime 464133 ms.

BK_STOP 1652665762177

--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-96b"
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-96b, 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-165245689400524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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