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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 22K Apr 29 20:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 29 20:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 29 20:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 127K Apr 29 20:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.9K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K May 9 07:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 91K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652658487974

Running Version 202205111006
[2022-05-15 23:48:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:48:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:48:09] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-15 23:48:09] [INFO ] Transformed 159 places.
[2022-05-15 23:48:09] [INFO ] Transformed 168 transitions.
[2022-05-15 23:48:09] [INFO ] Parsed PT model containing 159 places and 168 transitions in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 62 places and 0 transitions.
FORMULA AirplaneLD-PT-0020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 168/168 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 94 transition count 168
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 51 transition count 125
Iterating global reduction 1 with 43 rules applied. Total rules applied 89 place count 51 transition count 125
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 132 place count 51 transition count 82
Applied a total of 132 rules in 14 ms. Remains 51 /97 variables (removed 46) and now considering 82/168 (removed 86) transitions.
// Phase 1: matrix 82 rows 51 cols
[2022-05-15 23:48:09] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-15 23:48:09] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 82 rows 51 cols
[2022-05-15 23:48:09] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:48:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 82 rows 51 cols
[2022-05-15 23:48:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:09] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/97 places, 82/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/97 places, 82/168 transitions.
Support contains 48 out of 51 places after structural reductions.
[2022-05-15 23:48:09] [INFO ] Flatten gal took : 21 ms
[2022-05-15 23:48:09] [INFO ] Flatten gal took : 9 ms
[2022-05-15 23:48:09] [INFO ] Input system was already deterministic with 82 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 51 cols
[2022-05-15 23:48:10] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-15 23:48:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-15 23:48:10] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AirplaneLD-PT-0020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 51 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Graph (complete) has 60 edges and 51 vertex of which 1 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.2 ms
Discarding 50 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1 transition count 1
Applied a total of 3 rules in 4 ms. Remains 1 /51 variables (removed 50) and now considering 1/82 (removed 81) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:48:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:48:10] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:48:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:48:10] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-15 23:48:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:48:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:48:10] [INFO ] Dead Transitions using invariants and state equation in 12 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/51 places, 1/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/51 places, 1/82 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 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 1 steps with 0 reset in 2 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-01 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(G(p0)))) U p1))'
Support contains 14 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 29 transition count 60
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 29 transition count 60
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 66 place count 29 transition count 38
Applied a total of 66 rules in 3 ms. Remains 29 /51 variables (removed 22) and now considering 38/82 (removed 44) transitions.
// Phase 1: matrix 38 rows 29 cols
[2022-05-15 23:48:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:10] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 38 rows 29 cols
[2022-05-15 23:48:11] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-15 23:48:11] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 38 rows 29 cols
[2022-05-15 23:48:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/51 places, 38/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/51 places, 38/82 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s22 1) (GEQ s28 1)), p0:(OR (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s7 1) (GEQ s25 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s25 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-03 finished in 263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(!(G(X(p1)) U F(p1))))))'
Support contains 23 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 37 transition count 68
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 37 transition count 68
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 42 place count 37 transition count 54
Applied a total of 42 rules in 2 ms. Remains 37 /51 variables (removed 14) and now considering 54/82 (removed 28) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-15 23:48:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:11] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-15 23:48:11] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:48:11] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 37 cols
[2022-05-15 23:48:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/51 places, 54/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/51 places, 54/82 transitions.
Stuttering acceptance computed with spot in 125 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true, (OR (NOT p0) p1)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s11 1) (GEQ s34 1)) (AND (GEQ s16 1) (GEQ s34 1)) (AND (GEQ s18 1) (GEQ s34 1)) (AND (GEQ s21 1) (GEQ s34 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 3 reset in 1 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-04 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&X(G(F(G(p1)))))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Graph (complete) has 60 edges and 51 vertex of which 8 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 74 output transitions
Drop transitions removed 74 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /51 variables (removed 43) and now considering 8/82 (removed 74) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:48:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:11] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:48:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:11] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-15 23:48:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:48:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/51 places, 8/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/51 places, 8/82 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s7 1)), p1:(OR (LT s2 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 24005 reset in 221 ms.
Product exploration explored 100000 steps with 24000 reset in 114 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0020-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-05 finished in 701 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U X(p0))))'
Support contains 20 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 37 transition count 68
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 37 transition count 68
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 42 place count 37 transition count 54
Applied a total of 42 rules in 2 ms. Remains 37 /51 variables (removed 14) and now considering 54/82 (removed 28) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-15 23:48:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:12] [INFO ] Implicit Places using invariants in 21 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/51 places, 54/82 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 36/51 places, 54/82 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-07 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 (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s11 1) (GEQ s34 1)) (AND (GEQ s16 1) (GEQ s34 1)) (AND (GEQ s18 1) (GEQ s34 1)) (AND (GEQ s21 1) (GEQ s34 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]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-07 finished in 79 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U G(!p1)))&&(!G(p1) U (p1 U p2))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Graph (complete) has 60 edges and 51 vertex of which 46 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 31 place count 16 transition count 46
Iterating global reduction 0 with 30 rules applied. Total rules applied 61 place count 16 transition count 46
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 91 place count 16 transition count 16
Applied a total of 91 rules in 3 ms. Remains 16 /51 variables (removed 35) and now considering 16/82 (removed 66) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-15 23:48:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:12] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-15 23:48:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:12] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 23:48:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-15 23:48:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:12] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/51 places, 16/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/51 places, 16/82 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) p1), true, p1, (NOT p2), p1]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s15 1)), p0:(AND (GEQ s7 1) (GEQ s14 1)), p2:(AND (GEQ s1 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-08 finished in 184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))||G(F(!(F(p2) U p3)))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 21 transition count 52
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 21 transition count 52
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 90 place count 21 transition count 22
Applied a total of 90 rules in 2 ms. Remains 21 /51 variables (removed 30) and now considering 22/82 (removed 60) transitions.
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 23:48:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:12] [INFO ] Implicit Places using invariants in 23 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/51 places, 22/82 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/51 places, 22/82 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) p3), (AND (NOT p1) p2 p3), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p2 (NOT p1) p3), (AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND p2 p3), p3]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) p3 (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 p2 (NOT p1)) (AND p0 p3 (NOT p1))), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(OR (AND p2 (NOT p1)) (AND p3 (NOT p1))), acceptance={} source=5 dest: 7}, { cond=(NOT p1), acceptance={} source=5 dest: 9}], [{ cond=(OR (AND p2 (NOT p1)) (AND p3 (NOT p1))), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=p3, acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=8 dest: 7}, { cond=(AND p2 p3), acceptance={0, 1} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) p3), acceptance={1} source=8 dest: 8}], [{ cond=(OR p2 p3), acceptance={} source=9 dest: 7}, { cond=true, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (LT s12 1) (LT s19 1)), p2:(AND (GEQ s2 1) (GEQ s17 1)), p3:(AND (GEQ s4 1) (GEQ s17 1)), p1:(GEQ s13 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32399 reset in 85 ms.
Product exploration explored 100000 steps with 32485 reset in 86 ms.
Computed a total of 20 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND p0 p2 (NOT p1)) (AND p0 p3 (NOT p1))))), (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))), (X (NOT (OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) p3 (NOT p1))))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p0 p2 (NOT p1)) (AND p0 p3 (NOT p1)))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) p3 (NOT p1)))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1)))))), (X (X (NOT (OR p2 p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p3)))
Knowledge based reduction with 28 factoid took 1150 ms. Reduced automaton from 10 states, 32 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-09 finished in 1764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X((F(X(p0))||p1))))||X(G((X(p1)||p2)))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 20 transition count 51
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 20 transition count 51
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 93 place count 20 transition count 20
Applied a total of 93 rules in 2 ms. Remains 20 /51 variables (removed 31) and now considering 20/82 (removed 62) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:48:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:48:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:48:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/51 places, 20/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/51 places, 20/82 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s5 1) (GEQ s15 1)), p0:(AND (GEQ s11 1) (GEQ s18 1)), p2:(AND (GEQ s13 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-11 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(X(p0))))||(X(p1)&&G(p2))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 20 transition count 51
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 20 transition count 51
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 93 place count 20 transition count 20
Applied a total of 93 rules in 1 ms. Remains 20 /51 variables (removed 31) and now considering 20/82 (removed 62) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:48:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:48:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:48:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:14] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/51 places, 20/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/51 places, 20/82 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s14 1) (GEQ s19 1)), p0:(AND (GEQ s5 1) (GEQ s15 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-13 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Graph (complete) has 60 edges and 51 vertex of which 31 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 12 transition count 31
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 12 transition count 31
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 58 place count 12 transition count 12
Applied a total of 58 rules in 4 ms. Remains 12 /51 variables (removed 39) and now considering 12/82 (removed 70) transitions.
// Phase 1: matrix 12 rows 12 cols
[2022-05-15 23:48:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants in 16 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/51 places, 12/82 transitions.
Graph (complete) has 9 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 23:48:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 23:48:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/51 places, 10/82 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/51 places, 10/82 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s7 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 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-14 finished in 85 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(!p0 U p1))||X(X(G(!p0)))||F(!p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Graph (complete) has 60 edges and 51 vertex of which 2 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.0 ms
Discarding 49 places :
Also discarding 77 output transitions
Drop transitions removed 77 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 2 transition count 2
Applied a total of 4 rules in 1 ms. Remains 2 /51 variables (removed 49) and now considering 2/82 (removed 80) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 23:48:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 23:48:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:48:14] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2022-05-15 23:48:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 23:48:14] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:48:14] [INFO ] Dead Transitions using invariants and state equation in 12 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/51 places, 2/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/51 places, 2/82 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND p0 p1)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 5 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-15 finished in 279 ms.
All properties solved by simple procedures.
Total runtime 5928 ms.

BK_STOP 1652658495467

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0020.tgz
mv AirplaneLD-PT-0020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;