Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 91K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652660977378

Running Version 202205111006
[2022-05-16 00:29:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:29:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:29:38] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-16 00:29:38] [INFO ] Transformed 390 places.
[2022-05-16 00:29:38] [INFO ] Transformed 388 transitions.
[2022-05-16 00:29:38] [INFO ] Found NUPN structural information;
[2022-05-16 00:29:38] [INFO ] Parsed PT model containing 390 places and 388 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-04b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 341 transition count 339
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 341 transition count 339
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 106 place count 341 transition count 331
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 123 place count 324 transition count 314
Iterating global reduction 1 with 17 rules applied. Total rules applied 140 place count 324 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 321 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 321 transition count 311
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 318 transition count 308
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 318 transition count 308
Applied a total of 152 rules in 111 ms. Remains 318 /390 variables (removed 72) and now considering 308/388 (removed 80) transitions.
// Phase 1: matrix 308 rows 318 cols
[2022-05-16 00:29:39] [INFO ] Computed 28 place invariants in 21 ms
[2022-05-16 00:29:39] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 308 rows 318 cols
[2022-05-16 00:29:39] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-16 00:29:39] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
// Phase 1: matrix 308 rows 318 cols
[2022-05-16 00:29:39] [INFO ] Computed 28 place invariants in 5 ms
[2022-05-16 00:29:39] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/390 places, 308/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/390 places, 308/388 transitions.
Support contains 41 out of 318 places after structural reductions.
[2022-05-16 00:29:40] [INFO ] Flatten gal took : 56 ms
[2022-05-16 00:29:40] [INFO ] Flatten gal took : 25 ms
[2022-05-16 00:29:40] [INFO ] Input system was already deterministic with 308 transitions.
Support contains 39 out of 318 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 30) seen :19
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 308 rows 318 cols
[2022-05-16 00:29:41] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:41] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 00:29:41] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-16 00:29:41] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:29:41] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-16 00:29:41] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 5 ms to minimize.
[2022-05-16 00:29:41] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2022-05-16 00:29:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2022-05-16 00:29:42] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2022-05-16 00:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-16 00:29:42] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2022-05-16 00:29:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2022-05-16 00:29:42] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2022-05-16 00:29:42] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 0 ms to minimize.
[2022-05-16 00:29:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2022-05-16 00:29:42] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-16 00:29:42] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 52 ms.
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 318/318 places, 308/308 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 318 transition count 200
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 122 rules applied. Total rules applied 230 place count 210 transition count 186
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 240 place count 202 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 200 transition count 184
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 242 place count 200 transition count 144
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 322 place count 160 transition count 144
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 329 place count 153 transition count 137
Iterating global reduction 4 with 7 rules applied. Total rules applied 336 place count 153 transition count 137
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 336 place count 153 transition count 134
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 342 place count 150 transition count 134
Performed 55 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 452 place count 95 transition count 73
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 464 place count 95 transition count 61
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 476 place count 83 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 477 place count 82 transition count 60
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 5 with 35 rules applied. Total rules applied 512 place count 65 transition count 42
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 530 place count 47 transition count 42
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 530 place count 47 transition count 31
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 552 place count 36 transition count 31
Applied a total of 552 rules in 47 ms. Remains 36 /318 variables (removed 282) and now considering 31/308 (removed 277) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/318 places, 31/308 transitions.
Finished random walk after 8063 steps, including 612 resets, run visited all 3 properties in 20 ms. (steps per millisecond=403 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AutoFlight-PT-04b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 82 stabilizing places and 82 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X(G(X(p1)))))'
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 307 transition count 297
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 307 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 305 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 304 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 304 transition count 294
Applied a total of 28 rules in 29 ms. Remains 304 /318 variables (removed 14) and now considering 294/308 (removed 14) transitions.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:43] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:43] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:43] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:43] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:43] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:43] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/318 places, 294/308 transitions.
Finished structural reductions, in 1 iterations. Remains : 304/318 places, 294/308 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-00 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s95 1) (EQ s210 1)), p1:(OR (EQ s66 0) (EQ s216 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-00 finished in 792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G((p0 U p1))&&F(p2)))) U G((G(p3) U p2))))'
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 310 transition count 300
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 310 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 308 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 307 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 307 transition count 297
Applied a total of 22 rules in 26 ms. Remains 307 /318 variables (removed 11) and now considering 297/308 (removed 11) transitions.
// Phase 1: matrix 297 rows 307 cols
[2022-05-16 00:29:43] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:43] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 297 rows 307 cols
[2022-05-16 00:29:43] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:44] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 297 rows 307 cols
[2022-05-16 00:29:44] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:44] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 307/318 places, 297/308 transitions.
Finished structural reductions, in 1 iterations. Remains : 307/318 places, 297/308 transitions.
Stuttering acceptance computed with spot in 946 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) p3), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p2 p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=0 dest: 5}, { cond=(OR p2 p3), acceptance={} source=0 dest: 6}], [{ cond=(OR (AND p2 p1) (AND p2 p0) (AND p3 p1) (AND p3 p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 8}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 9}], [{ cond=(OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p3 p1) (AND p2 p3 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=2 dest: 9}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND p2 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p2 p3), acceptance={} source=3 dest: 11}], [{ cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 12}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=4 dest: 13}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 8}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=6 dest: 13}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=6 dest: 14}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={0, 1} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 7}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=11 dest: 8}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 14}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={} source=11 dest: 15}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p2) p3), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=12 dest: 12}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={0, 1} source=13 dest: 13}], [{ cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=14 dest: 7}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={} source=14 dest: 10}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={} source=14 dest: 12}, { cond=(OR (AND p2 p1) (AND p2 p0) (AND p3 p1) (AND p3 p0)), acceptance={} source=14 dest: 14}], [{ cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=15 dest: 7}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={} source=15 dest: 10}, { cond=(OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)), acceptance={} source=15 dest: 14}, { cond=(OR (AND p2 p3 p1) (AND p2 p3 p0)), acceptance={} source=15 dest: 15}]], initial=0, aps=[p2:(EQ s57 1), p3:(EQ s158 1), p1:(EQ s45 1), p0:(AND (EQ s296 1) (EQ s303 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-01 finished in 1422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(G(p0)) U !p0)))))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 317 transition count 198
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 123 rules applied. Total rules applied 232 place count 208 transition count 184
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 241 place count 200 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 199 transition count 183
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 242 place count 199 transition count 142
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 324 place count 158 transition count 142
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 332 place count 150 transition count 134
Iterating global reduction 4 with 8 rules applied. Total rules applied 340 place count 150 transition count 134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 340 place count 150 transition count 131
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 346 place count 147 transition count 131
Performed 54 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 454 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 455 place count 92 transition count 70
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 4 with 10 rules applied. Total rules applied 465 place count 85 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 468 place count 82 transition count 67
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 468 place count 82 transition count 63
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 476 place count 78 transition count 63
Applied a total of 476 rules in 48 ms. Remains 78 /318 variables (removed 240) and now considering 63/308 (removed 245) transitions.
// Phase 1: matrix 63 rows 78 cols
[2022-05-16 00:29:45] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-16 00:29:45] [INFO ] Implicit Places using invariants in 58 ms returned [31, 45, 59, 63, 68, 72, 77]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 62 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/318 places, 63/308 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 56
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 16 place count 63 transition count 55
Applied a total of 16 rules in 8 ms. Remains 63 /71 variables (removed 8) and now considering 55/63 (removed 8) transitions.
// Phase 1: matrix 55 rows 63 cols
[2022-05-16 00:29:45] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:29:45] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 55 rows 63 cols
[2022-05-16 00:29:45] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:29:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:29:45] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/318 places, 55/308 transitions.
Finished structural reductions, in 2 iterations. Remains : 63/318 places, 55/308 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5219 reset in 349 ms.
Product exploration explored 100000 steps with 5202 reset in 209 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[p0]
Incomplete random walk after 10000 steps, including 515 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13964 steps, run visited all 1 properties in 38 ms. (steps per millisecond=367 )
Probabilistic random walk after 13964 steps, saw 3093 distinct states, run finished after 38 ms. (steps per millisecond=367 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 63 cols
[2022-05-16 00:29:46] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:29:46] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 55 rows 63 cols
[2022-05-16 00:29:46] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:29:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:29:46] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2022-05-16 00:29:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 63 cols
[2022-05-16 00:29:46] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:29:46] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 55/55 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[p0]
Incomplete random walk after 10000 steps, including 514 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13964 steps, run visited all 1 properties in 27 ms. (steps per millisecond=517 )
Probabilistic random walk after 13964 steps, saw 3093 distinct states, run finished after 27 ms. (steps per millisecond=517 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 5192 reset in 111 ms.
Product exploration explored 100000 steps with 5197 reset in 208 ms.
Built C files in :
/tmp/ltsmin4226014515718628011
[2022-05-16 00:29:47] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2022-05-16 00:29:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:29:47] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2022-05-16 00:29:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:29:47] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2022-05-16 00:29:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:29:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4226014515718628011
Running compilation step : cd /tmp/ltsmin4226014515718628011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin4226014515718628011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4226014515718628011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11662493232783028142.hoa' '--buchi-type=spotba'
LTSmin run took 453 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-04b-LTLFireability-02 finished in 3462 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 308 transition count 298
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 306 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 305 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 305 transition count 295
Applied a total of 26 rules in 15 ms. Remains 305 /318 variables (removed 13) and now considering 295/308 (removed 13) transitions.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:29:48] [INFO ] Computed 28 place invariants in 4 ms
[2022-05-16 00:29:48] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:29:48] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:48] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:29:48] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:49] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/318 places, 295/308 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/318 places, 295/308 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s91 1), p0:(AND (EQ s43 1) (EQ s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-05 finished in 612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)))))'
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 307 transition count 297
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 307 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 305 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 304 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 304 transition count 294
Applied a total of 28 rules in 14 ms. Remains 304 /318 variables (removed 14) and now considering 294/308 (removed 14) transitions.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:49] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:49] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:49] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:49] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:49] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-16 00:29:49] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/318 places, 294/308 transitions.
Finished structural reductions, in 1 iterations. Remains : 304/318 places, 294/308 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s247 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 461 steps with 3 reset in 3 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-07 finished in 603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)||X((G(p1) U X(G(X(p2)))))))))'
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 308 transition count 298
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 307 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 306 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 306 transition count 296
Applied a total of 24 rules in 16 ms. Remains 306 /318 variables (removed 12) and now considering 296/308 (removed 12) transitions.
// Phase 1: matrix 296 rows 306 cols
[2022-05-16 00:29:49] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:49] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 296 rows 306 cols
[2022-05-16 00:29:49] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-16 00:29:50] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 306 cols
[2022-05-16 00:29:50] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:50] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/318 places, 296/308 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/318 places, 296/308 transitions.
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s5 1), p1:(AND (EQ s50 1) (EQ s196 1)), p2:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 582 steps with 40 reset in 3 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-08 finished in 769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(X(F((X(X(p2))||p1))))))'
Support contains 6 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 307 transition count 297
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 307 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 305 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 304 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 304 transition count 294
Applied a total of 28 rules in 13 ms. Remains 304 /318 variables (removed 14) and now considering 294/308 (removed 14) transitions.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:50] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:50] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:50] [INFO ] Computed 28 place invariants in 6 ms
[2022-05-16 00:29:50] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:50] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:50] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/318 places, 294/308 transitions.
Finished structural reductions, in 1 iterations. Remains : 304/318 places, 294/308 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s161 0) (EQ s80 0)), p0:(AND (EQ s139 1) (EQ s260 1)), p2:(OR (EQ s89 0) (EQ s178 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 489 reset in 224 ms.
Product exploration explored 100000 steps with 490 reset in 272 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1522268 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1522268 steps, saw 252941 distinct states, run finished after 3002 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:29:54] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-16 00:29:55] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:29:55] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-16 00:29:55] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:29:55] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:29:55] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
[2022-05-16 00:29:55] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2022-05-16 00:29:55] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2022-05-16 00:29:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2022-05-16 00:29:55] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-16 00:29:55] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 148 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 304 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 : 304/304 places, 294/294 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 303 transition count 194
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 110 rules applied. Total rules applied 209 place count 204 transition count 183
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 219 place count 197 transition count 180
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 222 place count 194 transition count 180
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 222 place count 194 transition count 142
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 298 place count 156 transition count 142
Performed 60 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 418 place count 96 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 95 transition count 73
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 427 place count 89 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 429 place count 87 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 429 place count 87 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 437 place count 83 transition count 67
Applied a total of 437 rules in 23 ms. Remains 83 /304 variables (removed 221) and now considering 67/294 (removed 227) transitions.
// Phase 1: matrix 67 rows 83 cols
[2022-05-16 00:29:55] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:29:55] [INFO ] Implicit Places using invariants in 91 ms returned [35, 49, 63, 67, 72, 76, 82]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 92 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/304 places, 67/294 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 70 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 70 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 69 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 69 transition count 60
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 68 transition count 59
Applied a total of 16 rules in 5 ms. Remains 68 /76 variables (removed 8) and now considering 59/67 (removed 8) transitions.
// Phase 1: matrix 59 rows 68 cols
[2022-05-16 00:29:55] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:29:55] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 59 rows 68 cols
[2022-05-16 00:29:55] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-16 00:29:55] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/304 places, 59/294 transitions.
Finished structural reductions, in 2 iterations. Remains : 68/304 places, 59/294 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 414 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2884285 steps, run timeout after 3001 ms. (steps per millisecond=961 ) properties seen :{}
Probabilistic random walk after 2884285 steps, saw 403222 distinct states, run finished after 3001 ms. (steps per millisecond=961 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 68 cols
[2022-05-16 00:29:59] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-16 00:29:59] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:29:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-16 00:29:59] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:29:59] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 00:29:59] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4175 reset in 178 ms.
Product exploration explored 100000 steps with 4158 reset in 166 ms.
Built C files in :
/tmp/ltsmin10917599180823094482
[2022-05-16 00:30:00] [INFO ] Computing symmetric may disable matrix : 59 transitions.
[2022-05-16 00:30:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:00] [INFO ] Computing symmetric may enable matrix : 59 transitions.
[2022-05-16 00:30:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:00] [INFO ] Computing Do-Not-Accords matrix : 59 transitions.
[2022-05-16 00:30:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:00] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10917599180823094482
Running compilation step : cd /tmp/ltsmin10917599180823094482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin10917599180823094482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10917599180823094482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10062237484680152209.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 59/59 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 68 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 66 transition count 58
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 65 transition count 57
Applied a total of 5 rules in 12 ms. Remains 65 /68 variables (removed 3) and now considering 57/59 (removed 2) transitions.
// Phase 1: matrix 57 rows 65 cols
[2022-05-16 00:30:15] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:30:15] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 57 rows 65 cols
[2022-05-16 00:30:15] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:30:15] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-16 00:30:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 57 rows 65 cols
[2022-05-16 00:30:15] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:30:15] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/68 places, 57/59 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/68 places, 57/59 transitions.
Built C files in :
/tmp/ltsmin7422573376828782269
[2022-05-16 00:30:15] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2022-05-16 00:30:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:15] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2022-05-16 00:30:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:15] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2022-05-16 00:30:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7422573376828782269
Running compilation step : cd /tmp/ltsmin7422573376828782269;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin7422573376828782269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7422573376828782269;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13786542359361997822.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 00:30:30] [INFO ] Flatten gal took : 8 ms
[2022-05-16 00:30:30] [INFO ] Flatten gal took : 7 ms
[2022-05-16 00:30:30] [INFO ] Time to serialize gal into /tmp/LTL11031536769835001903.gal : 3 ms
[2022-05-16 00:30:30] [INFO ] Time to serialize properties into /tmp/LTL2443087132374795150.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11031536769835001903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2443087132374795150.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1103153...267
Read 1 LTL properties
Checking formula 0 : !(((X(X("((p211==1)&&(p343==1))")))||(G(X(F(((X(X("((p134==0)||(p258==0))")))||("(p240==0)"))||("(p119==0)")))))))
Formula 0 simplified : !(XX"((p211==1)&&(p343==1))" | GXF("(p119==0)" | "(p240==0)" | XX"((p134==0)||(p258==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 288 deadlock states
8 unique states visited
0 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.099723,19860,1,0,43,10611,39,24,1625,6650,112
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-04b-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-04b-LTLFireability-09 finished in 40189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(F(G(X(!F(p0)))))&&p1)))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 317 transition count 198
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 120 rules applied. Total rules applied 229 place count 208 transition count 187
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 236 place count 202 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 201 transition count 186
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 237 place count 201 transition count 145
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 319 place count 160 transition count 145
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 327 place count 152 transition count 137
Iterating global reduction 4 with 8 rules applied. Total rules applied 335 place count 152 transition count 137
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 335 place count 152 transition count 133
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 343 place count 148 transition count 133
Performed 53 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 449 place count 95 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 450 place count 94 transition count 73
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 456 place count 89 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 457 place count 88 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 457 place count 88 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 465 place count 84 transition count 68
Applied a total of 465 rules in 44 ms. Remains 84 /318 variables (removed 234) and now considering 68/308 (removed 240) transitions.
// Phase 1: matrix 68 rows 84 cols
[2022-05-16 00:30:30] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:30:30] [INFO ] Implicit Places using invariants in 68 ms returned [35, 49, 63, 67, 72, 77, 83]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 70 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/318 places, 68/308 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 71 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 71 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 70 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 70 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 69 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 69 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 68 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 68 transition count 59
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 20 place count 67 transition count 58
Applied a total of 20 rules in 13 ms. Remains 67 /77 variables (removed 10) and now considering 58/68 (removed 10) transitions.
// Phase 1: matrix 58 rows 67 cols
[2022-05-16 00:30:30] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 00:30:30] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 58 rows 67 cols
[2022-05-16 00:30:30] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 00:30:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:30:31] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/318 places, 58/308 transitions.
Finished structural reductions, in 2 iterations. Remains : 67/318 places, 58/308 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) p0), (NOT p0), p0]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s32 1), p0:(EQ s34 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 22 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-11 finished in 400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(!p0))||G(X(X(p1)))||X(p2)) U p0)))'
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 308 transition count 298
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 306 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 305 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 305 transition count 295
Applied a total of 26 rules in 37 ms. Remains 305 /318 variables (removed 13) and now considering 295/308 (removed 13) transitions.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:31] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:30:31] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:31] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:30:31] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:31] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:30:31] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/318 places, 295/308 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/318 places, 295/308 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s271 1) (EQ s303 1)), p2:(EQ s94 1), p1:(AND (EQ s88 1) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20070 reset in 237 ms.
Product exploration explored 100000 steps with 20013 reset in 255 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) p0), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:33] [INFO ] Computed 28 place invariants in 4 ms
[2022-05-16 00:30:33] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2022-05-16 00:30:33] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:30:33] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2022-05-16 00:30:33] [INFO ] After 138ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-16 00:30:33] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:1
[2022-05-16 00:30:33] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2022-05-16 00:30:33] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:30:33] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-16 00:30:33] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-16 00:30:33] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 103 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p2))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 411 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, true]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, true]
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:34] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:30:34] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-16 00:30:34] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 00:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:34] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-05-16 00:30:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:35] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-16 00:30:35] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:35] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-16 00:30:35] [INFO ] Computed and/alt/rep : 294/420/294 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 00:30:36] [INFO ] Added : 292 causal constraints over 59 iterations in 1294 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:36] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:30:36] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-05-16 00:30:36] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:36] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2022-05-16 00:30:36] [INFO ] Computed and/alt/rep : 294/420/294 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-16 00:30:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-16 00:30:37] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:37] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2022-05-16 00:30:37] [INFO ] Computed and/alt/rep : 294/420/294 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-16 00:30:38] [INFO ] Added : 294 causal constraints over 59 iterations in 1093 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 5 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:38] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:30:38] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:38] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:30:38] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:38] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:30:38] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 295/295 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, true]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:39] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:30:39] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned sat
[2022-05-16 00:30:39] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:30:39] [INFO ] After 80ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 00:30:39] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2022-05-16 00:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-16 00:30:39] [INFO ] After 201ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:30:39] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:30:39] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2022-05-16 00:30:39] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 8 ms returned sat
[2022-05-16 00:30:39] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:30:39] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2022-05-16 00:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-16 00:30:39] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-16 00:30:39] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 295/295 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 305 transition count 189
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 118 rules applied. Total rules applied 224 place count 199 transition count 177
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 232 place count 191 transition count 177
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 232 place count 191 transition count 138
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 310 place count 152 transition count 138
Performed 60 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 430 place count 92 transition count 70
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 446 place count 92 transition count 54
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 462 place count 76 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 463 place count 75 transition count 53
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 4 with 51 rules applied. Total rules applied 514 place count 56 transition count 21
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 546 place count 24 transition count 21
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 546 place count 24 transition count 15
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 558 place count 18 transition count 15
Applied a total of 558 rules in 21 ms. Remains 18 /305 variables (removed 287) and now considering 15/295 (removed 280) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/305 places, 15/295 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, true]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, true]
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:40] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:30:40] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-05-16 00:30:40] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:40] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-05-16 00:30:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:40] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2022-05-16 00:30:40] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:40] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-05-16 00:30:40] [INFO ] Computed and/alt/rep : 294/420/294 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-16 00:30:41] [INFO ] Added : 292 causal constraints over 59 iterations in 1147 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:30:41] [INFO ] Computed 28 place invariants in 4 ms
[2022-05-16 00:30:42] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-16 00:30:42] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:42] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-05-16 00:30:42] [INFO ] Computed and/alt/rep : 294/420/294 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-16 00:30:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:42] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2022-05-16 00:30:42] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:42] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-05-16 00:30:42] [INFO ] Computed and/alt/rep : 294/420/294 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-16 00:30:43] [INFO ] Added : 294 causal constraints over 59 iterations in 1110 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, true]
Product exploration explored 100000 steps with 19988 reset in 204 ms.
Product exploration explored 100000 steps with 20020 reset in 231 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p0, true]
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 305 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 102 place count 305 transition count 291
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 102 place count 305 transition count 291
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 143 place count 305 transition count 291
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 222 place count 226 transition count 212
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 301 place count 226 transition count 212
Performed 72 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 373 place count 226 transition count 204
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 419 place count 180 transition count 158
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 465 place count 180 transition count 158
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 465 rules in 43 ms. Remains 180 /305 variables (removed 125) and now considering 158/295 (removed 137) transitions.
[2022-05-16 00:30:44] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 158 rows 180 cols
[2022-05-16 00:30:44] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:30:44] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/305 places, 158/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/305 places, 158/295 transitions.
Product exploration explored 100000 steps with 20032 reset in 537 ms.
Product exploration explored 100000 steps with 19948 reset in 391 ms.
Built C files in :
/tmp/ltsmin6844417356275546022
[2022-05-16 00:30:45] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6844417356275546022
Running compilation step : cd /tmp/ltsmin6844417356275546022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 530 ms.
Running link step : cd /tmp/ltsmin6844417356275546022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin6844417356275546022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6157660807959084649.hoa' '--buchi-type=spotba'
LTSmin run took 323 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-04b-LTLFireability-12 finished in 15546 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 307 transition count 297
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 307 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 305 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 304 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 304 transition count 294
Applied a total of 28 rules in 26 ms. Remains 304 /318 variables (removed 14) and now considering 294/308 (removed 14) transitions.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:30:46] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:30:46] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:30:46] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:30:47] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:30:47] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:30:47] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/318 places, 294/308 transitions.
Finished structural reductions, in 1 iterations. Remains : 304/318 places, 294/308 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s35 1), p0:(EQ s104 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 571 reset in 147 ms.
Product exploration explored 100000 steps with 570 reset in 159 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 298 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Finished random walk after 191 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
// Phase 1: matrix 294 rows 304 cols
[2022-05-16 00:30:48] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-16 00:30:48] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-16 00:30:48] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:48] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-05-16 00:30:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:48] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-16 00:30:48] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:48] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-05-16 00:30:48] [INFO ] Computed and/alt/rep : 293/419/293 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 00:30:49] [INFO ] Added : 282 causal constraints over 57 iterations in 931 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 304 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 : 304/304 places, 294/294 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 303 transition count 190
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 115 rules applied. Total rules applied 218 place count 200 transition count 178
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 226 place count 192 transition count 178
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 226 place count 192 transition count 141
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 300 place count 155 transition count 141
Performed 60 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 420 place count 95 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 94 transition count 72
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 433 place count 86 transition count 68
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 437 place count 82 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 437 place count 82 transition count 64
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 445 place count 78 transition count 64
Applied a total of 445 rules in 19 ms. Remains 78 /304 variables (removed 226) and now considering 64/294 (removed 230) transitions.
// Phase 1: matrix 64 rows 78 cols
[2022-05-16 00:30:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:30:49] [INFO ] Implicit Places using invariants in 47 ms returned [32, 46, 60, 64, 68, 72, 77]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 48 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/304 places, 64/294 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 59
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 62 transition count 55
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 20 place count 61 transition count 54
Applied a total of 20 rules in 8 ms. Remains 61 /71 variables (removed 10) and now considering 54/64 (removed 10) transitions.
// Phase 1: matrix 54 rows 61 cols
[2022-05-16 00:30:49] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:30:49] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 54 rows 61 cols
[2022-05-16 00:30:49] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:30:50] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/304 places, 54/294 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/304 places, 54/294 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
// Phase 1: matrix 54 rows 61 cols
[2022-05-16 00:30:50] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:30:50] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 00:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 00:30:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 00:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:50] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 00:30:50] [INFO ] Computed and/alt/rep : 32/51/32 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 00:30:50] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Product exploration explored 100000 steps with 10395 reset in 111 ms.
Stack based approach found an accepted trace after 5330 steps with 548 reset with depth 5 and stack size 5 in 7 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-13 finished in 3916 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 317 transition count 196
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 125 rules applied. Total rules applied 236 place count 206 transition count 182
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 244 place count 198 transition count 182
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 244 place count 198 transition count 143
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 322 place count 159 transition count 143
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 330 place count 151 transition count 135
Iterating global reduction 3 with 8 rules applied. Total rules applied 338 place count 151 transition count 135
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 338 place count 151 transition count 131
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 346 place count 147 transition count 131
Performed 54 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 454 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 455 place count 92 transition count 70
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 462 place count 87 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 464 place count 85 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 464 place count 85 transition count 65
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 470 place count 82 transition count 65
Applied a total of 470 rules in 22 ms. Remains 82 /318 variables (removed 236) and now considering 65/308 (removed 243) transitions.
// Phase 1: matrix 65 rows 82 cols
[2022-05-16 00:30:50] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 00:30:50] [INFO ] Implicit Places using invariants in 50 ms returned [33, 47, 61, 67, 72, 76, 81]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 51 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/318 places, 65/308 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 69 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 69 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 68 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 68 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 67 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 67 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 66 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 66 transition count 56
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 20 place count 65 transition count 55
Applied a total of 20 rules in 7 ms. Remains 65 /75 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-16 00:30:50] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 00:30:50] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-16 00:30:50] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:30:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-16 00:30:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 109 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/318 places, 55/308 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 64 transition count 54
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 63 transition count 54
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 63 cols
[2022-05-16 00:30:50] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:30:50] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 54 rows 63 cols
[2022-05-16 00:30:50] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:30:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 00:30:50] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 63/318 places, 54/308 transitions.
Finished structural reductions, in 3 iterations. Remains : 63/318 places, 54/308 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 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 34956 reset in 122 ms.
Product exploration explored 100000 steps with 34995 reset in 134 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Detected a total of 4/63 stabilizing places and 2/54 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 211 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
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 173 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 54 rows 63 cols
[2022-05-16 00:30:51] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:30:51] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-16 00:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 00:30:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-16 00:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:51] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 00:30:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 00:30:51] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-16 00:30:51] [INFO ] Computed and/alt/rep : 47/118/47 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 00:30:51] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 63 cols
[2022-05-16 00:30:51] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-16 00:30:51] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 54 rows 63 cols
[2022-05-16 00:30:51] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:30:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 00:30:52] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-05-16 00:30:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 54 rows 63 cols
[2022-05-16 00:30:52] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:30:52] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 54/54 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Detected a total of 4/63 stabilizing places and 2/54 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 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
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 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
// Phase 1: matrix 54 rows 63 cols
[2022-05-16 00:30:52] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-16 00:30:52] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-16 00:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 00:30:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-16 00:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 00:30:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 00:30:52] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-16 00:30:52] [INFO ] Computed and/alt/rep : 47/118/47 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 00:30:52] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 34984 reset in 170 ms.
Product exploration explored 100000 steps with 34998 reset in 183 ms.
Built C files in :
/tmp/ltsmin3784542224755852407
[2022-05-16 00:30:52] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2022-05-16 00:30:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:52] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2022-05-16 00:30:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:52] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2022-05-16 00:30:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:30:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3784542224755852407
Running compilation step : cd /tmp/ltsmin3784542224755852407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin3784542224755852407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin3784542224755852407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9351145066232127731.hoa' '--buchi-type=spotba'
LTSmin run took 52 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-04b-LTLFireability-14 finished in 2580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(((p0 U !p0)&&p1)) U !F(p2)))||G(p1)))'
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 308/308 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 317 transition count 199
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 118 rules applied. Total rules applied 226 place count 209 transition count 189
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 233 place count 203 transition count 188
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 235 place count 202 transition count 187
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 235 place count 202 transition count 147
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 315 place count 162 transition count 147
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 321 place count 156 transition count 141
Iterating global reduction 4 with 6 rules applied. Total rules applied 327 place count 156 transition count 141
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 327 place count 156 transition count 138
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 333 place count 153 transition count 138
Performed 56 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 445 place count 97 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 447 place count 96 transition count 76
Applied a total of 447 rules in 17 ms. Remains 96 /318 variables (removed 222) and now considering 76/308 (removed 232) transitions.
// Phase 1: matrix 76 rows 96 cols
[2022-05-16 00:30:53] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:30:53] [INFO ] Implicit Places using invariants in 101 ms returned [30, 31, 34, 35, 36, 40, 56, 70, 76, 82, 88, 95]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 103 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/318 places, 76/308 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 0 with 6 rules applied. Total rules applied 6 place count 84 transition count 70
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 78 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 74 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 74 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 73 transition count 65
Applied a total of 22 rules in 6 ms. Remains 73 /84 variables (removed 11) and now considering 65/76 (removed 11) transitions.
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 00:30:53] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-16 00:30:53] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 00:30:53] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:30:53] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 00:30:53] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/318 places, 65/308 transitions.
Finished structural reductions, in 2 iterations. Remains : 73/318 places, 65/308 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) p2), (OR (NOT p1) p0), p2, (AND p0 (NOT p1)), p0]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s35 1), p2:(EQ s33 1), p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-15 finished in 574 ms.
All properties solved by simple procedures.
Total runtime 75101 ms.

BK_STOP 1652661053967

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689300428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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