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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 9.4K Apr 30 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 30 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 01:28 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.6K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 70K 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-03b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652660598362

Running Version 202205111006
[2022-05-16 00:23:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:23:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:23:19] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-05-16 00:23:19] [INFO ] Transformed 298 places.
[2022-05-16 00:23:19] [INFO ] Transformed 296 transitions.
[2022-05-16 00:23:19] [INFO ] Found NUPN structural information;
[2022-05-16 00:23:19] [INFO ] Parsed PT model containing 298 places and 296 transitions in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-03b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 266 transition count 264
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 266 transition count 264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 266 transition count 259
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 80 place count 255 transition count 248
Iterating global reduction 1 with 11 rules applied. Total rules applied 91 place count 255 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 253 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 253 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 251 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 251 transition count 244
Applied a total of 99 rules in 69 ms. Remains 251 /298 variables (removed 47) and now considering 244/296 (removed 52) transitions.
// Phase 1: matrix 244 rows 251 cols
[2022-05-16 00:23:20] [INFO ] Computed 22 place invariants in 9 ms
[2022-05-16 00:23:20] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 244 rows 251 cols
[2022-05-16 00:23:20] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-16 00:23:20] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
// Phase 1: matrix 244 rows 251 cols
[2022-05-16 00:23:20] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:23:20] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 251/298 places, 244/296 transitions.
Finished structural reductions, in 1 iterations. Remains : 251/298 places, 244/296 transitions.
Support contains 37 out of 251 places after structural reductions.
[2022-05-16 00:23:20] [INFO ] Flatten gal took : 40 ms
[2022-05-16 00:23:20] [INFO ] Flatten gal took : 16 ms
[2022-05-16 00:23:20] [INFO ] Input system was already deterministic with 244 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 26) seen :18
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 244 rows 251 cols
[2022-05-16 00:23:21] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:21] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 00:23:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2022-05-16 00:23:21] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:23:22] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 4 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 6 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2022-05-16 00:23:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 512 ms
[2022-05-16 00:23:22] [INFO ] After 944ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-16 00:23:22] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 5 properties in 20 ms.
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 251/251 places, 244/244 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 251 transition count 160
Reduce places removed 84 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 95 rules applied. Total rules applied 179 place count 167 transition count 149
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 185 place count 161 transition count 149
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 185 place count 161 transition count 116
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 251 place count 128 transition count 116
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 260 place count 119 transition count 107
Iterating global reduction 3 with 9 rules applied. Total rules applied 269 place count 119 transition count 107
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 269 place count 119 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 116 transition count 104
Performed 41 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 357 place count 75 transition count 58
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 369 place count 75 transition count 46
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 381 place count 63 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 382 place count 62 transition count 45
Reduce places removed 12 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 4 with 30 rules applied. Total rules applied 412 place count 50 transition count 27
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 430 place count 32 transition count 27
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 430 place count 32 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 446 place count 24 transition count 19
Applied a total of 446 rules in 36 ms. Remains 24 /251 variables (removed 227) and now considering 19/244 (removed 225) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/251 places, 19/244 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA AutoFlight-PT-03b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA AutoFlight-PT-03b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 70 stabilizing places and 70 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U p1))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 240 transition count 233
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 240 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 240 transition count 232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 237 transition count 229
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 235 transition count 227
Applied a total of 33 rules in 28 ms. Remains 235 /251 variables (removed 16) and now considering 227/244 (removed 17) transitions.
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:23] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:23:23] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:23] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:23] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:23:23] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/251 places, 227/244 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/251 places, 227/244 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, p1, (AND p1 p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s51 1), p0:(OR (EQ s104 0) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 661 reset in 230 ms.
Product exploration explored 100000 steps with 663 reset in 183 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (AND p0 p1), (AND p0 p1)]
Finished random walk after 7005 steps, including 43 resets, run visited all 2 properties in 41 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[true, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 99 ms :[true, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 227/227 (removed 0) transitions.
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:24] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 00:23:25] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:25] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:23:25] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:25] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:25] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 227/227 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[true, (AND p0 p1), (AND p0 p1)]
Finished random walk after 813 steps, including 4 resets, run visited all 2 properties in 10 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[true, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 101 ms :[true, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 95 ms :[true, (AND p0 p1), (AND p0 p1)]
Entered a terminal (fully accepting) state of product in 34936 steps with 231 reset in 81 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-00 finished in 3163 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 231
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 233 transition count 225
Applied a total of 37 rules in 37 ms. Remains 233 /251 variables (removed 18) and now considering 225/244 (removed 19) transitions.
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:26] [INFO ] Computed 22 place invariants in 14 ms
[2022-05-16 00:23:26] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:26] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:23:26] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:26] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:26] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/251 places, 225/244 transitions.
Finished structural reductions, in 1 iterations. Remains : 233/251 places, 225/244 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s200 0) (EQ s183 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-03b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-01 finished in 1075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G((G(F(p0)) U (F(p2)||p1)))))))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 250 transition count 163
Reduce places removed 80 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 91 rules applied. Total rules applied 171 place count 170 transition count 152
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 179 place count 164 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 162 transition count 150
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 181 place count 162 transition count 115
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 251 place count 127 transition count 115
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 258 place count 120 transition count 108
Iterating global reduction 4 with 7 rules applied. Total rules applied 265 place count 120 transition count 108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 265 place count 120 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 118 transition count 106
Performed 40 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
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 349 place count 78 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 350 place count 77 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 352 place count 75 transition count 60
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 352 place count 75 transition count 58
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 356 place count 73 transition count 58
Applied a total of 356 rules in 58 ms. Remains 73 /251 variables (removed 178) and now considering 58/244 (removed 186) transitions.
// Phase 1: matrix 58 rows 73 cols
[2022-05-16 00:23:27] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 00:23:27] [INFO ] Implicit Places using invariants in 58 ms returned [33, 44, 55, 60, 65, 72]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 60 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/251 places, 58/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 54
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 54
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 10 place count 62 transition count 53
Applied a total of 10 rules in 5 ms. Remains 62 /67 variables (removed 5) and now considering 53/58 (removed 5) transitions.
// Phase 1: matrix 53 rows 62 cols
[2022-05-16 00:23:27] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:23:27] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 53 rows 62 cols
[2022-05-16 00:23:27] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:23:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 00:23:27] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/251 places, 53/244 transitions.
Finished structural reductions, in 2 iterations. Remains : 62/251 places, 53/244 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s33 0) (EQ s9 1)), p2:(NEQ s32 1), p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5116 reset in 156 ms.
Product exploration explored 100000 steps with 5127 reset in 191 ms.
Computed a total of 10 stabilizing places and 7 stable transitions
Computed a total of 10 stabilizing places and 7 stable transitions
Detected a total of 10/62 stabilizing places and 7/53 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 7 factoid took 474 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 514 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 53 rows 62 cols
[2022-05-16 00:23:29] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:23:29] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:23:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 00:23:29] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:23:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 00:23:29] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:23:29] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 00:23:29] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 53/53 transitions.
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 62 transition count 36
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 27 rules applied. Total rules applied 44 place count 40 transition count 31
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 49 place count 35 transition count 31
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 49 place count 35 transition count 26
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 30 transition count 26
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 61 place count 29 transition count 25
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 29 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 27 transition count 23
Applied a total of 65 rules in 6 ms. Remains 27 /62 variables (removed 35) and now considering 23/53 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/62 places, 23/53 transitions.
Finished random walk after 445 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 427 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 53/53 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 62 cols
[2022-05-16 00:23:29] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:23:30] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 53 rows 62 cols
[2022-05-16 00:23:30] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:23:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 00:23:30] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2022-05-16 00:23:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 53 rows 62 cols
[2022-05-16 00:23:30] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:23:30] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 53/53 transitions.
Computed a total of 10 stabilizing places and 7 stable transitions
Computed a total of 10 stabilizing places and 7 stable transitions
Detected a total of 10/62 stabilizing places and 7/53 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 7 factoid took 441 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 514 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 53 rows 62 cols
[2022-05-16 00:23:30] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:23:30] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:23:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 00:23:31] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:23:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 00:23:31] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:23:31] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 00:23:31] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 53/53 transitions.
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 62 transition count 36
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 27 rules applied. Total rules applied 44 place count 40 transition count 31
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 49 place count 35 transition count 31
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 49 place count 35 transition count 26
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 30 transition count 26
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 61 place count 29 transition count 25
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 29 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 27 transition count 23
Applied a total of 65 rules in 7 ms. Remains 27 /62 variables (removed 35) and now considering 23/53 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/62 places, 23/53 transitions.
Finished random walk after 3277 steps, including 0 resets, run visited all 2 properties in 28 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 557 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5114 reset in 132 ms.
Product exploration explored 100000 steps with 5136 reset in 146 ms.
Built C files in :
/tmp/ltsmin7400770437694007804
[2022-05-16 00:23:32] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2022-05-16 00:23:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:23:32] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2022-05-16 00:23:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:23:32] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2022-05-16 00:23:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:23:32] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7400770437694007804
Running compilation step : cd /tmp/ltsmin7400770437694007804;'/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 309 ms.
Running link step : cd /tmp/ltsmin7400770437694007804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin7400770437694007804;'/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/stateBased10998393832253669539.hoa' '--buchi-type=spotba'
LTSmin run took 1068 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLCardinality-02 finished in 6492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 250 transition count 162
Reduce places removed 81 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 91 rules applied. Total rules applied 172 place count 169 transition count 152
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 179 place count 163 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 162 transition count 151
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 180 place count 162 transition count 118
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 246 place count 129 transition count 118
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 254 place count 121 transition count 110
Iterating global reduction 4 with 8 rules applied. Total rules applied 262 place count 121 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 262 place count 121 transition count 108
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 266 place count 119 transition count 108
Performed 43 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 352 place count 76 transition count 60
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 353 place count 76 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 4 with 2 rules applied. Total rules applied 355 place count 75 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 74 transition count 57
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 359 place count 71 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 359 place count 71 transition count 54
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 365 place count 68 transition count 54
Applied a total of 365 rules in 33 ms. Remains 68 /251 variables (removed 183) and now considering 54/244 (removed 190) transitions.
// Phase 1: matrix 54 rows 68 cols
[2022-05-16 00:23:33] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:23:34] [INFO ] Implicit Places using invariants in 44 ms returned [29, 40, 51, 56, 61, 67]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 46 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/251 places, 54/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 50
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 57 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 56 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 47
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 54 transition count 46
Applied a total of 16 rules in 8 ms. Remains 54 /62 variables (removed 8) and now considering 46/54 (removed 8) transitions.
// Phase 1: matrix 46 rows 54 cols
[2022-05-16 00:23:34] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:23:34] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 46 rows 54 cols
[2022-05-16 00:23:34] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:23:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 00:23:34] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/251 places, 46/244 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/251 places, 46/244 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6608 reset in 185 ms.
Product exploration explored 100000 steps with 6570 reset in 190 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 28 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 54 cols
[2022-05-16 00:23:35] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:23:35] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 46 rows 54 cols
[2022-05-16 00:23:35] [INFO ] Computed 13 place invariants in 11 ms
[2022-05-16 00:23:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 00:23:35] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-05-16 00:23:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 46 rows 54 cols
[2022-05-16 00:23:35] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:23:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 46/46 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6576 reset in 136 ms.
Product exploration explored 100000 steps with 6579 reset in 270 ms.
Built C files in :
/tmp/ltsmin185506233759102757
[2022-05-16 00:23:36] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2022-05-16 00:23:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:23:36] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2022-05-16 00:23:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:23:36] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2022-05-16 00:23:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:23:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin185506233759102757
Running compilation step : cd /tmp/ltsmin185506233759102757;'/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 196 ms.
Running link step : cd /tmp/ltsmin185506233759102757;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin185506233759102757;'/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/stateBased9536275179424801963.hoa' '--buchi-type=spotba'
LTSmin run took 307 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLCardinality-03 finished in 2814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1)) U p0))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 239 transition count 232
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 239 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 239 transition count 231
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 236 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 234 transition count 226
Applied a total of 35 rules in 18 ms. Remains 234 /251 variables (removed 17) and now considering 226/244 (removed 18) transitions.
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:23:36] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:36] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:23:36] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:37] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:23:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:37] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/251 places, 226/244 transitions.
Finished structural reductions, in 1 iterations. Remains : 234/251 places, 226/244 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s46 1), p1:(OR (EQ s179 0) (EQ s161 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-04 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(G(F(G(p1))))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 231
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 233 transition count 225
Applied a total of 37 rules in 20 ms. Remains 233 /251 variables (removed 18) and now considering 225/244 (removed 19) transitions.
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:37] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:37] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:37] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-16 00:23:37] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/251 places, 225/244 transitions.
Finished structural reductions, in 1 iterations. Remains : 233/251 places, 225/244 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s3 1), p1:(AND (EQ s57 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-05 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(p0)))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 239 transition count 232
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 239 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 235 transition count 227
Applied a total of 33 rules in 17 ms. Remains 235 /251 variables (removed 16) and now considering 227/244 (removed 17) transitions.
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:37] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:37] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:23:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:38] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/251 places, 227/244 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/251 places, 227/244 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s96 0) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-07 finished in 466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(G(p0))))))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 250 transition count 160
Reduce places removed 83 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 94 rules applied. Total rules applied 177 place count 167 transition count 149
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 183 place count 161 transition count 149
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 183 place count 161 transition count 114
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 253 place count 126 transition count 114
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 261 place count 118 transition count 106
Iterating global reduction 3 with 8 rules applied. Total rules applied 269 place count 118 transition count 106
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 269 place count 118 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 115 transition count 103
Performed 41 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 357 place count 74 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 358 place count 73 transition count 56
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 361 place count 70 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 361 place count 70 transition count 53
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 367 place count 67 transition count 53
Applied a total of 367 rules in 20 ms. Remains 67 /251 variables (removed 184) and now considering 53/244 (removed 191) transitions.
// Phase 1: matrix 53 rows 67 cols
[2022-05-16 00:23:38] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 00:23:38] [INFO ] Implicit Places using invariants in 50 ms returned [28, 39, 50, 55, 60, 66]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 51 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/251 places, 53/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 56 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 56 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 55 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 55 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 54 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 54 transition count 46
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 53 transition count 45
Applied a total of 16 rules in 7 ms. Remains 53 /61 variables (removed 8) and now considering 45/53 (removed 8) transitions.
// Phase 1: matrix 45 rows 53 cols
[2022-05-16 00:23:38] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:23:38] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 45 rows 53 cols
[2022-05-16 00:23:38] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:23:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 00:23:38] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/251 places, 45/244 transitions.
Finished structural reductions, in 2 iterations. Remains : 53/251 places, 45/244 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-08 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(!(!p0 U p0))))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 231
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 233 transition count 225
Applied a total of 37 rules in 18 ms. Remains 233 /251 variables (removed 18) and now considering 225/244 (removed 19) transitions.
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:38] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-16 00:23:38] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:38] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:38] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:23:38] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-16 00:23:38] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/251 places, 225/244 transitions.
Finished structural reductions, in 1 iterations. Remains : 233/251 places, 225/244 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s186 0) (EQ s220 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 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-10 finished in 454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((X(p0)||p1))))&&F(p2)))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 240 transition count 233
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 240 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 238 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 238 transition count 231
Applied a total of 26 rules in 11 ms. Remains 238 /251 variables (removed 13) and now considering 231/244 (removed 13) transitions.
// Phase 1: matrix 231 rows 238 cols
[2022-05-16 00:23:38] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:38] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 231 rows 238 cols
[2022-05-16 00:23:38] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:39] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 231 rows 238 cols
[2022-05-16 00:23:39] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:39] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/251 places, 231/244 transitions.
Finished structural reductions, in 1 iterations. Remains : 238/251 places, 231/244 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s37 1), p1:(EQ s185 0), p0:(AND (EQ s26 0) (EQ s43 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]]
Stuttering criterion allowed to conclude after 157 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-12 finished in 615 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G((X(p0)||p1)))))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 241 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 241 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 241 transition count 233
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 238 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 238 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 237 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 236 transition count 228
Applied a total of 31 rules in 25 ms. Remains 236 /251 variables (removed 15) and now considering 228/244 (removed 16) transitions.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:23:39] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:39] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:23:39] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:39] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:23:39] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:23:39] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/251 places, 228/244 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/251 places, 228/244 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s20 0) (EQ s84 1)), p0:(OR (EQ s20 0) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 624 reset in 256 ms.
Product exploration explored 100000 steps with 627 reset in 338 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 372 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:23:41] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:41] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2022-05-16 00:23:41] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:23:41] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2022-05-16 00:23:41] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-16 00:23:41] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:1
[2022-05-16 00:23:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2022-05-16 00:23:41] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:23:41] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-16 00:23:41] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 00:23:41] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 104 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=52 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 12 factoid took 523 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:23:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:42] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:23:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:42] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:23:42] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:23:42] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 228/228 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 296 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Finished probabilistic random walk after 3808 steps, run visited all 4 properties in 41 ms. (steps per millisecond=92 )
Probabilistic random walk after 3808 steps, saw 1875 distinct states, run finished after 41 ms. (steps per millisecond=92 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 375 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 627 reset in 202 ms.
Product exploration explored 100000 steps with 625 reset in 271 ms.
Built C files in :
/tmp/ltsmin14569827202514166357
[2022-05-16 00:23:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14569827202514166357
Running compilation step : cd /tmp/ltsmin14569827202514166357;'/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 384 ms.
Running link step : cd /tmp/ltsmin14569827202514166357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14569827202514166357;'/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/stateBased11192435698145100562.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 228/228 transitions.
Applied a total of 0 rules in 9 ms. Remains 236 /236 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:23:59] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:00] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:24:00] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:24:00] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:24:00] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:00] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 228/228 transitions.
Built C files in :
/tmp/ltsmin1879794097188117079
[2022-05-16 00:24:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1879794097188117079
Running compilation step : cd /tmp/ltsmin1879794097188117079;'/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 329 ms.
Running link step : cd /tmp/ltsmin1879794097188117079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1879794097188117079;'/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/stateBased13628348172255012737.hoa' '--buchi-type=spotba'
LTSmin run took 11503 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLCardinality-15 finished in 32669 ms.
All properties solved by simple procedures.
Total runtime 52539 ms.

BK_STOP 1652660652301

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-03b"
export BK_EXAMINATION="LTLCardinality"
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-03b, examination is LTLCardinality"
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-165245689300411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03b.tgz
mv AutoFlight-PT-03b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;