Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 134K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678513806235

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 05:50:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:50:09] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-11 05:50:09] [INFO ] Transformed 574 places.
[2023-03-11 05:50:09] [INFO ] Transformed 572 transitions.
[2023-03-11 05:50:09] [INFO ] Found NUPN structural information;
[2023-03-11 05:50:09] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-06b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 501 transition count 499
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 501 transition count 499
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 157 place count 501 transition count 488
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 188 place count 470 transition count 457
Iterating global reduction 1 with 31 rules applied. Total rules applied 219 place count 470 transition count 457
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 224 place count 465 transition count 452
Iterating global reduction 1 with 5 rules applied. Total rules applied 229 place count 465 transition count 452
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 233 place count 461 transition count 448
Iterating global reduction 1 with 4 rules applied. Total rules applied 237 place count 461 transition count 448
Applied a total of 237 rules in 199 ms. Remains 461 /574 variables (removed 113) and now considering 448/572 (removed 124) transitions.
// Phase 1: matrix 448 rows 461 cols
[2023-03-11 05:50:09] [INFO ] Computed 40 place invariants in 22 ms
[2023-03-11 05:50:10] [INFO ] Implicit Places using invariants in 917 ms returned []
[2023-03-11 05:50:10] [INFO ] Invariant cache hit.
[2023-03-11 05:50:11] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2023-03-11 05:50:11] [INFO ] Invariant cache hit.
[2023-03-11 05:50:12] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 461/574 places, 448/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2733 ms. Remains : 461/574 places, 448/572 transitions.
Support contains 35 out of 461 places after structural reductions.
[2023-03-11 05:50:12] [INFO ] Flatten gal took : 59 ms
[2023-03-11 05:50:12] [INFO ] Flatten gal took : 27 ms
[2023-03-11 05:50:12] [INFO ] Input system was already deterministic with 448 transitions.
Support contains 34 out of 461 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 30) seen :20
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :3
Running SMT prover for 4 properties.
[2023-03-11 05:50:13] [INFO ] Invariant cache hit.
[2023-03-11 05:50:13] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-11 05:50:13] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-11 05:50:13] [INFO ] After 265ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2023-03-11 05:50:13] [INFO ] Deduced a trap composed of 84 places in 342 ms of which 31 ms to minimize.
[2023-03-11 05:50:14] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 13 ms to minimize.
[2023-03-11 05:50:14] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 14 ms to minimize.
[2023-03-11 05:50:14] [INFO ] Deduced a trap composed of 88 places in 206 ms of which 1 ms to minimize.
[2023-03-11 05:50:14] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 15 ms to minimize.
[2023-03-11 05:50:15] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 1 ms to minimize.
[2023-03-11 05:50:15] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 1 ms to minimize.
[2023-03-11 05:50:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1744 ms
[2023-03-11 05:50:15] [INFO ] Deduced a trap composed of 86 places in 418 ms of which 3 ms to minimize.
[2023-03-11 05:50:16] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 0 ms to minimize.
[2023-03-11 05:50:16] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 1 ms to minimize.
[2023-03-11 05:50:16] [INFO ] Deduced a trap composed of 83 places in 206 ms of which 1 ms to minimize.
[2023-03-11 05:50:16] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 1 ms to minimize.
[2023-03-11 05:50:16] [INFO ] Deduced a trap composed of 84 places in 290 ms of which 1 ms to minimize.
[2023-03-11 05:50:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1571 ms
[2023-03-11 05:50:17] [INFO ] After 3711ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:50:17] [INFO ] After 3950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:50:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-11 05:50:17] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 05:50:17] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:50:17] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 0 ms to minimize.
[2023-03-11 05:50:17] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-11 05:50:17] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2023-03-11 05:50:18] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 0 ms to minimize.
[2023-03-11 05:50:18] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 0 ms to minimize.
[2023-03-11 05:50:18] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 1 ms to minimize.
[2023-03-11 05:50:18] [INFO ] Deduced a trap composed of 89 places in 222 ms of which 1 ms to minimize.
[2023-03-11 05:50:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1220 ms
[2023-03-11 05:50:18] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 1 ms to minimize.
[2023-03-11 05:50:19] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 1 ms to minimize.
[2023-03-11 05:50:19] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 0 ms to minimize.
[2023-03-11 05:50:19] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 0 ms to minimize.
[2023-03-11 05:50:19] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 1 ms to minimize.
[2023-03-11 05:50:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 816 ms
[2023-03-11 05:50:19] [INFO ] After 2387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-11 05:50:19] [INFO ] After 2677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 56 ms.
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 448/448 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 461 transition count 289
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 179 rules applied. Total rules applied 338 place count 302 transition count 269
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 351 place count 290 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 289 transition count 268
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 352 place count 289 transition count 213
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 462 place count 234 transition count 213
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 469 place count 227 transition count 206
Iterating global reduction 4 with 7 rules applied. Total rules applied 476 place count 227 transition count 206
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 476 place count 227 transition count 202
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 484 place count 223 transition count 202
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 656 place count 137 transition count 105
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 680 place count 137 transition count 81
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 704 place count 113 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 705 place count 112 transition count 80
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 5 with 75 rules applied. Total rules applied 780 place count 83 transition count 34
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 47 rules applied. Total rules applied 827 place count 37 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 828 place count 36 transition count 33
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 828 place count 36 transition count 24
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 846 place count 27 transition count 24
Applied a total of 846 rules in 125 ms. Remains 27 /461 variables (removed 434) and now considering 24/448 (removed 424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 27/461 places, 24/448 transitions.
Finished random walk after 48 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=48 )
FORMULA AutoFlight-PT-06b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 117 stabilizing places and 117 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 460 transition count 286
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 181 rules applied. Total rules applied 342 place count 299 transition count 266
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 354 place count 287 transition count 266
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 354 place count 287 transition count 212
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 462 place count 233 transition count 212
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 470 place count 225 transition count 204
Iterating global reduction 3 with 8 rules applied. Total rules applied 478 place count 225 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 478 place count 225 transition count 200
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 486 place count 221 transition count 200
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 658 place count 135 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 659 place count 134 transition count 102
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 18 rules applied. Total rules applied 677 place count 122 transition count 96
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 683 place count 116 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 683 place count 116 transition count 90
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 695 place count 110 transition count 90
Applied a total of 695 rules in 60 ms. Remains 110 /461 variables (removed 351) and now considering 90/448 (removed 358) transitions.
// Phase 1: matrix 90 rows 110 cols
[2023-03-11 05:50:20] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-11 05:50:20] [INFO ] Implicit Places using invariants in 348 ms returned [43, 63, 83, 87, 91, 96, 100, 104, 109]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 354 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/461 places, 90/448 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 89
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 94 transition count 83
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 94 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 93 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 93 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 92 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 92 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 91 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 91 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 90 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 90 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 89 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 89 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 88 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 88 transition count 77
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 28 place count 87 transition count 76
Applied a total of 28 rules in 15 ms. Remains 87 /101 variables (removed 14) and now considering 76/90 (removed 14) transitions.
// Phase 1: matrix 76 rows 87 cols
[2023-03-11 05:50:20] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-11 05:50:21] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 05:50:21] [INFO ] Invariant cache hit.
[2023-03-11 05:50:21] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/461 places, 76/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 604 ms. Remains : 87/461 places, 76/448 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s61 1)), p1:(NEQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-00 finished in 1017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(p1))||X(F(((p2&&X(!p3))||G(!p3)))))))'
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 452 transition count 439
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 452 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 452 transition count 438
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 448 transition count 434
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 448 transition count 434
Applied a total of 27 rules in 30 ms. Remains 448 /461 variables (removed 13) and now considering 434/448 (removed 14) transitions.
// Phase 1: matrix 434 rows 448 cols
[2023-03-11 05:50:21] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-11 05:50:21] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-11 05:50:21] [INFO ] Invariant cache hit.
[2023-03-11 05:50:22] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-11 05:50:22] [INFO ] Invariant cache hit.
[2023-03-11 05:50:22] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/461 places, 434/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 915 ms. Remains : 448/461 places, 434/448 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (AND (NOT p1) p3), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (AND (NOT p1) p3)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 p2), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 p3 p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p3 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p3 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p3 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s90 0) (EQ s338 0)), p3:(AND (EQ s90 1) (EQ s338 1)), p2:(NEQ s305 1), p1:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 488 ms.
Product exploration explored 100000 steps with 33333 reset in 391 ms.
Computed a total of 109 stabilizing places and 109 stable transitions
Computed a total of 109 stabilizing places and 109 stable transitions
Detected a total of 109/448 stabilizing places and 109/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (AND p0 (NOT p3) p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 p3 p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (AND (NOT p0) p3 p2 (NOT p1)))), (X (NOT (AND p0 p3 p2 (NOT p1)))), (X (NOT (AND p0 p3 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (AND p0 (NOT p3) p2 (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p0) p3 p2 (NOT p1))))), (X (X (NOT (AND p0 p3 p2 (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (AND p0 (NOT p3) p2 (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p3) p2 (NOT p1))
Knowledge based reduction with 34 factoid took 1614 ms. Reduced automaton from 5 states, 26 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-06b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06b-LTLFireability-02 finished in 3771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 451 transition count 438
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 451 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 451 transition count 437
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 446 transition count 432
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 446 transition count 432
Applied a total of 31 rules in 80 ms. Remains 446 /461 variables (removed 15) and now considering 432/448 (removed 16) transitions.
// Phase 1: matrix 432 rows 446 cols
[2023-03-11 05:50:25] [INFO ] Computed 40 place invariants in 4 ms
[2023-03-11 05:50:25] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-11 05:50:25] [INFO ] Invariant cache hit.
[2023-03-11 05:50:26] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-11 05:50:26] [INFO ] Invariant cache hit.
[2023-03-11 05:50:26] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/461 places, 432/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 446/461 places, 432/448 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s439 1), p1:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3180 reset in 171 ms.
Product exploration explored 100000 steps with 3167 reset in 274 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/446 stabilizing places and 108/432 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 348 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 444 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-11 05:50:28] [INFO ] Invariant cache hit.
[2023-03-11 05:50:28] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-11 05:50:28] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-11 05:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:50:28] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2023-03-11 05:50:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:50:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 31 ms returned sat
[2023-03-11 05:50:28] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:50:29] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2023-03-11 05:50:29] [INFO ] Computed and/alt/rep : 431/615/431 causal constraints (skipped 0 transitions) in 57 ms.
[2023-03-11 05:50:34] [INFO ] Added : 408 causal constraints over 82 iterations in 4938 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 432/432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 445 transition count 278
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 171 rules applied. Total rules applied 324 place count 292 transition count 260
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 337 place count 280 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 279 transition count 259
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 338 place count 279 transition count 204
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 448 place count 224 transition count 204
Performed 87 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 622 place count 137 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 623 place count 136 transition count 104
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 18 rules applied. Total rules applied 641 place count 124 transition count 98
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 647 place count 118 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 647 place count 118 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 659 place count 112 transition count 92
Applied a total of 659 rules in 54 ms. Remains 112 /446 variables (removed 334) and now considering 92/432 (removed 340) transitions.
// Phase 1: matrix 92 rows 112 cols
[2023-03-11 05:50:34] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-11 05:50:34] [INFO ] Implicit Places using invariants in 128 ms returned [44, 64, 84, 88, 92, 96, 100, 111]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 142 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/446 places, 92/432 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 97 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 93 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 92 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 92 transition count 80
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 28 place count 90 transition count 78
Applied a total of 28 rules in 12 ms. Remains 90 /104 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 90 cols
[2023-03-11 05:50:34] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-11 05:50:34] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 05:50:34] [INFO ] Invariant cache hit.
[2023-03-11 05:50:34] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/446 places, 78/432 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 392 ms. Remains : 90/446 places, 78/432 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/90 stabilizing places and 2/78 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 282 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-11 05:50:35] [INFO ] Invariant cache hit.
[2023-03-11 05:50:35] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-11 05:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:50:35] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-11 05:50:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:50:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-11 05:50:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:50:35] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-11 05:50:35] [INFO ] Computed and/alt/rep : 46/73/46 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 05:50:35] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7229 reset in 193 ms.
Stack based approach found an accepted trace after 9957 steps with 722 reset with depth 7 and stack size 7 in 19 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-04 finished in 10847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U G(!p1))))'
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 453 transition count 440
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 453 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 453 transition count 439
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 450 transition count 436
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 450 transition count 436
Applied a total of 23 rules in 69 ms. Remains 450 /461 variables (removed 11) and now considering 436/448 (removed 12) transitions.
// Phase 1: matrix 436 rows 450 cols
[2023-03-11 05:50:36] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-11 05:50:36] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-11 05:50:36] [INFO ] Invariant cache hit.
[2023-03-11 05:50:36] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-11 05:50:36] [INFO ] Invariant cache hit.
[2023-03-11 05:50:36] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 450/461 places, 436/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 450/461 places, 436/448 transitions.
Stuttering acceptance computed with spot in 139 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s40 1) (EQ s104 1)), p0:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 24587 steps with 92 reset in 97 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-06 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 460 transition count 287
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 180 rules applied. Total rules applied 340 place count 300 transition count 267
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 352 place count 288 transition count 267
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 352 place count 288 transition count 213
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 460 place count 234 transition count 213
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 468 place count 226 transition count 205
Iterating global reduction 3 with 8 rules applied. Total rules applied 476 place count 226 transition count 205
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 476 place count 226 transition count 201
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 484 place count 222 transition count 201
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 652 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 653 place count 137 transition count 105
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 18 rules applied. Total rules applied 671 place count 125 transition count 99
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 677 place count 119 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 677 place count 119 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 689 place count 113 transition count 93
Applied a total of 689 rules in 56 ms. Remains 113 /461 variables (removed 348) and now considering 93/448 (removed 355) transitions.
// Phase 1: matrix 93 rows 113 cols
[2023-03-11 05:50:37] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-11 05:50:37] [INFO ] Implicit Places using invariants in 210 ms returned [45, 65, 85, 94, 98, 102, 106, 112]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 211 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/461 places, 93/448 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 93 transition count 81
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 28 place count 91 transition count 79
Applied a total of 28 rules in 11 ms. Remains 91 /105 variables (removed 14) and now considering 79/93 (removed 14) transitions.
// Phase 1: matrix 79 rows 91 cols
[2023-03-11 05:50:37] [INFO ] Computed 20 place invariants in 13 ms
[2023-03-11 05:50:37] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-11 05:50:37] [INFO ] Invariant cache hit.
[2023-03-11 05:50:37] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/461 places, 79/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 590 ms. Remains : 91/461 places, 79/448 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s43 1), p1:(OR (EQ s80 0) (EQ s89 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 648 steps with 49 reset in 4 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-07 finished in 770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 460 transition count 288
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 179 rules applied. Total rules applied 338 place count 301 transition count 268
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 352 place count 289 transition count 266
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 354 place count 287 transition count 266
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 354 place count 287 transition count 211
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 464 place count 232 transition count 211
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 471 place count 225 transition count 204
Iterating global reduction 4 with 7 rules applied. Total rules applied 478 place count 225 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 478 place count 225 transition count 201
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 484 place count 222 transition count 201
Performed 83 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 650 place count 139 transition count 108
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 651 place count 139 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 653 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 137 transition count 105
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 18 rules applied. Total rules applied 672 place count 125 transition count 99
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 678 place count 119 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 678 place count 119 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 690 place count 113 transition count 93
Applied a total of 690 rules in 60 ms. Remains 113 /461 variables (removed 348) and now considering 93/448 (removed 355) transitions.
// Phase 1: matrix 93 rows 113 cols
[2023-03-11 05:50:38] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-11 05:50:38] [INFO ] Implicit Places using invariants in 120 ms returned [107, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 134 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/461 places, 93/448 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 103 transition count 85
Applied a total of 16 rules in 4 ms. Remains 103 /111 variables (removed 8) and now considering 85/93 (removed 8) transitions.
// Phase 1: matrix 85 rows 103 cols
[2023-03-11 05:50:38] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-11 05:50:38] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-11 05:50:38] [INFO ] Invariant cache hit.
[2023-03-11 05:50:38] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/461 places, 85/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 586 ms. Remains : 103/461 places, 85/448 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s30 1) (EQ s96 1)), p1:(AND (EQ s39 1) (EQ s100 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-08 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&X(X(G(p2)))))'
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 453 transition count 440
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 453 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 453 transition count 439
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 449 transition count 435
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 449 transition count 435
Applied a total of 25 rules in 34 ms. Remains 449 /461 variables (removed 12) and now considering 435/448 (removed 13) transitions.
// Phase 1: matrix 435 rows 449 cols
[2023-03-11 05:50:38] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-11 05:50:38] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-11 05:50:38] [INFO ] Invariant cache hit.
[2023-03-11 05:50:39] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2023-03-11 05:50:39] [INFO ] Invariant cache hit.
[2023-03-11 05:50:39] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/461 places, 435/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1055 ms. Remains : 449/461 places, 435/448 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s130 1), p1:(EQ s277 1), p2:(OR (EQ s130 1) (EQ s102 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1172 steps with 3 reset in 4 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-09 finished in 1332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p1 U p2))))))'
Support contains 2 out of 461 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 453 transition count 440
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 453 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 453 transition count 439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 448 transition count 434
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 448 transition count 434
Applied a total of 27 rules in 25 ms. Remains 448 /461 variables (removed 13) and now considering 434/448 (removed 14) transitions.
// Phase 1: matrix 434 rows 448 cols
[2023-03-11 05:50:39] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-11 05:50:40] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-11 05:50:40] [INFO ] Invariant cache hit.
[2023-03-11 05:50:40] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-11 05:50:40] [INFO ] Invariant cache hit.
[2023-03-11 05:50:40] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/461 places, 434/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 448/461 places, 434/448 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), 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 s66 1), p2:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 408 reset in 157 ms.
Product exploration explored 100000 steps with 405 reset in 186 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/448 stabilizing places and 108/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 257 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-11 05:50:42] [INFO ] Invariant cache hit.
[2023-03-11 05:50:42] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-11 05:50:42] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:50:42] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-11 05:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:50:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-11 05:50:42] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:50:43] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-11 05:50:43] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 1 ms to minimize.
[2023-03-11 05:50:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-11 05:50:43] [INFO ] Computed and/alt/rep : 433/617/433 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-11 05:50:47] [INFO ] Added : 387 causal constraints over 78 iterations in 4080 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 448 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 434/434 transitions.
Applied a total of 0 rules in 21 ms. Remains 448 /448 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2023-03-11 05:50:47] [INFO ] Invariant cache hit.
[2023-03-11 05:50:47] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-11 05:50:47] [INFO ] Invariant cache hit.
[2023-03-11 05:50:48] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-11 05:50:48] [INFO ] Invariant cache hit.
[2023-03-11 05:50:48] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1013 ms. Remains : 448/448 places, 434/434 transitions.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/448 stabilizing places and 108/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 278 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=139 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-11 05:50:49] [INFO ] Invariant cache hit.
[2023-03-11 05:50:49] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2023-03-11 05:50:49] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 23 ms returned sat
[2023-03-11 05:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:50:49] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2023-03-11 05:50:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:50:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-11 05:50:50] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 26 ms returned sat
[2023-03-11 05:50:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:50:50] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-11 05:50:50] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 0 ms to minimize.
[2023-03-11 05:50:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-11 05:50:50] [INFO ] Computed and/alt/rep : 433/617/433 causal constraints (skipped 0 transitions) in 35 ms.
[2023-03-11 05:50:54] [INFO ] Added : 387 causal constraints over 78 iterations in 3697 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 405 reset in 236 ms.
Product exploration explored 100000 steps with 405 reset in 243 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 434/434 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 448 transition count 434
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 152 place count 448 transition count 428
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 152 place count 448 transition count 428
Deduced a syphon composed of 206 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 212 place count 448 transition count 428
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 332 place count 328 transition count 308
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 120 rules applied. Total rules applied 452 place count 328 transition count 308
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 192 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 557 place count 328 transition count 296
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 625 place count 260 transition count 228
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 2 with 68 rules applied. Total rules applied 693 place count 260 transition count 228
Deduced a syphon composed of 124 places in 0 ms
Applied a total of 693 rules in 73 ms. Remains 260 /448 variables (removed 188) and now considering 228/434 (removed 206) transitions.
[2023-03-11 05:50:55] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 228 rows 260 cols
[2023-03-11 05:50:55] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-11 05:50:55] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/448 places, 228/434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 260/448 places, 228/434 transitions.
Built C files in :
/tmp/ltsmin9897986263919611684
[2023-03-11 05:50:55] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9897986263919611684
Running compilation step : cd /tmp/ltsmin9897986263919611684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 734 ms.
Running link step : cd /tmp/ltsmin9897986263919611684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin9897986263919611684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11728180311463824904.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 434/434 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 447 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 433
Applied a total of 2 rules in 16 ms. Remains 447 /448 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 447 cols
[2023-03-11 05:51:10] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-11 05:51:11] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-11 05:51:11] [INFO ] Invariant cache hit.
[2023-03-11 05:51:11] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-11 05:51:11] [INFO ] Invariant cache hit.
[2023-03-11 05:51:11] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/448 places, 433/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 947 ms. Remains : 447/448 places, 433/434 transitions.
Built C files in :
/tmp/ltsmin56720008832956530
[2023-03-11 05:51:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin56720008832956530
Running compilation step : cd /tmp/ltsmin56720008832956530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 674 ms.
Running link step : cd /tmp/ltsmin56720008832956530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin56720008832956530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1484333634304383866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 05:51:26] [INFO ] Flatten gal took : 21 ms
[2023-03-11 05:51:26] [INFO ] Flatten gal took : 16 ms
[2023-03-11 05:51:26] [INFO ] Time to serialize gal into /tmp/LTL6218837650587209264.gal : 4 ms
[2023-03-11 05:51:26] [INFO ] Time to serialize properties into /tmp/LTL1519748750099258307.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6218837650587209264.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12475040831029247418.hoa' '-atoms' '/tmp/LTL1519748750099258307.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1519748750099258307.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12475040831029247418.hoa
Detected timeout of ITS tools.
[2023-03-11 05:51:42] [INFO ] Flatten gal took : 16 ms
[2023-03-11 05:51:42] [INFO ] Flatten gal took : 14 ms
[2023-03-11 05:51:42] [INFO ] Time to serialize gal into /tmp/LTL17594561448062868129.gal : 5 ms
[2023-03-11 05:51:42] [INFO ] Time to serialize properties into /tmp/LTL2178887023556483163.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17594561448062868129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2178887023556483163.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p85==1)")||(("(p74==1)")U("(p31==1)")))))))
Formula 0 simplified : XXG(!"(p85==1)" & (!"(p74==1)" R !"(p31==1)"))
Detected timeout of ITS tools.
[2023-03-11 05:51:57] [INFO ] Flatten gal took : 39 ms
[2023-03-11 05:51:57] [INFO ] Applying decomposition
[2023-03-11 05:51:57] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18129269109186096763.txt' '-o' '/tmp/graph18129269109186096763.bin' '-w' '/tmp/graph18129269109186096763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18129269109186096763.bin' '-l' '-1' '-v' '-w' '/tmp/graph18129269109186096763.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:51:57] [INFO ] Decomposing Gal with order
[2023-03-11 05:51:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:51:57] [INFO ] Removed a total of 82 redundant transitions.
[2023-03-11 05:51:57] [INFO ] Flatten gal took : 67 ms
[2023-03-11 05:51:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-11 05:51:57] [INFO ] Time to serialize gal into /tmp/LTL11892987547335284740.gal : 7 ms
[2023-03-11 05:51:57] [INFO ] Time to serialize properties into /tmp/LTL8248666186332008934.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11892987547335284740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8248666186332008934.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i5.u27.p85==1)")||(("(i3.u24.p74==1)")U("(i2.u13.p31==1)")))))))
Formula 0 simplified : XXG(!"(i5.u27.p85==1)" & (!"(i3.u24.p74==1)" R !"(i2.u13.p31==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3951138924987233152
[2023-03-11 05:52:12] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3951138924987233152
Running compilation step : cd /tmp/ltsmin3951138924987233152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 600 ms.
Running link step : cd /tmp/ltsmin3951138924987233152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin3951138924987233152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-06b-LTLFireability-11 finished in 107763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 452 transition count 439
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 452 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 452 transition count 438
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 447 transition count 433
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 447 transition count 433
Applied a total of 29 rules in 39 ms. Remains 447 /461 variables (removed 14) and now considering 433/448 (removed 15) transitions.
// Phase 1: matrix 433 rows 447 cols
[2023-03-11 05:52:27] [INFO ] Computed 40 place invariants in 5 ms
[2023-03-11 05:52:27] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-11 05:52:27] [INFO ] Invariant cache hit.
[2023-03-11 05:52:28] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-11 05:52:28] [INFO ] Invariant cache hit.
[2023-03-11 05:52:28] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/461 places, 433/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 896 ms. Remains : 447/461 places, 433/448 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s159 1) (EQ s432 1)), p0:(EQ s212 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-12 finished in 1001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 460 transition count 288
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 179 rules applied. Total rules applied 338 place count 301 transition count 268
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 351 place count 289 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 288 transition count 267
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 352 place count 288 transition count 212
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 462 place count 233 transition count 212
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 470 place count 225 transition count 204
Iterating global reduction 4 with 8 rules applied. Total rules applied 478 place count 225 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 478 place count 225 transition count 200
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 486 place count 221 transition count 200
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 658 place count 135 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 659 place count 134 transition count 102
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 18 rules applied. Total rules applied 677 place count 122 transition count 96
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 683 place count 116 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 683 place count 116 transition count 90
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 695 place count 110 transition count 90
Applied a total of 695 rules in 20 ms. Remains 110 /461 variables (removed 351) and now considering 90/448 (removed 358) transitions.
// Phase 1: matrix 90 rows 110 cols
[2023-03-11 05:52:28] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-11 05:52:28] [INFO ] Implicit Places using invariants in 103 ms returned [42, 64, 84, 88, 92, 96, 100, 104, 109]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 116 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/461 places, 90/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 94 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 93 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 93 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 92 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 92 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 91 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 91 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 90 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 90 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 89 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 89 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 88 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 88 transition count 77
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 28 place count 87 transition count 76
Applied a total of 28 rules in 8 ms. Remains 87 /101 variables (removed 14) and now considering 76/90 (removed 14) transitions.
// Phase 1: matrix 76 rows 87 cols
[2023-03-11 05:52:28] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-11 05:52:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 05:52:28] [INFO ] Invariant cache hit.
[2023-03-11 05:52:29] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/461 places, 76/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 87/461 places, 76/448 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4072 reset in 152 ms.
Product exploration explored 100000 steps with 4132 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1524 steps, including 59 resets, run visited all 1 properties in 11 ms. (steps per millisecond=138 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-11 05:52:30] [INFO ] Invariant cache hit.
[2023-03-11 05:52:30] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-11 05:52:31] [INFO ] Invariant cache hit.
[2023-03-11 05:52:31] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2023-03-11 05:52:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 05:52:31] [INFO ] Invariant cache hit.
[2023-03-11 05:52:31] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1162 ms. Remains : 87/87 places, 76/76 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 410 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3046307 steps, run timeout after 3001 ms. (steps per millisecond=1015 ) properties seen :{}
Probabilistic random walk after 3046307 steps, saw 377739 distinct states, run finished after 3003 ms. (steps per millisecond=1014 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:52:34] [INFO ] Invariant cache hit.
[2023-03-11 05:52:34] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-11 05:52:34] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 05:52:35] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 05:52:35] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4089 reset in 165 ms.
Product exploration explored 100000 steps with 4118 reset in 169 ms.
Built C files in :
/tmp/ltsmin2406640267671818880
[2023-03-11 05:52:35] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2023-03-11 05:52:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:35] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2023-03-11 05:52:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:36] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2023-03-11 05:52:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:36] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2406640267671818880
Running compilation step : cd /tmp/ltsmin2406640267671818880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin2406640267671818880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2406640267671818880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13617019007068521609.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-11 05:52:51] [INFO ] Invariant cache hit.
[2023-03-11 05:52:51] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-11 05:52:51] [INFO ] Invariant cache hit.
[2023-03-11 05:52:51] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-11 05:52:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 05:52:51] [INFO ] Invariant cache hit.
[2023-03-11 05:52:51] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 87/87 places, 76/76 transitions.
Built C files in :
/tmp/ltsmin727092609482260725
[2023-03-11 05:52:51] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2023-03-11 05:52:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:51] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2023-03-11 05:52:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:51] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2023-03-11 05:52:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:52:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin727092609482260725
Running compilation step : cd /tmp/ltsmin727092609482260725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin727092609482260725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin727092609482260725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5382538743247106774.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 05:53:06] [INFO ] Flatten gal took : 10 ms
[2023-03-11 05:53:06] [INFO ] Flatten gal took : 7 ms
[2023-03-11 05:53:06] [INFO ] Time to serialize gal into /tmp/LTL1726590114126658843.gal : 2 ms
[2023-03-11 05:53:06] [INFO ] Time to serialize properties into /tmp/LTL1260328297363251537.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1726590114126658843.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10329788610817884079.hoa' '-atoms' '/tmp/LTL1260328297363251537.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1260328297363251537.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10329788610817884079.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1536 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 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.079224,17228,1,0,45,14305,24,24,2056,8361,110
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-06b-LTLFireability-14 finished in 38106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p1))) U (G(F((p0||X(p1))))||(p2&&F((p0||X(p1)))))))'
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 451 transition count 438
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 451 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 451 transition count 437
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 446 transition count 432
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 446 transition count 432
Applied a total of 31 rules in 55 ms. Remains 446 /461 variables (removed 15) and now considering 432/448 (removed 16) transitions.
// Phase 1: matrix 432 rows 446 cols
[2023-03-11 05:53:06] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-11 05:53:07] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-11 05:53:07] [INFO ] Invariant cache hit.
[2023-03-11 05:53:07] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-11 05:53:07] [INFO ] Invariant cache hit.
[2023-03-11 05:53:07] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/461 places, 432/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1026 ms. Remains : 446/461 places, 432/448 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(NEQ s308 1), p0:(EQ s227 1), p1:(NEQ s145 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 485 ms.
Product exploration explored 100000 steps with 50000 reset in 392 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/446 stabilizing places and 108/432 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-06b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06b-LTLFireability-15 finished in 2253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p1 U p2))))))'
Found a Shortening insensitive property : AutoFlight-PT-06b-LTLFireability-11
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 461 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 460 transition count 285
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 182 rules applied. Total rules applied 344 place count 298 transition count 265
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 356 place count 286 transition count 265
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 356 place count 286 transition count 210
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 466 place count 231 transition count 210
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 472 place count 225 transition count 204
Iterating global reduction 3 with 6 rules applied. Total rules applied 478 place count 225 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 478 place count 225 transition count 200
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 486 place count 221 transition count 200
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 654 place count 137 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 655 place count 136 transition count 104
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 18 rules applied. Total rules applied 673 place count 124 transition count 98
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 679 place count 118 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 679 place count 118 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 691 place count 112 transition count 92
Applied a total of 691 rules in 54 ms. Remains 112 /461 variables (removed 349) and now considering 92/448 (removed 356) transitions.
// Phase 1: matrix 92 rows 112 cols
[2023-03-11 05:53:09] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-11 05:53:09] [INFO ] Implicit Places using invariants in 113 ms returned [46, 66, 86, 90, 94, 98, 102, 106, 111]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 117 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 103/461 places, 92/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 95 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 95 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 94 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 94 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 93 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 93 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 92 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 92 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 91 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 91 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 90 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 90 transition count 79
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 28 place count 89 transition count 78
Applied a total of 28 rules in 11 ms. Remains 89 /103 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 89 cols
[2023-03-11 05:53:09] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-11 05:53:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 05:53:09] [INFO ] Invariant cache hit.
[2023-03-11 05:53:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 05:53:09] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 89/461 places, 78/448 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 351 ms. Remains : 89/461 places, 78/448 transitions.
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), 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 s13 1), p2:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 536 steps with 41 reset in 1 ms.
Treatment of property AutoFlight-PT-06b-LTLFireability-11 finished in 596 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-11 05:53:09] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2772311193036716454
[2023-03-11 05:53:09] [INFO ] Computing symmetric may disable matrix : 448 transitions.
[2023-03-11 05:53:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:09] [INFO ] Computing symmetric may enable matrix : 448 transitions.
[2023-03-11 05:53:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:09] [INFO ] Applying decomposition
[2023-03-11 05:53:09] [INFO ] Flatten gal took : 14 ms
[2023-03-11 05:53:09] [INFO ] Computing Do-Not-Accords matrix : 448 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2991859031552372067.txt' '-o' '/tmp/graph2991859031552372067.bin' '-w' '/tmp/graph2991859031552372067.weights'
[2023-03-11 05:53:09] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:09] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2772311193036716454
Running compilation step : cd /tmp/ltsmin2772311193036716454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2991859031552372067.bin' '-l' '-1' '-v' '-w' '/tmp/graph2991859031552372067.weights' '-q' '0' '-e' '0.001'
[2023-03-11 05:53:09] [INFO ] Decomposing Gal with order
[2023-03-11 05:53:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 05:53:09] [INFO ] Removed a total of 82 redundant transitions.
[2023-03-11 05:53:09] [INFO ] Flatten gal took : 26 ms
[2023-03-11 05:53:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-11 05:53:09] [INFO ] Time to serialize gal into /tmp/LTLFireability13702134377500167305.gal : 5 ms
[2023-03-11 05:53:09] [INFO ] Time to serialize properties into /tmp/LTLFireability6725234959313132649.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13702134377500167305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6725234959313132649.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i1.u29.p85==1)")||(("(i4.u26.p74==1)")U("(i1.u13.p31==1)")))))))
Formula 0 simplified : XXG(!"(i1.u29.p85==1)" & (!"(i4.u26.p74==1)" R !"(i1.u13.p31==1)"))
Compilation finished in 940 ms.
Running link step : cd /tmp/ltsmin2772311193036716454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin2772311193036716454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t148, t151, t175, t178, t201, t204, t252, t267, t292, t299, t321, t340, t433, t434, t435, t43...1114
Computing Next relation with stutter on 1920 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
32962 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,329.67,3601196,1,0,9.52267e+06,429,2821,1.13837e+07,125,1006,4329039
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-06b-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 963949 ms.

BK_STOP 1678514773824

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-06b"
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-5348"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-06b, 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 r005-oct2-167813593200460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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