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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 8.0K Apr 30 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 01:41 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.7K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 538K 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-24b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652663412909

Running Version 202205111006
[2022-05-16 01:10:14] [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:10:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:10:14] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2022-05-16 01:10:14] [INFO ] Transformed 2230 places.
[2022-05-16 01:10:14] [INFO ] Transformed 2228 transitions.
[2022-05-16 01:10:14] [INFO ] Found NUPN structural information;
[2022-05-16 01:10:14] [INFO ] Parsed PT model containing 2230 places and 2228 transitions in 324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-24b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 304 places :
Symmetric choice reduction at 0 with 304 rule applications. Total rules 304 place count 1926 transition count 1924
Iterating global reduction 0 with 304 rules applied. Total rules applied 608 place count 1926 transition count 1924
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 654 place count 1926 transition count 1878
Discarding 139 places :
Symmetric choice reduction at 1 with 139 rule applications. Total rules 793 place count 1787 transition count 1739
Iterating global reduction 1 with 139 rules applied. Total rules applied 932 place count 1787 transition count 1739
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 956 place count 1763 transition count 1715
Iterating global reduction 1 with 24 rules applied. Total rules applied 980 place count 1763 transition count 1715
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 1003 place count 1740 transition count 1692
Iterating global reduction 1 with 23 rules applied. Total rules applied 1026 place count 1740 transition count 1692
Applied a total of 1026 rules in 1138 ms. Remains 1740 /2230 variables (removed 490) and now considering 1692/2228 (removed 536) transitions.
// Phase 1: matrix 1692 rows 1740 cols
[2022-05-16 01:10:16] [INFO ] Computed 148 place invariants in 39 ms
[2022-05-16 01:10:16] [INFO ] Implicit Places using invariants in 820 ms returned []
// Phase 1: matrix 1692 rows 1740 cols
[2022-05-16 01:10:16] [INFO ] Computed 148 place invariants in 15 ms
[2022-05-16 01:10:18] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2735 ms to find 0 implicit places.
// Phase 1: matrix 1692 rows 1740 cols
[2022-05-16 01:10:18] [INFO ] Computed 148 place invariants in 33 ms
[2022-05-16 01:10:19] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1740/2230 places, 1692/2228 transitions.
Finished structural reductions, in 1 iterations. Remains : 1740/2230 places, 1692/2228 transitions.
Support contains 30 out of 1740 places after structural reductions.
[2022-05-16 01:10:20] [INFO ] Flatten gal took : 117 ms
[2022-05-16 01:10:20] [INFO ] Flatten gal took : 69 ms
[2022-05-16 01:10:20] [INFO ] Input system was already deterministic with 1692 transitions.
Support contains 29 out of 1740 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1692 rows 1740 cols
[2022-05-16 01:10:21] [INFO ] Computed 148 place invariants in 13 ms
[2022-05-16 01:10:21] [INFO ] [Real]Absence check using 147 positive place invariants in 70 ms returned sat
[2022-05-16 01:10:21] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 01:10:22] [INFO ] After 935ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2022-05-16 01:10:23] [INFO ] Deduced a trap composed of 27 places in 589 ms of which 11 ms to minimize.
[2022-05-16 01:10:23] [INFO ] Deduced a trap composed of 23 places in 532 ms of which 3 ms to minimize.
[2022-05-16 01:10:24] [INFO ] Deduced a trap composed of 49 places in 447 ms of which 2 ms to minimize.
[2022-05-16 01:10:24] [INFO ] Deduced a trap composed of 80 places in 462 ms of which 2 ms to minimize.
[2022-05-16 01:10:25] [INFO ] Deduced a trap composed of 87 places in 439 ms of which 1 ms to minimize.
[2022-05-16 01:10:25] [INFO ] Deduced a trap composed of 179 places in 419 ms of which 1 ms to minimize.
[2022-05-16 01:10:26] [INFO ] Deduced a trap composed of 156 places in 368 ms of which 1 ms to minimize.
[2022-05-16 01:10:26] [INFO ] Deduced a trap composed of 120 places in 493 ms of which 1 ms to minimize.
[2022-05-16 01:10:27] [INFO ] Deduced a trap composed of 153 places in 459 ms of which 1 ms to minimize.
[2022-05-16 01:10:28] [INFO ] Deduced a trap composed of 147 places in 480 ms of which 1 ms to minimize.
[2022-05-16 01:10:28] [INFO ] Deduced a trap composed of 170 places in 485 ms of which 1 ms to minimize.
[2022-05-16 01:10:29] [INFO ] Deduced a trap composed of 130 places in 462 ms of which 1 ms to minimize.
[2022-05-16 01:10:29] [INFO ] Deduced a trap composed of 180 places in 452 ms of which 1 ms to minimize.
[2022-05-16 01:10:30] [INFO ] Deduced a trap composed of 178 places in 445 ms of which 1 ms to minimize.
[2022-05-16 01:10:30] [INFO ] Deduced a trap composed of 189 places in 462 ms of which 1 ms to minimize.
[2022-05-16 01:10:31] [INFO ] Deduced a trap composed of 165 places in 451 ms of which 1 ms to minimize.
[2022-05-16 01:10:32] [INFO ] Deduced a trap composed of 173 places in 449 ms of which 1 ms to minimize.
[2022-05-16 01:10:32] [INFO ] Deduced a trap composed of 163 places in 439 ms of which 1 ms to minimize.
[2022-05-16 01:10:33] [INFO ] Deduced a trap composed of 144 places in 440 ms of which 1 ms to minimize.
[2022-05-16 01:10:33] [INFO ] Deduced a trap composed of 143 places in 420 ms of which 1 ms to minimize.
[2022-05-16 01:10:33] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 11089 ms
[2022-05-16 01:10:34] [INFO ] Deduced a trap composed of 25 places in 525 ms of which 1 ms to minimize.
[2022-05-16 01:10:35] [INFO ] Deduced a trap composed of 198 places in 548 ms of which 2 ms to minimize.
[2022-05-16 01:10:35] [INFO ] Deduced a trap composed of 213 places in 544 ms of which 1 ms to minimize.
[2022-05-16 01:10:36] [INFO ] Deduced a trap composed of 209 places in 518 ms of which 1 ms to minimize.
[2022-05-16 01:10:36] [INFO ] Deduced a trap composed of 83 places in 371 ms of which 1 ms to minimize.
[2022-05-16 01:10:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3101 ms
[2022-05-16 01:10:37] [INFO ] After 15923ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:10:37] [INFO ] After 16478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:10:38] [INFO ] [Nat]Absence check using 147 positive place invariants in 105 ms returned sat
[2022-05-16 01:10:38] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 7 ms returned sat
[2022-05-16 01:10:39] [INFO ] After 954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:10:39] [INFO ] Deduced a trap composed of 27 places in 491 ms of which 1 ms to minimize.
[2022-05-16 01:10:40] [INFO ] Deduced a trap composed of 23 places in 445 ms of which 1 ms to minimize.
[2022-05-16 01:10:40] [INFO ] Deduced a trap composed of 49 places in 498 ms of which 2 ms to minimize.
[2022-05-16 01:10:41] [INFO ] Deduced a trap composed of 80 places in 497 ms of which 1 ms to minimize.
[2022-05-16 01:10:41] [INFO ] Deduced a trap composed of 87 places in 470 ms of which 1 ms to minimize.
[2022-05-16 01:10:42] [INFO ] Deduced a trap composed of 179 places in 455 ms of which 1 ms to minimize.
[2022-05-16 01:10:43] [INFO ] Deduced a trap composed of 156 places in 465 ms of which 1 ms to minimize.
[2022-05-16 01:10:43] [INFO ] Deduced a trap composed of 120 places in 453 ms of which 1 ms to minimize.
[2022-05-16 01:10:44] [INFO ] Deduced a trap composed of 153 places in 514 ms of which 2 ms to minimize.
[2022-05-16 01:10:44] [INFO ] Deduced a trap composed of 147 places in 493 ms of which 1 ms to minimize.
[2022-05-16 01:10:45] [INFO ] Deduced a trap composed of 170 places in 467 ms of which 1 ms to minimize.
[2022-05-16 01:10:45] [INFO ] Deduced a trap composed of 130 places in 444 ms of which 1 ms to minimize.
[2022-05-16 01:10:46] [INFO ] Deduced a trap composed of 180 places in 488 ms of which 1 ms to minimize.
[2022-05-16 01:10:46] [INFO ] Deduced a trap composed of 178 places in 455 ms of which 2 ms to minimize.
[2022-05-16 01:10:47] [INFO ] Deduced a trap composed of 189 places in 459 ms of which 2 ms to minimize.
[2022-05-16 01:10:47] [INFO ] Deduced a trap composed of 165 places in 408 ms of which 1 ms to minimize.
[2022-05-16 01:10:48] [INFO ] Deduced a trap composed of 173 places in 387 ms of which 1 ms to minimize.
[2022-05-16 01:10:48] [INFO ] Deduced a trap composed of 163 places in 458 ms of which 1 ms to minimize.
[2022-05-16 01:10:49] [INFO ] Deduced a trap composed of 144 places in 415 ms of which 1 ms to minimize.
[2022-05-16 01:10:49] [INFO ] Deduced a trap composed of 143 places in 405 ms of which 1 ms to minimize.
[2022-05-16 01:10:49] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 10656 ms
[2022-05-16 01:10:50] [INFO ] Deduced a trap composed of 25 places in 512 ms of which 2 ms to minimize.
[2022-05-16 01:10:51] [INFO ] Deduced a trap composed of 198 places in 519 ms of which 1 ms to minimize.
[2022-05-16 01:10:51] [INFO ] Deduced a trap composed of 213 places in 511 ms of which 1 ms to minimize.
[2022-05-16 01:10:52] [INFO ] Deduced a trap composed of 209 places in 515 ms of which 1 ms to minimize.
[2022-05-16 01:10:53] [INFO ] Deduced a trap composed of 83 places in 395 ms of which 1 ms to minimize.
[2022-05-16 01:10:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3009 ms
[2022-05-16 01:10:53] [INFO ] After 15277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 355 ms.
[2022-05-16 01:10:53] [INFO ] After 16293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 136 ms.
Support contains 1 out of 1740 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Drop transitions removed 634 transitions
Trivial Post-agglo rules discarded 634 transitions
Performed 634 trivial Post agglomeration. Transition count delta: 634
Iterating post reduction 0 with 634 rules applied. Total rules applied 634 place count 1740 transition count 1058
Reduce places removed 634 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 709 rules applied. Total rules applied 1343 place count 1106 transition count 983
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1391 place count 1058 transition count 983
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 1391 place count 1058 transition count 782
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 1793 place count 857 transition count 782
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1797 place count 853 transition count 778
Iterating global reduction 3 with 4 rules applied. Total rules applied 1801 place count 853 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1801 place count 853 transition count 777
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1803 place count 852 transition count 777
Performed 338 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2479 place count 514 transition count 392
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2575 place count 514 transition count 296
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2671 place count 418 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2672 place count 417 transition count 295
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 4 with 319 rules applied. Total rules applied 2991 place count 300 transition count 93
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 5 with 202 rules applied. Total rules applied 3193 place count 98 transition count 93
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3193 place count 98 transition count 61
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3257 place count 66 transition count 61
Applied a total of 3257 rules in 397 ms. Remains 66 /1740 variables (removed 1674) and now considering 61/1692 (removed 1631) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/1740 places, 61/1692 transitions.
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=22 )
Computed a total of 419 stabilizing places and 419 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 1 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1729 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1729 transition count 1681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1729 transition count 1679
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 1725 transition count 1675
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 1725 transition count 1675
Applied a total of 32 rules in 290 ms. Remains 1725 /1740 variables (removed 15) and now considering 1675/1692 (removed 17) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:10:55] [INFO ] Computed 148 place invariants in 8 ms
[2022-05-16 01:10:55] [INFO ] Implicit Places using invariants in 556 ms returned []
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:10:55] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:10:57] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:10:57] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:10:58] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1740 places, 1675/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/1740 places, 1675/1692 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s205 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-00 finished in 3776 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&F(p2)))'
Support contains 2 out of 1740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1739 transition count 1061
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 702 rules applied. Total rules applied 1332 place count 1109 transition count 989
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 47 rules applied. Total rules applied 1379 place count 1063 transition count 988
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1380 place count 1062 transition count 988
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 202 Pre rules applied. Total rules applied 1380 place count 1062 transition count 786
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 1784 place count 860 transition count 786
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1789 place count 855 transition count 781
Iterating global reduction 4 with 5 rules applied. Total rules applied 1794 place count 855 transition count 781
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1794 place count 855 transition count 779
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1798 place count 853 transition count 779
Performed 336 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 4 with 672 rules applied. Total rules applied 2470 place count 517 transition count 396
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2472 place count 516 transition count 396
Applied a total of 2472 rules in 357 ms. Remains 516 /1740 variables (removed 1224) and now considering 396/1692 (removed 1296) transitions.
// Phase 1: matrix 396 rows 516 cols
[2022-05-16 01:10:59] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:10:59] [INFO ] Implicit Places using invariants in 501 ms returned [169, 170, 171, 172, 173, 174, 178, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 214, 215, 216, 217, 218, 219, 220, 221, 222, 296, 370, 376, 382, 388, 394, 400, 406, 412, 418, 424, 430, 436, 442, 448, 454, 460, 466, 472, 478, 484, 490, 496, 502, 508, 515]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 512 ms to find 71 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 445/1740 places, 396/1692 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 445 transition count 353
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 402 transition count 353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 86 place count 402 transition count 352
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 401 transition count 352
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 113 place count 376 transition count 327
Iterating global reduction 2 with 25 rules applied. Total rules applied 138 place count 376 transition count 327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 375 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 375 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 374 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 374 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 373 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 373 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 372 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 372 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 371 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 371 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 370 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 369 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 368 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 367 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 366 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 365 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 364 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 363 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 362 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 361 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 360 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 359 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 358 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 357 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 356 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 355 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 354 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 353 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 352 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 352 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 351 transition count 302
Applied a total of 188 rules in 160 ms. Remains 351 /445 variables (removed 94) and now considering 302/396 (removed 94) transitions.
// Phase 1: matrix 302 rows 351 cols
[2022-05-16 01:10:59] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-16 01:10:59] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 302 rows 351 cols
[2022-05-16 01:10:59] [INFO ] Computed 77 place invariants in 2 ms
[2022-05-16 01:11:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-16 01:11:00] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 351/1740 places, 302/1692 transitions.
Finished structural reductions, in 2 iterations. Remains : 351/1740 places, 302/1692 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s177 0) (EQ s170 1)), p1:(EQ s177 0), p2:(EQ s177 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-01 finished in 1914 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U !X(G(X(p1))))||(X(p0)&&p2))))'
Support contains 3 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1729 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1729 transition count 1681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1729 transition count 1679
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 1726 transition count 1676
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 1726 transition count 1676
Applied a total of 30 rules in 241 ms. Remains 1726 /1740 variables (removed 14) and now considering 1676/1692 (removed 16) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:11:00] [INFO ] Computed 148 place invariants in 14 ms
[2022-05-16 01:11:01] [INFO ] Implicit Places using invariants in 553 ms returned []
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:11:01] [INFO ] Computed 148 place invariants in 15 ms
[2022-05-16 01:11:03] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2244 ms to find 0 implicit places.
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:11:03] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:11:04] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1740 places, 1676/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1726/1740 places, 1676/1692 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 2}]], initial=3, aps=[p2:(EQ s745 1), p1:(EQ s547 1), p0:(EQ s397 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 751 ms.
Product exploration explored 100000 steps with 33333 reset in 665 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) (NOT p0))
Knowledge based reduction with 8 factoid took 250 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-24b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLFireability-02 finished in 5415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(G(p0)) U (X(((X(p1)||p1)&&p0))&&X(p1))))'
Support contains 3 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1729 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1729 transition count 1681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1729 transition count 1679
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 1725 transition count 1675
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 1725 transition count 1675
Applied a total of 32 rules in 297 ms. Remains 1725 /1740 variables (removed 15) and now considering 1675/1692 (removed 17) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:11:06] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:11:06] [INFO ] Implicit Places using invariants in 507 ms returned []
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:11:06] [INFO ] Computed 148 place invariants in 13 ms
[2022-05-16 01:11:08] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:11:08] [INFO ] Computed 148 place invariants in 13 ms
[2022-05-16 01:11:09] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1740 places, 1675/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/1740 places, 1675/1692 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s602 1), p1:(AND (EQ s592 1) (EQ s1309 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 956 ms.
Product exploration explored 100000 steps with 50000 reset in 938 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-24b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLFireability-03 finished in 5662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U F(p1)) U X(p0))))'
Support contains 2 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1729 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1729 transition count 1681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1729 transition count 1680
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 1725 transition count 1676
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 1725 transition count 1676
Applied a total of 31 rules in 371 ms. Remains 1725 /1740 variables (removed 15) and now considering 1676/1692 (removed 16) transitions.
// Phase 1: matrix 1676 rows 1725 cols
[2022-05-16 01:11:12] [INFO ] Computed 148 place invariants in 11 ms
[2022-05-16 01:11:12] [INFO ] Implicit Places using invariants in 590 ms returned []
// Phase 1: matrix 1676 rows 1725 cols
[2022-05-16 01:11:12] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:11:14] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2339 ms to find 0 implicit places.
// Phase 1: matrix 1676 rows 1725 cols
[2022-05-16 01:11:14] [INFO ] Computed 148 place invariants in 5 ms
[2022-05-16 01:11:15] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1740 places, 1676/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/1740 places, 1676/1692 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s200 1), p0:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3086 steps with 2 reset in 14 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-04 finished in 3810 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((!G(p1)&&G(p2)) U X(p1))||G(p1)))'
Support contains 3 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1728 transition count 1680
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1728 transition count 1680
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1728 transition count 1678
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 1725 transition count 1675
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 1725 transition count 1675
Applied a total of 32 rules in 394 ms. Remains 1725 /1740 variables (removed 15) and now considering 1675/1692 (removed 17) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:11:16] [INFO ] Computed 148 place invariants in 11 ms
[2022-05-16 01:11:16] [INFO ] Implicit Places using invariants in 572 ms returned []
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:11:16] [INFO ] Computed 148 place invariants in 9 ms
[2022-05-16 01:11:18] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:11:18] [INFO ] Computed 148 place invariants in 11 ms
[2022-05-16 01:11:19] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1740 places, 1675/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/1740 places, 1675/1692 transitions.
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s742 1), p2:(EQ s517 1), p1:(EQ s472 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 4053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(G(p0)) U X((p1 U p0))))||X(p0)))'
Support contains 2 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1729 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1729 transition count 1681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1729 transition count 1680
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 1725 transition count 1676
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 1725 transition count 1676
Applied a total of 31 rules in 282 ms. Remains 1725 /1740 variables (removed 15) and now considering 1676/1692 (removed 16) transitions.
// Phase 1: matrix 1676 rows 1725 cols
[2022-05-16 01:11:19] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:11:20] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 1676 rows 1725 cols
[2022-05-16 01:11:20] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:11:22] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
// Phase 1: matrix 1676 rows 1725 cols
[2022-05-16 01:11:22] [INFO ] Computed 148 place invariants in 10 ms
[2022-05-16 01:11:23] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1740 places, 1676/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/1740 places, 1676/1692 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s502 1), p1:(EQ s271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-07 finished in 3807 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(p0)))))'
Support contains 4 out of 1740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Drop transitions removed 631 transitions
Trivial Post-agglo rules discarded 631 transitions
Performed 631 trivial Post agglomeration. Transition count delta: 631
Iterating post reduction 0 with 631 rules applied. Total rules applied 631 place count 1740 transition count 1061
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 706 rules applied. Total rules applied 1337 place count 1109 transition count 986
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 1387 place count 1061 transition count 984
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1389 place count 1059 transition count 984
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 1389 place count 1059 transition count 783
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 1791 place count 858 transition count 783
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1796 place count 853 transition count 778
Iterating global reduction 4 with 5 rules applied. Total rules applied 1801 place count 853 transition count 778
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1801 place count 853 transition count 776
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1805 place count 851 transition count 776
Performed 335 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 335 places in 0 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 4 with 670 rules applied. Total rules applied 2475 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2475 rules in 163 ms. Remains 516 /1740 variables (removed 1224) and now considering 394/1692 (removed 1298) transitions.
// Phase 1: matrix 394 rows 516 cols
[2022-05-16 01:11:23] [INFO ] Computed 148 place invariants in 2 ms
[2022-05-16 01:11:23] [INFO ] Implicit Places using invariants in 409 ms returned [172, 173, 174, 175, 176, 177, 178, 179, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 296, 370, 376, 382, 388, 394, 400, 406, 412, 418, 424, 430, 436, 442, 448, 454, 460, 466, 472, 478, 484, 490, 496, 502, 508, 515]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 411 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 443/1740 places, 394/1692 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 443 transition count 348
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 397 transition count 348
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 117 place count 372 transition count 323
Iterating global reduction 2 with 25 rules applied. Total rules applied 142 place count 372 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 371 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 371 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 370 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 369 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 368 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 367 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 366 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 365 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 364 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 363 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 362 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 361 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 360 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 359 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 358 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 357 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 356 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 355 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 354 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 353 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 352 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 352 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 351 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 351 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 350 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 350 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 349 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 349 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 348 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 348 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 347 transition count 298
Applied a total of 192 rules in 198 ms. Remains 347 /443 variables (removed 96) and now considering 298/394 (removed 96) transitions.
// Phase 1: matrix 298 rows 347 cols
[2022-05-16 01:11:24] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-16 01:11:24] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 298 rows 347 cols
[2022-05-16 01:11:24] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-16 01:11:24] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-16 01:11:24] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 347/1740 places, 298/1692 transitions.
Finished structural reductions, in 2 iterations. Remains : 347/1740 places, 298/1692 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (AND (EQ s0 1) (OR (EQ s33 0) (EQ s304 0))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1189 reset in 513 ms.
Product exploration explored 100000 steps with 1199 reset in 575 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Computed a total of 7 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 298/298 transitions.
Applied a total of 0 rules in 12 ms. Remains 347 /347 variables (removed 0) and now considering 298/298 (removed 0) transitions.
// Phase 1: matrix 298 rows 347 cols
[2022-05-16 01:11:26] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-16 01:11:26] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 298 rows 347 cols
[2022-05-16 01:11:26] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-16 01:11:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-16 01:11:27] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2022-05-16 01:11:27] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 298 rows 347 cols
[2022-05-16 01:11:27] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-16 01:11:27] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 298/298 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Computed a total of 7 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1203 reset in 478 ms.
Product exploration explored 100000 steps with 1198 reset in 462 ms.
Built C files in :
/tmp/ltsmin11163655749223807024
[2022-05-16 01:11:28] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2022-05-16 01:11:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:28] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2022-05-16 01:11:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:28] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2022-05-16 01:11:28] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:28] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11163655749223807024
Running compilation step : cd /tmp/ltsmin11163655749223807024;'/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 824 ms.
Running link step : cd /tmp/ltsmin11163655749223807024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin11163655749223807024;'/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/stateBased10654720404726770654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 298/298 transitions.
Applied a total of 0 rules in 14 ms. Remains 347 /347 variables (removed 0) and now considering 298/298 (removed 0) transitions.
// Phase 1: matrix 298 rows 347 cols
[2022-05-16 01:11:44] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-16 01:11:44] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 298 rows 347 cols
[2022-05-16 01:11:44] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-16 01:11:44] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-16 01:11:44] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2022-05-16 01:11:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 298 rows 347 cols
[2022-05-16 01:11:44] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-16 01:11:45] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 298/298 transitions.
Built C files in :
/tmp/ltsmin2582235163927406362
[2022-05-16 01:11:45] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2022-05-16 01:11:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:45] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2022-05-16 01:11:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:45] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2022-05-16 01:11:45] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:45] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2582235163927406362
Running compilation step : cd /tmp/ltsmin2582235163927406362;'/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 730 ms.
Running link step : cd /tmp/ltsmin2582235163927406362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2582235163927406362;'/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/stateBased17423288468919096844.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:12:00] [INFO ] Flatten gal took : 20 ms
[2022-05-16 01:12:00] [INFO ] Flatten gal took : 18 ms
[2022-05-16 01:12:00] [INFO ] Time to serialize gal into /tmp/LTL15726593542535019422.gal : 4 ms
[2022-05-16 01:12:00] [INFO ] Time to serialize properties into /tmp/LTL8666919386523175263.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15726593542535019422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8666919386523175263.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/LTL1572659...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X("((p108==0)||((p0==1)&&((p286==0)||(p1890==0))))"))))))
Formula 0 simplified : !XFGX"((p108==0)||((p0==1)&&((p286==0)||(p1890==0))))"
Detected timeout of ITS tools.
[2022-05-16 01:12:15] [INFO ] Flatten gal took : 33 ms
[2022-05-16 01:12:15] [INFO ] Applying decomposition
[2022-05-16 01:12:15] [INFO ] Flatten gal took : 27 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/graph8431495772110431896.txt' '-o' '/tmp/graph8431495772110431896.bin' '-w' '/tmp/graph8431495772110431896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8431495772110431896.bin' '-l' '-1' '-v' '-w' '/tmp/graph8431495772110431896.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:12:15] [INFO ] Decomposing Gal with order
[2022-05-16 01:12:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:12:15] [INFO ] Removed a total of 5 redundant transitions.
[2022-05-16 01:12:15] [INFO ] Flatten gal took : 75 ms
[2022-05-16 01:12:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-16 01:12:15] [INFO ] Time to serialize gal into /tmp/LTL17670600079491480015.gal : 9 ms
[2022-05-16 01:12:15] [INFO ] Time to serialize properties into /tmp/LTL9385141155020677795.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17670600079491480015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9385141155020677795.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/LTL1767060...246
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X("((i13.i0.u0.p108==0)||((i13.i0.u0.p0==1)&&((i13.i2.u13.p286==0)||(i0.i1.u14.p1890==0))))"))))))
Formula 0 simplified : !XFGX"((i13.i0.u0.p108==0)||((i13.i0.u0.p0==1)&&((i13.i2.u13.p286==0)||(i0.i1.u14.p1890==0))))"
Reverse transition relation is NOT exact ! Due to transitions t229, t224_t368, t280_t368, i0.i1.u126.t147, i13.i0.t230, Intersection with reachable at eac...219
Computing Next relation with stutter on 6.30823e+09 deadlock states
5 unique states visited
4 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.343993,33560,1,0,25382,19733,4363,38488,1167,69202,39815
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLFireability-08 finished in 52863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(!(X(p0) U p1))))))'
Support contains 2 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1729 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1729 transition count 1681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1729 transition count 1679
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 1726 transition count 1676
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 1726 transition count 1676
Applied a total of 30 rules in 387 ms. Remains 1726 /1740 variables (removed 14) and now considering 1676/1692 (removed 16) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:12:16] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:12:17] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:12:17] [INFO ] Computed 148 place invariants in 5 ms
[2022-05-16 01:12:19] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2412 ms to find 0 implicit places.
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:12:19] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:12:20] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1740 places, 1676/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1726/1740 places, 1676/1692 transitions.
Stuttering acceptance computed with spot in 105 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1349 1), p0:(EQ s736 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33307 reset in 948 ms.
Product exploration explored 100000 steps with 33340 reset in 810 ms.
Computed a total of 416 stabilizing places and 416 stable transitions
Computed a total of 416 stabilizing places and 416 stable transitions
Detected a total of 416/1726 stabilizing places and 416/1676 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (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 9 factoid took 437 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 162 ms :[p1, p1, (AND p1 p0), false]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:12:22] [INFO ] Computed 148 place invariants in 5 ms
[2022-05-16 01:12:22] [INFO ] [Real]Absence check using 147 positive place invariants in 91 ms returned sat
[2022-05-16 01:12:22] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 14 ms returned sat
[2022-05-16 01:12:23] [INFO ] After 828ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 01:12:24] [INFO ] Deduced a trap composed of 23 places in 456 ms of which 1 ms to minimize.
[2022-05-16 01:12:24] [INFO ] Deduced a trap composed of 45 places in 415 ms of which 1 ms to minimize.
[2022-05-16 01:12:25] [INFO ] Deduced a trap composed of 47 places in 403 ms of which 1 ms to minimize.
[2022-05-16 01:12:25] [INFO ] Deduced a trap composed of 61 places in 408 ms of which 1 ms to minimize.
[2022-05-16 01:12:26] [INFO ] Deduced a trap composed of 69 places in 450 ms of which 4 ms to minimize.
[2022-05-16 01:12:26] [INFO ] Deduced a trap composed of 105 places in 399 ms of which 1 ms to minimize.
[2022-05-16 01:12:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3153 ms
[2022-05-16 01:12:27] [INFO ] After 4039ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:12:27] [INFO ] After 4386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:12:27] [INFO ] [Nat]Absence check using 147 positive place invariants in 96 ms returned sat
[2022-05-16 01:12:27] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-16 01:12:28] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:12:28] [INFO ] Deduced a trap composed of 23 places in 518 ms of which 1 ms to minimize.
[2022-05-16 01:12:29] [INFO ] Deduced a trap composed of 45 places in 524 ms of which 1 ms to minimize.
[2022-05-16 01:12:29] [INFO ] Deduced a trap composed of 47 places in 488 ms of which 1 ms to minimize.
[2022-05-16 01:12:30] [INFO ] Deduced a trap composed of 61 places in 469 ms of which 1 ms to minimize.
[2022-05-16 01:12:30] [INFO ] Deduced a trap composed of 69 places in 462 ms of which 1 ms to minimize.
[2022-05-16 01:12:31] [INFO ] Deduced a trap composed of 105 places in 398 ms of which 1 ms to minimize.
[2022-05-16 01:12:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3350 ms
[2022-05-16 01:12:31] [INFO ] After 4111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-16 01:12:31] [INFO ] After 4591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 224 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p1), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 465 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 195 ms :[p1, p1, (AND p1 p0), false]
Stuttering acceptance computed with spot in 146 ms :[p1, p1, (AND p1 p0), false]
Support contains 2 out of 1726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1726/1726 places, 1676/1676 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 621 transitions
Trivial Post-agglo rules discarded 621 transitions
Performed 621 trivial Post agglomeration. Transition count delta: 621
Iterating post reduction 0 with 621 rules applied. Total rules applied 621 place count 1725 transition count 1054
Reduce places removed 621 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 693 rules applied. Total rules applied 1314 place count 1104 transition count 982
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1363 place count 1056 transition count 981
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1364 place count 1055 transition count 981
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1364 place count 1055 transition count 781
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1764 place count 855 transition count 781
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 4 with 680 rules applied. Total rules applied 2444 place count 515 transition count 393
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 2445 place count 514 transition count 392
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 4 with 70 rules applied. Total rules applied 2515 place count 467 transition count 369
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2538 place count 444 transition count 369
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2538 place count 444 transition count 345
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2586 place count 420 transition count 345
Applied a total of 2586 rules in 179 ms. Remains 420 /1726 variables (removed 1306) and now considering 345/1676 (removed 1331) transitions.
// Phase 1: matrix 345 rows 420 cols
[2022-05-16 01:12:32] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-16 01:12:32] [INFO ] Implicit Places using invariants in 248 ms returned [171, 245, 325, 329, 333, 337, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 414, 419]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 249 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/1726 places, 345/1676 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 370 transition count 321
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 369 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 368 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 367 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 366 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 365 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 364 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 363 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 362 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 361 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 360 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 359 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 358 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 357 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 356 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 355 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 354 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 353 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 352 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 352 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 351 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 351 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 350 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 350 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 349 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 349 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 348 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 348 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 347 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 347 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 346 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 346 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 344 transition count 295
Applied a total of 100 rules in 163 ms. Remains 344 /394 variables (removed 50) and now considering 295/345 (removed 50) transitions.
// Phase 1: matrix 295 rows 344 cols
[2022-05-16 01:12:33] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-16 01:12:33] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 295 rows 344 cols
[2022-05-16 01:12:33] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-16 01:12:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:12:33] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 344/1726 places, 295/1676 transitions.
Finished structural reductions, in 2 iterations. Remains : 344/1726 places, 295/1676 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/344 stabilizing places and 4/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 348 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[p1, p1, (AND p1 p0), false]
Finished random walk after 8 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p1) p0)), (F p1), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[p1, p1, (AND p1 p0), false]
Stuttering acceptance computed with spot in 127 ms :[p1, p1, (AND p1 p0), false]
Stuttering acceptance computed with spot in 133 ms :[p1, p1, (AND p1 p0), false]
Product exploration explored 100000 steps with 1480 reset in 543 ms.
Product exploration explored 100000 steps with 1470 reset in 485 ms.
Built C files in :
/tmp/ltsmin17508745443767436807
[2022-05-16 01:12:35] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2022-05-16 01:12:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:35] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2022-05-16 01:12:35] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:35] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2022-05-16 01:12:35] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:35] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17508745443767436807
Running compilation step : cd /tmp/ltsmin17508745443767436807;'/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 750 ms.
Running link step : cd /tmp/ltsmin17508745443767436807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17508745443767436807;'/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/stateBased4859626256539456498.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 295/295 transitions.
Applied a total of 0 rules in 7 ms. Remains 344 /344 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 344 cols
[2022-05-16 01:12:50] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-16 01:12:51] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 295 rows 344 cols
[2022-05-16 01:12:51] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-16 01:12:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:12:51] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2022-05-16 01:12:51] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 295 rows 344 cols
[2022-05-16 01:12:51] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-16 01:12:51] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 295/295 transitions.
Built C files in :
/tmp/ltsmin15468712948778202595
[2022-05-16 01:12:51] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2022-05-16 01:12:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:51] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2022-05-16 01:12:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:51] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2022-05-16 01:12:51] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:51] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15468712948778202595
Running compilation step : cd /tmp/ltsmin15468712948778202595;'/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 603 ms.
Running link step : cd /tmp/ltsmin15468712948778202595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin15468712948778202595;'/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/stateBased4376339247963580030.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:13:06] [INFO ] Flatten gal took : 20 ms
[2022-05-16 01:13:06] [INFO ] Flatten gal took : 18 ms
[2022-05-16 01:13:06] [INFO ] Time to serialize gal into /tmp/LTL17505881171908466265.gal : 4 ms
[2022-05-16 01:13:06] [INFO ] Time to serialize properties into /tmp/LTL17444498711058103698.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17505881171908466265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17444498711058103698.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/LTL1750588...268
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F(!((X("(p1138==1)"))U("(p1830==1)"))))))))
Formula 0 simplified : !XXGF!(X"(p1138==1)" U "(p1830==1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t222.t391, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...176
Computing Next relation with stutter on 1.61061e+09 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
753 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,7.57696,207204,1,0,566,1.13041e+06,624,263,9982,604684,636
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-24b-LTLFireability-09 finished in 59377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1729 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1729 transition count 1681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1729 transition count 1679
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 1726 transition count 1676
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 1726 transition count 1676
Applied a total of 30 rules in 424 ms. Remains 1726 /1740 variables (removed 14) and now considering 1676/1692 (removed 16) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:13:16] [INFO ] Computed 148 place invariants in 16 ms
[2022-05-16 01:13:16] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:13:16] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
// Phase 1: matrix 1676 rows 1726 cols
[2022-05-16 01:13:18] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:13:19] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1740 places, 1676/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1726/1740 places, 1676/1692 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s676 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1058 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-11 finished in 3937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F((p0 U G(F(!p0)))) U !p0)))'
Support contains 1 out of 1740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 1739 transition count 1058
Reduce places removed 633 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 708 rules applied. Total rules applied 1341 place count 1106 transition count 983
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1389 place count 1058 transition count 983
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1389 place count 1058 transition count 783
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1789 place count 858 transition count 783
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1793 place count 854 transition count 779
Iterating global reduction 3 with 4 rules applied. Total rules applied 1797 place count 854 transition count 779
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1797 place count 854 transition count 777
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1801 place count 852 transition count 777
Performed 338 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2477 place count 514 transition count 392
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 2478 place count 513 transition count 391
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 68 rules applied. Total rules applied 2546 place count 467 transition count 369
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2568 place count 445 transition count 369
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2568 place count 445 transition count 345
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2616 place count 421 transition count 345
Applied a total of 2616 rules in 190 ms. Remains 421 /1740 variables (removed 1319) and now considering 345/1692 (removed 1347) transitions.
// Phase 1: matrix 345 rows 421 cols
[2022-05-16 01:13:19] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-16 01:13:20] [INFO ] Implicit Places using invariants in 297 ms returned [172, 246, 320, 324, 328, 332, 336, 341, 345, 349, 353, 357, 361, 365, 369, 373, 378, 382, 391, 395, 399, 403, 407, 411, 415, 420]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 298 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 395/1740 places, 345/1692 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 371 transition count 321
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 371 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 370 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 370 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 369 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 369 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 368 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 368 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 367 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 367 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 366 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 366 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 365 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 365 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 364 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 364 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 363 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 363 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 362 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 362 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 361 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 361 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 360 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 360 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 359 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 359 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 358 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 358 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 357 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 357 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 356 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 356 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 355 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 355 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 354 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 354 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 353 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 353 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 352 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 352 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 351 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 351 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 350 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 350 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 349 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 349 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 348 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 348 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 347 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 347 transition count 297
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 98 place count 346 transition count 296
Applied a total of 98 rules in 219 ms. Remains 346 /395 variables (removed 49) and now considering 296/345 (removed 49) transitions.
// Phase 1: matrix 296 rows 346 cols
[2022-05-16 01:13:20] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:13:20] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 296 rows 346 cols
[2022-05-16 01:13:20] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:13:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:13:20] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1740 places, 296/1692 transitions.
Finished structural reductions, in 2 iterations. Remains : 346/1740 places, 296/1692 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1268 reset in 493 ms.
Product exploration explored 100000 steps with 1259 reset in 525 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1749 steps, including 22 resets, run visited all 1 properties in 9 ms. (steps per millisecond=194 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 346 /346 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 346 cols
[2022-05-16 01:13:22] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:13:22] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 296 rows 346 cols
[2022-05-16 01:13:22] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:13:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:13:23] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2022-05-16 01:13:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 296 rows 346 cols
[2022-05-16 01:13:23] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:13:23] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 296/296 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10295 steps, run visited all 1 properties in 54 ms. (steps per millisecond=190 )
Probabilistic random walk after 10295 steps, saw 5341 distinct states, run finished after 56 ms. (steps per millisecond=183 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1255 reset in 431 ms.
Product exploration explored 100000 steps with 1264 reset in 402 ms.
Built C files in :
/tmp/ltsmin207412288501719320
[2022-05-16 01:13:24] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2022-05-16 01:13:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:13:24] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2022-05-16 01:13:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:13:24] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2022-05-16 01:13:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:13:24] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin207412288501719320
Running compilation step : cd /tmp/ltsmin207412288501719320;'/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 612 ms.
Running link step : cd /tmp/ltsmin207412288501719320;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin207412288501719320;'/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/stateBased3823467029734909064.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 296/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 346 /346 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 346 cols
[2022-05-16 01:13:40] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:13:40] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 296 rows 346 cols
[2022-05-16 01:13:40] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:13:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:13:40] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2022-05-16 01:13:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 346 cols
[2022-05-16 01:13:40] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:13:40] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin14580279389152516345
[2022-05-16 01:13:40] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2022-05-16 01:13:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:13:40] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2022-05-16 01:13:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:13:40] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2022-05-16 01:13:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:13:40] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14580279389152516345
Running compilation step : cd /tmp/ltsmin14580279389152516345;'/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 567 ms.
Running link step : cd /tmp/ltsmin14580279389152516345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14580279389152516345;'/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/stateBased14438683910124168205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:13:55] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:13:55] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:13:55] [INFO ] Time to serialize gal into /tmp/LTL13886623194944686205.gal : 2 ms
[2022-05-16 01:13:55] [INFO ] Time to serialize properties into /tmp/LTL9755097710002824395.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13886623194944686205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9755097710002824395.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/LTL1388662...267
Read 1 LTL properties
Checking formula 0 : !((F(!((F(("(p2091!=1)")U(G(F("(p2091==1)")))))U("(p2091==1)")))))
Formula 0 simplified : !F!(F("(p2091!=1)" U GF"(p2091==1)") U "(p2091==1)")
Reverse transition relation is NOT exact ! Due to transitions t224.t367, t278.t367, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 6.30823e+09 deadlock states
Detected timeout of ITS tools.
[2022-05-16 01:14:10] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:14:10] [INFO ] Applying decomposition
[2022-05-16 01:14:10] [INFO ] Flatten gal took : 8 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/graph13877935222374453181.txt' '-o' '/tmp/graph13877935222374453181.bin' '-w' '/tmp/graph13877935222374453181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13877935222374453181.bin' '-l' '-1' '-v' '-w' '/tmp/graph13877935222374453181.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:14:10] [INFO ] Decomposing Gal with order
[2022-05-16 01:14:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:14:11] [INFO ] Removed a total of 6 redundant transitions.
[2022-05-16 01:14:11] [INFO ] Flatten gal took : 62 ms
[2022-05-16 01:14:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-16 01:14:11] [INFO ] Time to serialize gal into /tmp/LTL15945699523468095244.gal : 13 ms
[2022-05-16 01:14:11] [INFO ] Time to serialize properties into /tmp/LTL7049169837958389518.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/LTL15945699523468095244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7049169837958389518.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/LTL1594569...246
Read 1 LTL properties
Checking formula 0 : !((F(!((F(("(i17.i2.u128.p2091!=1)")U(G(F("(i17.i2.u128.p2091==1)")))))U("(i17.i2.u128.p2091==1)")))))
Formula 0 simplified : !F!(F("(i17.i2.u128.p2091!=1)" U GF"(i17.i2.u128.p2091==1)") U "(i17.i2.u128.p2091==1)")
Reverse transition relation is NOT exact ! Due to transitions t224_t367, t278_t367, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 6.30823e+09 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5545632837206501247
[2022-05-16 01:14:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5545632837206501247
Running compilation step : cd /tmp/ltsmin5545632837206501247;'/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 559 ms.
Running link step : cd /tmp/ltsmin5545632837206501247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5545632837206501247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(<>(((LTLAPp0==true) U [](<>(!(LTLAPp0==true))))) U !(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-24b-LTLFireability-12 finished in 81660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X((X(F(X(G(p0))))||F(p1))))))))'
Support contains 2 out of 1740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1739 transition count 1061
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 704 rules applied. Total rules applied 1334 place count 1109 transition count 987
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1383 place count 1061 transition count 986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1384 place count 1060 transition count 986
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 1384 place count 1060 transition count 785
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 1786 place count 859 transition count 785
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1790 place count 855 transition count 781
Iterating global reduction 4 with 4 rules applied. Total rules applied 1794 place count 855 transition count 781
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1794 place count 855 transition count 780
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1796 place count 854 transition count 780
Performed 337 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 4 with 674 rules applied. Total rules applied 2470 place count 517 transition count 396
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 2471 place count 517 transition count 396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2472 place count 516 transition count 395
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 68 rules applied. Total rules applied 2540 place count 470 transition count 373
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2562 place count 448 transition count 373
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2562 place count 448 transition count 349
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2610 place count 424 transition count 349
Applied a total of 2610 rules in 237 ms. Remains 424 /1740 variables (removed 1316) and now considering 349/1692 (removed 1343) transitions.
// Phase 1: matrix 349 rows 424 cols
[2022-05-16 01:14:41] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-16 01:14:41] [INFO ] Implicit Places using invariants in 248 ms returned [174, 248, 322, 326, 330, 334, 338, 343, 347, 351, 355, 359, 363, 367, 371, 375, 380, 384, 388, 392, 402, 406, 410, 414, 418, 423]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 262 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/1740 places, 349/1692 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 374 transition count 325
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 374 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 373 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 373 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 372 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 372 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 371 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 371 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 370 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 369 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 368 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 367 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 366 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 365 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 364 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 363 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 362 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 361 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 360 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 359 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 358 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 357 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 356 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 355 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 354 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 353 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 352 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 352 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 351 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 351 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 350 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 350 transition count 301
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 348 transition count 299
Applied a total of 100 rules in 120 ms. Remains 348 /398 variables (removed 50) and now considering 299/349 (removed 50) transitions.
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:14:41] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:14:41] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:14:42] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:14:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:14:42] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 348/1740 places, 299/1692 transitions.
Finished structural reductions, in 2 iterations. Remains : 348/1740 places, 299/1692 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s336 1), p1:(EQ s116 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1227 reset in 347 ms.
Product exploration explored 100000 steps with 1237 reset in 374 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/348 stabilizing places and 4/299 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 213 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 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 122 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:14:43] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:14:43] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:14:43] [INFO ] [Nat]Absence check using 76 positive place invariants in 10 ms returned sat
[2022-05-16 01:14:43] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:14:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:14:43] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 01:14:43] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-16 01:14:43] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 391 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 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 299/299 transitions.
Applied a total of 0 rules in 5 ms. Remains 348 /348 variables (removed 0) and now considering 299/299 (removed 0) transitions.
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:14:44] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:14:44] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:14:44] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:14:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:14:44] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2022-05-16 01:14:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:14:44] [INFO ] Computed 76 place invariants in 0 ms
[2022-05-16 01:14:44] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 348/348 places, 299/299 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/348 stabilizing places and 4/299 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 243 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 46 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 5411 steps, including 64 resets, run visited all 2 properties in 65 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 227 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 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1231 reset in 327 ms.
Product exploration explored 100000 steps with 1223 reset in 337 ms.
Built C files in :
/tmp/ltsmin10061384307344816902
[2022-05-16 01:14:46] [INFO ] Computing symmetric may disable matrix : 299 transitions.
[2022-05-16 01:14:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:46] [INFO ] Computing symmetric may enable matrix : 299 transitions.
[2022-05-16 01:14:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:46] [INFO ] Computing Do-Not-Accords matrix : 299 transitions.
[2022-05-16 01:14:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:46] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10061384307344816902
Running compilation step : cd /tmp/ltsmin10061384307344816902;'/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 500 ms.
Running link step : cd /tmp/ltsmin10061384307344816902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10061384307344816902;'/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/stateBased3776024556445518301.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 299/299 transitions.
Applied a total of 0 rules in 29 ms. Remains 348 /348 variables (removed 0) and now considering 299/299 (removed 0) transitions.
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:15:01] [INFO ] Computed 76 place invariants in 0 ms
[2022-05-16 01:15:01] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:15:01] [INFO ] Computed 76 place invariants in 0 ms
[2022-05-16 01:15:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:15:02] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2022-05-16 01:15:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 299 rows 348 cols
[2022-05-16 01:15:02] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:15:02] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 348/348 places, 299/299 transitions.
Built C files in :
/tmp/ltsmin1102028602280692509
[2022-05-16 01:15:02] [INFO ] Computing symmetric may disable matrix : 299 transitions.
[2022-05-16 01:15:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:15:02] [INFO ] Computing symmetric may enable matrix : 299 transitions.
[2022-05-16 01:15:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:15:02] [INFO ] Computing Do-Not-Accords matrix : 299 transitions.
[2022-05-16 01:15:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:15:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1102028602280692509
Running compilation step : cd /tmp/ltsmin1102028602280692509;'/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 471 ms.
Running link step : cd /tmp/ltsmin1102028602280692509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin1102028602280692509;'/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/stateBased14206158595368617942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:15:17] [INFO ] Flatten gal took : 19 ms
[2022-05-16 01:15:17] [INFO ] Flatten gal took : 16 ms
[2022-05-16 01:15:17] [INFO ] Time to serialize gal into /tmp/LTL9800122822022722512.gal : 3 ms
[2022-05-16 01:15:17] [INFO ] Time to serialize properties into /tmp/LTL18075841016289646116.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9800122822022722512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18075841016289646116.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/LTL9800122...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G(X((X(F(X(G("(p2140==1)")))))||(F("(p763==0)")))))))))
Formula 0 simplified : !FGXGX(XFXG"(p2140==1)" | F"(p763==0)")
Reverse transition relation is NOT exact ! Due to transitions t1, t28, t227.t371, t281.t371, Intersection with reachable at each step enabled. (destroyed/...192
Computing Next relation with stutter on 6.30823e+09 deadlock states
Detected timeout of ITS tools.
[2022-05-16 01:15:32] [INFO ] Flatten gal took : 20 ms
[2022-05-16 01:15:32] [INFO ] Applying decomposition
[2022-05-16 01:15:32] [INFO ] Flatten gal took : 7 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/graph3608184783269954707.txt' '-o' '/tmp/graph3608184783269954707.bin' '-w' '/tmp/graph3608184783269954707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3608184783269954707.bin' '-l' '-1' '-v' '-w' '/tmp/graph3608184783269954707.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:15:32] [INFO ] Decomposing Gal with order
[2022-05-16 01:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:15:32] [INFO ] Removed a total of 7 redundant transitions.
[2022-05-16 01:15:32] [INFO ] Flatten gal took : 25 ms
[2022-05-16 01:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 01:15:32] [INFO ] Time to serialize gal into /tmp/LTL14218527349841127555.gal : 4 ms
[2022-05-16 01:15:32] [INFO ] Time to serialize properties into /tmp/LTL1376894388221870331.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/LTL14218527349841127555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1376894388221870331.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/LTL1421852...246
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G(X((X(F(X(G("(i18.u127.p2140==1)")))))||(F("(i3.i0.u50.p763==0)")))))))))
Formula 0 simplified : !FGXGX(XFXG"(i18.u127.p2140==1)" | F"(i3.i0.u50.p763==0)")
Reverse transition relation is NOT exact ! Due to transitions t28, t227_t371, t281_t371, i3.i0.t1, Intersection with reachable at each step enabled. (dest...198
Computing Next relation with stutter on 6.30823e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
72 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.78092,45332,1,0,51313,24894,3829,57357,1179,99748,66896
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLFireability-13 finished in 52228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 1740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1740/1740 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1729 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1729 transition count 1681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1729 transition count 1679
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 1725 transition count 1675
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 1725 transition count 1675
Applied a total of 32 rules in 379 ms. Remains 1725 /1740 variables (removed 15) and now considering 1675/1692 (removed 17) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:15:33] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:15:34] [INFO ] Implicit Places using invariants in 621 ms returned []
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:15:34] [INFO ] Computed 148 place invariants in 8 ms
[2022-05-16 01:15:36] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 2247 ms to find 0 implicit places.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:15:36] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:15:37] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1740 places, 1675/1692 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/1740 places, 1675/1692 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1210 1) (EQ s843 0) (EQ s1589 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 188 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-15 finished in 3859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F((p0 U G(F(!p0)))) U !p0)))'
[2022-05-16 01:15:37] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13365485092317512401
[2022-05-16 01:15:37] [INFO ] Too many transitions (1692) to apply POR reductions. Disabling POR matrices.
[2022-05-16 01:15:37] [INFO ] Applying decomposition
[2022-05-16 01:15:37] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13365485092317512401
Running compilation step : cd /tmp/ltsmin13365485092317512401;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 01:15:37] [INFO ] Flatten gal took : 32 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/graph11041419216760396265.txt' '-o' '/tmp/graph11041419216760396265.bin' '-w' '/tmp/graph11041419216760396265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11041419216760396265.bin' '-l' '-1' '-v' '-w' '/tmp/graph11041419216760396265.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:15:37] [INFO ] Decomposing Gal with order
[2022-05-16 01:15:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:15:38] [INFO ] Removed a total of 321 redundant transitions.
[2022-05-16 01:15:38] [INFO ] Flatten gal took : 212 ms
[2022-05-16 01:15:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2022-05-16 01:15:38] [INFO ] Time to serialize gal into /tmp/LTLFireability785781703635042515.gal : 46 ms
[2022-05-16 01:15:38] [INFO ] Time to serialize properties into /tmp/LTLFireability3149347606899722806.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability785781703635042515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3149347606899722806.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 1 LTL properties
Checking formula 0 : !((F(!((F(("(i38.i0.i1.u677.p2091!=1)")U(G(F("(i38.i0.i1.u677.p2091==1)")))))U("(i38.i0.i1.u677.p2091==1)")))))
Formula 0 simplified : !F!(F("(i38.i0.i1.u677.p2091!=1)" U GF"(i38.i0.i1.u677.p2091==1)") U "(i38.i0.i1.u677.p2091==1)")
Compilation finished in 2827 ms.
Running link step : cd /tmp/ltsmin13365485092317512401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13365485092317512401;'/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' '--ltl' '<>(!(<>(((LTLAPp0==true) U [](<>(!(LTLAPp0==true))))) U !(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 01:37:26] [INFO ] Applying decomposition
[2022-05-16 01:37:26] [INFO ] Flatten gal took : 75 ms
[2022-05-16 01:37:26] [INFO ] Decomposing Gal with order
[2022-05-16 01:37:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:37:27] [INFO ] Removed a total of 50 redundant transitions.
[2022-05-16 01:37:27] [INFO ] Flatten gal took : 146 ms
[2022-05-16 01:37:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 694 labels/synchronizations in 2158 ms.
[2022-05-16 01:37:30] [INFO ] Time to serialize gal into /tmp/LTLFireability17130866310817505637.gal : 103 ms
[2022-05-16 01:37:30] [INFO ] Time to serialize properties into /tmp/LTLFireability9541210636899183807.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/LTLFireability17130866310817505637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9541210636899183807.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F(!((F(("(i1.i0.i0.i0.i0.i0.i0.i0.i0.u284.p2091!=1)")U(G(F("(i1.i0.i0.i0.i0.i0.i0.i0.i0.u284.p2091==1)")))))U("(i1.i0.i0.i0.i0.i0.i...183
Formula 0 simplified : !F!(F("(i1.i0.i0.i0.i0.i0.i0.i0.i0.u284.p2091!=1)" U GF"(i1.i0.i0.i0.i0.i0.i0.i0.i0.u284.p2091==1)") U "(i1.i0.i0.i0.i0.i0.i0.i0.i0....171
Detected timeout of ITS tools.
[2022-05-16 01:59:20] [INFO ] Flatten gal took : 1448 ms
[2022-05-16 01:59:22] [INFO ] Input system was already deterministic with 1692 transitions.
[2022-05-16 01:59:22] [INFO ] Transformed 1740 places.
[2022-05-16 01:59:22] [INFO ] Transformed 1692 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 01:59:23] [INFO ] Time to serialize gal into /tmp/LTLFireability15771475143305351246.gal : 18 ms
[2022-05-16 01:59:23] [INFO ] Time to serialize properties into /tmp/LTLFireability15244658194785636021.ltl : 3 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/LTLFireability15771475143305351246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15244658194785636021.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(!((F(("(p2091!=1)")U(G(F("(p2091==1)")))))U("(p2091==1)")))))
Formula 0 simplified : !F!(F("(p2091!=1)" U GF"(p2091==1)") U "(p2091==1)")

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-24b"
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-24b, 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-165245689400492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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