Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180100093.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r043-smll-171620180100093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:42 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 1716280113408

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=gold2023
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 202304061127
[2024-05-21 08:28:35] [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]
[2024-05-21 08:28:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:28:36] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-05-21 08:28:36] [INFO ] Transformed 574 places.
[2024-05-21 08:28:36] [INFO ] Transformed 572 transitions.
[2024-05-21 08:28:36] [INFO ] Found NUPN structural information;
[2024-05-21 08:28:36] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-06b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 503 transition count 501
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 503 transition count 501
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 154 place count 503 transition count 489
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 184 place count 473 transition count 459
Iterating global reduction 1 with 30 rules applied. Total rules applied 214 place count 473 transition count 459
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 218 place count 469 transition count 455
Iterating global reduction 1 with 4 rules applied. Total rules applied 222 place count 469 transition count 455
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 226 place count 465 transition count 451
Iterating global reduction 1 with 4 rules applied. Total rules applied 230 place count 465 transition count 451
Applied a total of 230 rules in 316 ms. Remains 465 /574 variables (removed 109) and now considering 451/572 (removed 121) transitions.
// Phase 1: matrix 451 rows 465 cols
[2024-05-21 08:28:37] [INFO ] Computed 40 invariants in 30 ms
[2024-05-21 08:28:37] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-21 08:28:37] [INFO ] Invariant cache hit.
[2024-05-21 08:28:38] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-21 08:28:38] [INFO ] Invariant cache hit.
[2024-05-21 08:28:38] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 465/574 places, 451/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1857 ms. Remains : 465/574 places, 451/572 transitions.
Support contains 26 out of 465 places after structural reductions.
[2024-05-21 08:28:38] [INFO ] Flatten gal took : 98 ms
[2024-05-21 08:28:38] [INFO ] Flatten gal took : 36 ms
[2024-05-21 08:28:38] [INFO ] Input system was already deterministic with 451 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 601 ms. (steps per millisecond=16 ) properties (out of 24) seen :19
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 08:28:39] [INFO ] Invariant cache hit.
[2024-05-21 08:28:40] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2024-05-21 08:28:40] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-21 08:28:40] [INFO ] After 422ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2024-05-21 08:28:40] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 9 ms to minimize.
[2024-05-21 08:28:41] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 1 ms to minimize.
[2024-05-21 08:28:41] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 2 ms to minimize.
[2024-05-21 08:28:41] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 2 ms to minimize.
[2024-05-21 08:28:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 984 ms
[2024-05-21 08:28:41] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 5 ms to minimize.
[2024-05-21 08:28:42] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 1 ms to minimize.
[2024-05-21 08:28:42] [INFO ] Deduced a trap composed of 119 places in 239 ms of which 1 ms to minimize.
[2024-05-21 08:28:42] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 7 ms to minimize.
[2024-05-21 08:28:42] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 1 ms to minimize.
[2024-05-21 08:28:42] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 1 ms to minimize.
[2024-05-21 08:28:43] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 0 ms to minimize.
[2024-05-21 08:28:43] [INFO ] Deduced a trap composed of 83 places in 188 ms of which 0 ms to minimize.
[2024-05-21 08:28:43] [INFO ] Deduced a trap composed of 85 places in 168 ms of which 1 ms to minimize.
[2024-05-21 08:28:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1858 ms
[2024-05-21 08:28:43] [INFO ] After 3471ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 08:28:43] [INFO ] After 3836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 08:28:43] [INFO ] [Nat]Absence check using 39 positive place invariants in 22 ms returned sat
[2024-05-21 08:28:43] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-21 08:28:44] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 08:28:44] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2024-05-21 08:28:44] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 0 ms to minimize.
[2024-05-21 08:28:44] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 0 ms to minimize.
[2024-05-21 08:28:44] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 1 ms to minimize.
[2024-05-21 08:28:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 697 ms
[2024-05-21 08:28:45] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 1 ms to minimize.
[2024-05-21 08:28:45] [INFO ] Deduced a trap composed of 80 places in 189 ms of which 1 ms to minimize.
[2024-05-21 08:28:45] [INFO ] Deduced a trap composed of 119 places in 187 ms of which 1 ms to minimize.
[2024-05-21 08:28:45] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 3 ms to minimize.
[2024-05-21 08:28:46] [INFO ] Deduced a trap composed of 117 places in 252 ms of which 3 ms to minimize.
[2024-05-21 08:28:46] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 1 ms to minimize.
[2024-05-21 08:28:46] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 1 ms to minimize.
[2024-05-21 08:28:46] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 0 ms to minimize.
[2024-05-21 08:28:46] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 1 ms to minimize.
[2024-05-21 08:28:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1822 ms
[2024-05-21 08:28:46] [INFO ] After 2995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-21 08:28:46] [INFO ] After 3350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 54 ms.
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 451/451 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 465 transition count 286
Reduce places removed 165 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 183 rules applied. Total rules applied 348 place count 300 transition count 268
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 288 transition count 268
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 360 place count 288 transition count 212
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 472 place count 232 transition count 212
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 478 place count 226 transition count 206
Iterating global reduction 3 with 6 rules applied. Total rules applied 484 place count 226 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 484 place count 226 transition count 203
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 490 place count 223 transition count 203
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 3 with 174 rules applied. Total rules applied 664 place count 136 transition count 104
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 688 place count 136 transition count 80
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 712 place count 112 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 713 place count 111 transition count 79
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 72 rules applied. Total rules applied 785 place count 83 transition count 35
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 829 place count 39 transition count 35
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 829 place count 39 transition count 24
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 851 place count 28 transition count 24
Applied a total of 851 rules in 95 ms. Remains 28 /465 variables (removed 437) and now considering 24/451 (removed 427) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 28/465 places, 24/451 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 121 stabilizing places and 121 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))||F(G((p0||F(p2))))))'
Support contains 3 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 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 464 transition count 289
Reduce places removed 161 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 179 rules applied. Total rules applied 340 place count 303 transition count 271
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 352 place count 291 transition count 271
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 352 place count 291 transition count 215
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 464 place count 235 transition count 215
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 469 place count 230 transition count 210
Iterating global reduction 3 with 5 rules applied. Total rules applied 474 place count 230 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 474 place count 230 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 478 place count 228 transition count 208
Performed 89 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 656 place count 139 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 657 place count 138 transition count 106
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 673 place count 127 transition count 101
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 678 place count 122 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 678 place count 122 transition count 95
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 690 place count 116 transition count 95
Applied a total of 690 rules in 140 ms. Remains 116 /465 variables (removed 349) and now considering 95/451 (removed 356) transitions.
// Phase 1: matrix 95 rows 116 cols
[2024-05-21 08:28:47] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:28:48] [INFO ] Implicit Places using invariants in 708 ms returned [49, 69, 89, 93, 97, 101, 105, 110, 115]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 710 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/465 places, 95/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 88
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 16 place count 99 transition count 87
Applied a total of 16 rules in 12 ms. Remains 99 /107 variables (removed 8) and now considering 87/95 (removed 8) transitions.
// Phase 1: matrix 87 rows 99 cols
[2024-05-21 08:28:48] [INFO ] Computed 20 invariants in 2 ms
[2024-05-21 08:28:48] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 08:28:48] [INFO ] Invariant cache hit.
[2024-05-21 08:28:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:28:49] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/465 places, 87/451 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1184 ms. Remains : 99/465 places, 87/451 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) (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-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s24 1), p0:(EQ s48 1), p2:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-01 finished in 1633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 464 transition count 285
Reduce places removed 165 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 183 rules applied. Total rules applied 348 place count 299 transition count 267
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 287 transition count 267
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 360 place count 287 transition count 211
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 472 place count 231 transition count 211
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 479 place count 224 transition count 204
Iterating global reduction 3 with 7 rules applied. Total rules applied 486 place count 224 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 486 place count 224 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 494 place count 220 transition count 200
Performed 84 Post agglomeration using F-continuation condition with reduction of 12 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 662 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 663 place count 135 transition count 103
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 673 place count 128 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 676 place count 125 transition count 100
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 676 place count 125 transition count 96
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 684 place count 121 transition count 96
Applied a total of 684 rules in 80 ms. Remains 121 /465 variables (removed 344) and now considering 96/451 (removed 355) transitions.
// Phase 1: matrix 96 rows 121 cols
[2024-05-21 08:28:49] [INFO ] Computed 33 invariants in 1 ms
[2024-05-21 08:28:49] [INFO ] Implicit Places using invariants in 270 ms returned [50, 70, 90, 96, 102, 106, 110, 115, 120]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 271 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/465 places, 96/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 104 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 104 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 103 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 103 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 102 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 102 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 101 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 101 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 100 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 100 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 99 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 99 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 98 transition count 82
Applied a total of 28 rules in 27 ms. Remains 98 /112 variables (removed 14) and now considering 82/96 (removed 14) transitions.
// Phase 1: matrix 82 rows 98 cols
[2024-05-21 08:28:49] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 08:28:50] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-21 08:28:50] [INFO ] Invariant cache hit.
[2024-05-21 08:28:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 08:28:50] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 477 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/465 places, 82/451 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 97 transition count 81
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 2 place count 96 transition count 81
Applied a total of 2 rules in 7 ms. Remains 96 /97 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-21 08:28:50] [INFO ] Computed 23 invariants in 4 ms
[2024-05-21 08:28:50] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 08:28:50] [INFO ] Invariant cache hit.
[2024-05-21 08:28:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:28:50] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 96/465 places, 81/451 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1141 ms. Remains : 96/465 places, 81/451 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3734 reset in 409 ms.
Product exploration explored 100000 steps with 3708 reset in 328 ms.
Computed a total of 7 stabilizing places and 3 stable transitions
Computed a total of 7 stabilizing places and 3 stable transitions
Detected a total of 7/96 stabilizing places and 3/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-21 08:28:51] [INFO ] Invariant cache hit.
[2024-05-21 08:28:52] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 08:28:52] [INFO ] Invariant cache hit.
[2024-05-21 08:28:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:28:52] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-21 08:28:52] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 08:28:52] [INFO ] Invariant cache hit.
[2024-05-21 08:28:52] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 7 stabilizing places and 3 stable transitions
Computed a total of 7 stabilizing places and 3 stable transitions
Detected a total of 7/96 stabilizing places and 3/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 281 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 242 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3725 reset in 188 ms.
Product exploration explored 100000 steps with 3728 reset in 466 ms.
Built C files in :
/tmp/ltsmin3202925663675615590
[2024-05-21 08:28:53] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-21 08:28:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:28:53] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-21 08:28:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:28:53] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-21 08:28:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:28:53] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3202925663675615590
Running compilation step : cd /tmp/ltsmin3202925663675615590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 496 ms.
Running link step : cd /tmp/ltsmin3202925663675615590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3202925663675615590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5352856632310772647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 7 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-21 08:29:08] [INFO ] Invariant cache hit.
[2024-05-21 08:29:08] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 08:29:08] [INFO ] Invariant cache hit.
[2024-05-21 08:29:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:29:09] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-21 08:29:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 08:29:09] [INFO ] Invariant cache hit.
[2024-05-21 08:29:09] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin12489455045303249586
[2024-05-21 08:29:09] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-21 08:29:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:29:09] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-21 08:29:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:29:09] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-21 08:29:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:29:09] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12489455045303249586
Running compilation step : cd /tmp/ltsmin12489455045303249586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 260 ms.
Running link step : cd /tmp/ltsmin12489455045303249586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12489455045303249586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15742792320515360004.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 08:29:24] [INFO ] Flatten gal took : 9 ms
[2024-05-21 08:29:24] [INFO ] Flatten gal took : 7 ms
[2024-05-21 08:29:24] [INFO ] Time to serialize gal into /tmp/LTL2366516414463324290.gal : 4 ms
[2024-05-21 08:29:24] [INFO ] Time to serialize properties into /tmp/LTL3304008638630679206.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2366516414463324290.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4248676787879936369.hoa' '-atoms' '/tmp/LTL3304008638630679206.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3304008638630679206.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4248676787879936369.hoa
Reverse transition relation is NOT exact ! Due to transitions t188, t191.t203.t206.t216.t224.t231.t238.t250.t258.t265.t273.t280.t287.t299.t306.t313.t321.t3...464
Computing Next relation with stutter on 2944 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
80 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.854731,36016,1,0,364,112503,192,279,2673,134232,588
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-06b-LTLFireability-02 finished in 36159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 98 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 08:29:25] [INFO ] Computed 40 invariants in 6 ms
[2024-05-21 08:29:26] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-21 08:29:26] [INFO ] Invariant cache hit.
[2024-05-21 08:29:26] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2024-05-21 08:29:26] [INFO ] Invariant cache hit.
[2024-05-21 08:29:27] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1565 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 181 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 3199 reset in 305 ms.
Product exploration explored 100000 steps with 3134 reset in 382 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 (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) 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 249 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 171 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)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-21 08:29:28] [INFO ] Invariant cache hit.
[2024-05-21 08:29:28] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-05-21 08:29:28] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 08:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 08:29:29] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2024-05-21 08:29:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:29:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-05-21 08:29:29] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 08:29:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 08:29:29] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-05-21 08:29:29] [INFO ] Computed and/alt/rep : 431/615/431 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-21 08:29:33] [INFO ] Added : 408 causal constraints over 82 iterations in 3636 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 1 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 46 ms. Remains 112 /446 variables (removed 334) and now considering 92/432 (removed 340) transitions.
// Phase 1: matrix 92 rows 112 cols
[2024-05-21 08:29:33] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 08:29:34] [INFO ] Implicit Places using invariants in 579 ms returned [44, 64, 84, 88, 92, 96, 100, 111]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 580 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 16 ms. Remains 90 /104 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 90 cols
[2024-05-21 08:29:34] [INFO ] Computed 20 invariants in 0 ms
[2024-05-21 08:29:34] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 08:29:34] [INFO ] Invariant cache hit.
[2024-05-21 08:29:34] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 261 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 904 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 182 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 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
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 209 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-21 08:29:35] [INFO ] Invariant cache hit.
[2024-05-21 08:29:35] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-21 08:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 08:29:35] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 08:29:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:29:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-21 08:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 08:29:35] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 08:29:35] [INFO ] Computed and/alt/rep : 46/73/46 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 08:29:35] [INFO ] Added : 11 causal constraints over 3 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7359 reset in 210 ms.
Stack based approach found an accepted trace after 5645 steps with 413 reset with depth 4 and stack size 4 in 13 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-04 finished in 10057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 53 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 08:29:35] [INFO ] Computed 40 invariants in 7 ms
[2024-05-21 08:29:35] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 08:29:35] [INFO ] Invariant cache hit.
[2024-05-21 08:29:36] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-05-21 08:29:36] [INFO ] Invariant cache hit.
[2024-05-21 08:29:36] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1124 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 268 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-06 finished in 1264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 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 464 transition count 288
Reduce places removed 162 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 180 rules applied. Total rules applied 342 place count 302 transition count 270
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 355 place count 290 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 356 place count 289 transition count 269
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 356 place count 289 transition count 212
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 470 place count 232 transition count 212
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 477 place count 225 transition count 205
Iterating global reduction 4 with 7 rules applied. Total rules applied 484 place count 225 transition count 205
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 484 place count 225 transition count 201
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 492 place count 221 transition count 201
Performed 85 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 662 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 663 place count 135 transition count 103
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 679 place count 124 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 684 place count 119 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 684 place count 119 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 696 place count 113 transition count 92
Applied a total of 696 rules in 40 ms. Remains 113 /465 variables (removed 352) and now considering 92/451 (removed 359) transitions.
// Phase 1: matrix 92 rows 113 cols
[2024-05-21 08:29:36] [INFO ] Computed 29 invariants in 2 ms
[2024-05-21 08:29:37] [INFO ] Implicit Places using invariants in 188 ms returned [44, 64, 84, 88, 98, 102, 107, 112]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 191 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/465 places, 92/451 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 96 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 96 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 95 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 95 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 94 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 94 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 93 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 93 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 91 transition count 78
Applied a total of 28 rules in 12 ms. Remains 91 /105 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 91 cols
[2024-05-21 08:29:37] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 08:29:37] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 08:29:37] [INFO ] Invariant cache hit.
[2024-05-21 08:29:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 08:29:37] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/465 places, 78/451 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 518 ms. Remains : 91/465 places, 78/451 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-07 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 164 place count 464 transition count 286
Reduce places removed 164 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 182 rules applied. Total rules applied 346 place count 300 transition count 268
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 358 place count 288 transition count 268
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 358 place count 288 transition count 212
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 470 place count 232 transition count 212
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 476 place count 226 transition count 206
Iterating global reduction 3 with 6 rules applied. Total rules applied 482 place count 226 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 482 place count 226 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 488 place count 223 transition count 203
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 3 with 174 rules applied. Total rules applied 662 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 663 place count 135 transition count 103
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 679 place count 124 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 684 place count 119 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 684 place count 119 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 696 place count 113 transition count 92
Applied a total of 696 rules in 32 ms. Remains 113 /465 variables (removed 352) and now considering 92/451 (removed 359) transitions.
// Phase 1: matrix 92 rows 113 cols
[2024-05-21 08:29:37] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:29:37] [INFO ] Implicit Places using invariants in 126 ms returned [46, 66, 86, 90, 94, 98, 102, 107, 112]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 128 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/465 places, 92/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 85
Iterating global reduction 0 with 7 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 91 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 91 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 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
[2024-05-21 08:29:37] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 08:29:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 08:29:37] [INFO ] Invariant cache hit.
[2024-05-21 08:29:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 08:29:37] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/465 places, 78/451 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 355 ms. Remains : 90/465 places, 78/451 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7819 reset in 217 ms.
Stack based approach found an accepted trace after 5024 steps with 398 reset with depth 3 and stack size 3 in 18 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-08 finished in 645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1)))&&X(F((p2||G(p3))))))'
Support contains 3 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 458 transition count 444
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 458 transition count 444
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 454 transition count 440
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 454 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 453 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 453 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 452 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 452 transition count 438
Applied a total of 26 rules in 53 ms. Remains 452 /465 variables (removed 13) and now considering 438/451 (removed 13) transitions.
// Phase 1: matrix 438 rows 452 cols
[2024-05-21 08:29:38] [INFO ] Computed 40 invariants in 4 ms
[2024-05-21 08:29:38] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 08:29:38] [INFO ] Invariant cache hit.
[2024-05-21 08:29:38] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-21 08:29:38] [INFO ] Invariant cache hit.
[2024-05-21 08:29:39] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/465 places, 438/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 ms. Remains : 452/465 places, 438/451 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), 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=p0, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s189 1), p1:(NEQ s282 1), p2:(EQ s148 1), p3:(EQ s282 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 423 reset in 190 ms.
Product exploration explored 100000 steps with 432 reset in 222 ms.
Computed a total of 112 stabilizing places and 112 stable transitions
Computed a total of 112 stabilizing places and 112 stable transitions
Detected a total of 112/452 stabilizing places and 112/438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 143 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), true, false, false]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 08:29:40] [INFO ] Invariant cache hit.
[2024-05-21 08:29:40] [INFO ] [Real]Absence check using 39 positive place invariants in 26 ms returned sat
[2024-05-21 08:29:40] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 08:29:40] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 08:29:41] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2024-05-21 08:29:41] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-21 08:29:41] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 08:29:41] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 1 ms to minimize.
[2024-05-21 08:29:41] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 1 ms to minimize.
[2024-05-21 08:29:41] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 1 ms to minimize.
[2024-05-21 08:29:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 474 ms
[2024-05-21 08:29:41] [INFO ] After 763ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-21 08:29:41] [INFO ] After 962ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 207 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 5 ms.
Support contains 2 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 438/438 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 452 transition count 281
Reduce places removed 157 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 175 rules applied. Total rules applied 332 place count 295 transition count 263
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 345 place count 283 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 346 place count 282 transition count 262
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 346 place count 282 transition count 206
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 458 place count 226 transition count 206
Performed 89 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 636 place count 137 transition count 105
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 660 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 684 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 685 place count 112 transition count 80
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 5 with 72 rules applied. Total rules applied 757 place count 83 transition count 37
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 44 rules applied. Total rules applied 801 place count 40 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 802 place count 39 transition count 36
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 802 place count 39 transition count 24
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 826 place count 27 transition count 24
Applied a total of 826 rules in 25 ms. Remains 27 /452 variables (removed 425) and now considering 24/438 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 27/452 places, 24/438 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (NOT (AND (NOT p2) p3))), (F (NOT p1)), (F (AND p1 p2 p3)), (F (AND p1 p2 (NOT p3)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 15 factoid took 254 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-06b-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06b-LTLFireability-09 finished in 4077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X((F(p0) U p1))))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 49 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 08:29:42] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 08:29:42] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 08:29:42] [INFO ] Invariant cache hit.
[2024-05-21 08:29:42] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-21 08:29:42] [INFO ] Invariant cache hit.
[2024-05-21 08:29:43] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 443 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=(NOT p1), acceptance={} source=8 dest: 4}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s1 1), p1:(EQ s229 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 279 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-10 finished in 1550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p1 U p2))))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 458 transition count 444
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 458 transition count 444
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 452 transition count 438
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 452 transition count 438
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 450 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Applied a total of 34 rules in 49 ms. Remains 448 /465 variables (removed 17) and now considering 434/451 (removed 17) transitions.
// Phase 1: matrix 434 rows 448 cols
[2024-05-21 08:29:43] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 08:29:43] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 08:29:43] [INFO ] Invariant cache hit.
[2024-05-21 08:29:44] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-21 08:29:44] [INFO ] Invariant cache hit.
[2024-05-21 08:29:44] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/465 places, 434/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1080 ms. Remains : 448/465 places, 434/451 transitions.
Stuttering acceptance computed with spot in 110 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 405 reset in 196 ms.
Product exploration explored 100000 steps with 404 reset in 254 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 94 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 199 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 241 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=241 )
Parikh walk visited 0 properties in 0 ms.
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 134 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 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-21 08:29:46] [INFO ] Invariant cache hit.
[2024-05-21 08:29:46] [INFO ] [Real]Absence check using 39 positive place invariants in 22 ms returned sat
[2024-05-21 08:29:46] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 08:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 08:29:46] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-05-21 08:29:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:29:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 22 ms returned sat
[2024-05-21 08:29:47] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 08:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 08:29:47] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2024-05-21 08:29:47] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-21 08:29:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-21 08:29:47] [INFO ] Computed and/alt/rep : 433/617/433 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-21 08:29:50] [INFO ] Added : 387 causal constraints over 78 iterations in 2976 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 10 ms. Remains 448 /448 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-21 08:29:50] [INFO ] Invariant cache hit.
[2024-05-21 08:29:50] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 08:29:50] [INFO ] Invariant cache hit.
[2024-05-21 08:29:51] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-05-21 08:29:51] [INFO ] Invariant cache hit.
[2024-05-21 08:29:51] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 989 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 98 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 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 239 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
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 123 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 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-21 08:29:52] [INFO ] Invariant cache hit.
[2024-05-21 08:29:52] [INFO ] [Real]Absence check using 39 positive place invariants in 20 ms returned sat
[2024-05-21 08:29:52] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 08:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 08:29:52] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2024-05-21 08:29:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:29:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-05-21 08:29:53] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 08:29:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 08:29:53] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2024-05-21 08:29:53] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 0 ms to minimize.
[2024-05-21 08:29:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-21 08:29:53] [INFO ] Computed and/alt/rep : 433/617/433 causal constraints (skipped 0 transitions) in 31 ms.
[2024-05-21 08:29:56] [INFO ] Added : 387 causal constraints over 78 iterations in 2987 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 406 reset in 201 ms.
Product exploration explored 100000 steps with 405 reset in 252 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 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 1 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 110 ms. Remains 260 /448 variables (removed 188) and now considering 228/434 (removed 206) transitions.
[2024-05-21 08:29:57] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 228 rows 260 cols
[2024-05-21 08:29:57] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 08:29:58] [INFO ] Dead Transitions using invariants and state equation in 391 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 586 ms. Remains : 260/448 places, 228/434 transitions.
Built C files in :
/tmp/ltsmin3205027028210029426
[2024-05-21 08:29:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3205027028210029426
Running compilation step : cd /tmp/ltsmin3205027028210029426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1011 ms.
Running link step : cd /tmp/ltsmin3205027028210029426;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3205027028210029426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3039743848082426747.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 49 ms. Remains 447 /448 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 447 cols
[2024-05-21 08:30:13] [INFO ] Computed 40 invariants in 5 ms
[2024-05-21 08:30:13] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 08:30:13] [INFO ] Invariant cache hit.
[2024-05-21 08:30:14] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-05-21 08:30:14] [INFO ] Invariant cache hit.
[2024-05-21 08:30:14] [INFO ] Dead Transitions using invariants and state equation in 384 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 1181 ms. Remains : 447/448 places, 433/434 transitions.
Built C files in :
/tmp/ltsmin12609538436389200718
[2024-05-21 08:30:14] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12609538436389200718
Running compilation step : cd /tmp/ltsmin12609538436389200718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 972 ms.
Running link step : cd /tmp/ltsmin12609538436389200718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12609538436389200718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10120779166845015392.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 08:30:29] [INFO ] Flatten gal took : 28 ms
[2024-05-21 08:30:29] [INFO ] Flatten gal took : 27 ms
[2024-05-21 08:30:29] [INFO ] Time to serialize gal into /tmp/LTL353248103197909360.gal : 6 ms
[2024-05-21 08:30:29] [INFO ] Time to serialize properties into /tmp/LTL12375732773459193835.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL353248103197909360.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3580443738003822936.hoa' '-atoms' '/tmp/LTL12375732773459193835.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL12375732773459193835.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3580443738003822936.hoa
Detected timeout of ITS tools.
[2024-05-21 08:30:44] [INFO ] Flatten gal took : 29 ms
[2024-05-21 08:30:44] [INFO ] Flatten gal took : 48 ms
[2024-05-21 08:30:44] [INFO ] Time to serialize gal into /tmp/LTL717245387652453038.gal : 9 ms
[2024-05-21 08:30:44] [INFO ] Time to serialize properties into /tmp/LTL13403420421624134109.ltl : 84 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL717245387652453038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13403420421624134109.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
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.
[2024-05-21 08:30:59] [INFO ] Flatten gal took : 35 ms
[2024-05-21 08:30:59] [INFO ] Applying decomposition
[2024-05-21 08:30:59] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7549950156519857057.txt' '-o' '/tmp/graph7549950156519857057.bin' '-w' '/tmp/graph7549950156519857057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7549950156519857057.bin' '-l' '-1' '-v' '-w' '/tmp/graph7549950156519857057.weights' '-q' '0' '-e' '0.001'
[2024-05-21 08:31:00] [INFO ] Decomposing Gal with order
[2024-05-21 08:31:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 08:31:00] [INFO ] Removed a total of 84 redundant transitions.
[2024-05-21 08:31:00] [INFO ] Flatten gal took : 268 ms
[2024-05-21 08:31:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2024-05-21 08:31:00] [INFO ] Time to serialize gal into /tmp/LTL2597229877342570902.gal : 13 ms
[2024-05-21 08:31:00] [INFO ] Time to serialize properties into /tmp/LTL3867907026777214667.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2597229877342570902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3867907026777214667.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i7.u29.p85==1)")||(("(i6.u24.p74==1)")U("(i5.u13.p31==1)")))))))
Formula 0 simplified : XXG(!"(i7.u29.p85==1)" & (!"(i6.u24.p74==1)" R !"(i5.u13.p31==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2892846107101058152
[2024-05-21 08:31:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2892846107101058152
Running compilation step : cd /tmp/ltsmin2892846107101058152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 970 ms.
Running link step : cd /tmp/ltsmin2892846107101058152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2892846107101058152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 107196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 464 transition count 285
Reduce places removed 165 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 183 rules applied. Total rules applied 348 place count 299 transition count 267
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 287 transition count 267
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 360 place count 287 transition count 212
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 470 place count 232 transition count 212
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 477 place count 225 transition count 205
Iterating global reduction 3 with 7 rules applied. Total rules applied 484 place count 225 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 484 place count 225 transition count 201
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 492 place count 221 transition count 201
Performed 84 Post agglomeration using F-continuation condition with reduction of 12 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 660 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 661 place count 136 transition count 104
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 677 place count 125 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 682 place count 120 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 682 place count 120 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 694 place count 114 transition count 93
Applied a total of 694 rules in 43 ms. Remains 114 /465 variables (removed 351) and now considering 93/451 (removed 358) transitions.
// Phase 1: matrix 93 rows 114 cols
[2024-05-21 08:31:30] [INFO ] Computed 29 invariants in 0 ms
[2024-05-21 08:31:31] [INFO ] Implicit Places using invariants in 199 ms returned [45, 65, 85, 89, 98, 102, 107, 113]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 200 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/465 places, 93/451 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 100 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 100 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 99 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 99 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 98 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 96 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 96 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 95 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 95 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 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 92 transition count 79
Applied a total of 28 rules in 17 ms. Remains 92 /106 variables (removed 14) and now considering 79/93 (removed 14) transitions.
// Phase 1: matrix 79 rows 92 cols
[2024-05-21 08:31:31] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 08:31:31] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 08:31:31] [INFO ] Invariant cache hit.
[2024-05-21 08:31:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 08:31:31] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/465 places, 79/451 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 584 ms. Remains : 92/465 places, 79/451 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-13 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:(AND (EQ s82 1) (EQ s90 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]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-13 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 49 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 08:31:31] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 08:31:31] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 08:31:31] [INFO ] Invariant cache hit.
[2024-05-21 08:31:32] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-05-21 08:31:32] [INFO ] Invariant cache hit.
[2024-05-21 08:31:32] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1186 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s348 1) (EQ s444 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][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-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-14 finished in 1311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 46 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
[2024-05-21 08:31:32] [INFO ] Invariant cache hit.
[2024-05-21 08:31:33] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 08:31:33] [INFO ] Invariant cache hit.
[2024-05-21 08:31:33] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-21 08:31:33] [INFO ] Invariant cache hit.
[2024-05-21 08:31:33] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (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 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:(AND (EQ s403 1) (EQ s442 1)), p1:(OR (NEQ s58 1) (NEQ s286 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 423 reset in 399 ms.
Product exploration explored 100000 steps with 435 reset in 302 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 08:31:35] [INFO ] Invariant cache hit.
[2024-05-21 08:31:35] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-05-21 08:31:35] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 08:31:35] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-21 08:31:35] [INFO ] [Nat]Absence check using 39 positive place invariants in 22 ms returned sat
[2024-05-21 08:31:35] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 08:31:35] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 08:31:35] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-21 08:31:35] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 161 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 426 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 4 out of 446 places. Attempting structural reductions.
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 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 445 transition count 275
Reduce places removed 156 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 174 rules applied. Total rules applied 330 place count 289 transition count 257
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 342 place count 277 transition count 257
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 342 place count 277 transition count 203
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 450 place count 223 transition count 203
Performed 86 Post agglomeration using F-continuation condition with reduction of 12 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 622 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 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 3 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 4 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 5 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 5 with 12 rules applied. Total rules applied 659 place count 112 transition count 92
Applied a total of 659 rules in 38 ms. Remains 112 /446 variables (removed 334) and now considering 92/432 (removed 340) transitions.
// Phase 1: matrix 92 rows 112 cols
[2024-05-21 08:31:37] [INFO ] Computed 28 invariants in 0 ms
[2024-05-21 08:31:37] [INFO ] Implicit Places using invariants in 174 ms returned [44, 64, 84, 88, 92, 101, 105, 111]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 176 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 11 ms. Remains 90 /104 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 90 cols
[2024-05-21 08:31:37] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 08:31:37] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 08:31:37] [INFO ] Invariant cache hit.
[2024-05-21 08:31:37] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 354 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 579 ms. Remains : 90/446 places, 78/432 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 10 factoid took 357 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 360 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 08:31:38] [INFO ] Invariant cache hit.
[2024-05-21 08:31:38] [INFO ] [Real]Absence check using 20 positive place invariants in 117 ms returned sat
[2024-05-21 08:31:38] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 703 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering criterion allowed to conclude after 137 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-15 finished in 7258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 111 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 465 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 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 464 transition count 285
Reduce places removed 165 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 183 rules applied. Total rules applied 348 place count 299 transition count 267
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 287 transition count 267
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 360 place count 287 transition count 211
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 472 place count 231 transition count 211
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 477 place count 226 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 482 place count 226 transition count 206
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 482 place count 226 transition count 202
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 490 place count 222 transition count 202
Performed 84 Post agglomeration using F-continuation condition with reduction of 12 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 658 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 659 place count 137 transition count 105
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 675 place count 126 transition count 100
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 680 place count 121 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 680 place count 121 transition count 94
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 692 place count 115 transition count 94
Applied a total of 692 rules in 33 ms. Remains 115 /465 variables (removed 350) and now considering 94/451 (removed 357) transitions.
// Phase 1: matrix 94 rows 115 cols
[2024-05-21 08:31:40] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:31:40] [INFO ] Implicit Places using invariants in 103 ms returned [48, 68, 88, 92, 96, 100, 104, 109, 114]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 104 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/465 places, 94/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 99 transition count 87
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 99 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 98 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 98 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 81
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 92 transition count 80
Applied a total of 28 rules in 8 ms. Remains 92 /106 variables (removed 14) and now considering 80/94 (removed 14) transitions.
// Phase 1: matrix 80 rows 92 cols
[2024-05-21 08:31:40] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 08:31:40] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 08:31:40] [INFO ] Invariant cache hit.
[2024-05-21 08:31:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 08:31:40] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 92/465 places, 80/451 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 378 ms. Remains : 92/465 places, 80/451 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 10887 steps with 934 reset in 28 ms.
Treatment of property AutoFlight-PT-06b-LTLFireability-11 finished in 636 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 08:31:40] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17855208329144189147
[2024-05-21 08:31:40] [INFO ] Computing symmetric may disable matrix : 451 transitions.
[2024-05-21 08:31:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:31:40] [INFO ] Computing symmetric may enable matrix : 451 transitions.
[2024-05-21 08:31:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:31:40] [INFO ] Applying decomposition
[2024-05-21 08:31:40] [INFO ] Flatten gal took : 34 ms
[2024-05-21 08:31:40] [INFO ] Computing Do-Not-Accords matrix : 451 transitions.
[2024-05-21 08:31:40] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:31:40] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17855208329144189147
Running compilation step : cd /tmp/ltsmin17855208329144189147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17319344205134225498.txt' '-o' '/tmp/graph17319344205134225498.bin' '-w' '/tmp/graph17319344205134225498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17319344205134225498.bin' '-l' '-1' '-v' '-w' '/tmp/graph17319344205134225498.weights' '-q' '0' '-e' '0.001'
[2024-05-21 08:31:40] [INFO ] Decomposing Gal with order
[2024-05-21 08:31:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 08:31:41] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-21 08:31:41] [INFO ] Flatten gal took : 63 ms
[2024-05-21 08:31:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-21 08:31:41] [INFO ] Time to serialize gal into /tmp/LTLFireability393417268933949010.gal : 25 ms
[2024-05-21 08:31:41] [INFO ] Time to serialize properties into /tmp/LTLFireability9349701899650558214.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability393417268933949010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9349701899650558214.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i3.u28.p85==1)")||(("(i3.u25.p74==1)")U("(i3.u13.p31==1)")))))))
Formula 0 simplified : XXG(!"(i3.u28.p85==1)" & (!"(i3.u25.p74==1)" R !"(i3.u13.p31==1)"))
Compilation finished in 1552 ms.
Running link step : cd /tmp/ltsmin17855208329144189147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17855208329144189147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 t138, t148, t162, t165, t178, t188, t191, t224, t231, t258, t280, t306, t344, t436, t437, t43...1125
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
31045 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,310.529,2848236,1,0,7.21872e+06,347,2880,9.12918e+06,96,834,4611166
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 930314 ms.

BK_STOP 1716281047440

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r043-smll-171620180100093"
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 ;