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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 89K Apr 29 21:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 352K Apr 29 21:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Apr 29 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 839K Apr 29 21:08 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 55K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 158K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K May 9 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 229K May 9 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 9 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 9 07:02 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 872K 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-0200-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652658666441

Running Version 202205111006
[2022-05-15 23:51:07] [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:51:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:51:07] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2022-05-15 23:51:07] [INFO ] Transformed 1419 places.
[2022-05-15 23:51:07] [INFO ] Transformed 1608 transitions.
[2022-05-15 23:51:07] [INFO ] Parsed PT model containing 1419 places and 1608 transitions in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 602 places and 0 transitions.
FORMULA AirplaneLD-PT-0200-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 413 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 1608/1608 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 814 transition count 1608
Discarding 398 places :
Symmetric choice reduction at 1 with 398 rule applications. Total rules 401 place count 416 transition count 1210
Iterating global reduction 1 with 398 rules applied. Total rules applied 799 place count 416 transition count 1210
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Iterating post reduction 1 with 398 rules applied. Total rules applied 1197 place count 416 transition count 812
Applied a total of 1197 rules in 50 ms. Remains 416 /817 variables (removed 401) and now considering 812/1608 (removed 796) transitions.
// Phase 1: matrix 812 rows 416 cols
[2022-05-15 23:51:08] [INFO ] Computed 1 place invariants in 46 ms
[2022-05-15 23:51:08] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 812 rows 416 cols
[2022-05-15 23:51:08] [INFO ] Computed 1 place invariants in 63 ms
[2022-05-15 23:51:09] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
// Phase 1: matrix 812 rows 416 cols
[2022-05-15 23:51:09] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 23:51:12] [INFO ] Dead Transitions using invariants and state equation in 3809 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 416/817 places, 812/1608 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/817 places, 812/1608 transitions.
Support contains 413 out of 416 places after structural reductions.
[2022-05-15 23:51:13] [INFO ] Flatten gal took : 106 ms
[2022-05-15 23:51:13] [INFO ] Flatten gal took : 70 ms
[2022-05-15 23:51:13] [INFO ] Input system was already deterministic with 812 transitions.
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 812 rows 416 cols
[2022-05-15 23:51:14] [INFO ] Computed 1 place invariants in 16 ms
[2022-05-15 23:51:14] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:51:14] [INFO ] After 220ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2022-05-15 23:51:14] [INFO ] After 357ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 212 ms.
[2022-05-15 23:51:15] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 4 properties in 10 ms.
Computed a total of 416 stabilizing places and 812 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 416 transition count 812
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' '!((G(G(p0))||(F(X(!p0))&&F(p1))))'
Support contains 4 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 397 places :
Symmetric choice reduction at 0 with 397 rule applications. Total rules 397 place count 19 transition count 415
Iterating global reduction 0 with 397 rules applied. Total rules applied 794 place count 19 transition count 415
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 0 with 397 rules applied. Total rules applied 1191 place count 19 transition count 18
Applied a total of 1191 rules in 16 ms. Remains 19 /416 variables (removed 397) and now considering 18/812 (removed 794) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:51:15] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:51:15] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:51:15] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/416 places, 18/812 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/416 places, 18/812 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1)), p0, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s5 1)), p1:(AND (GEQ s0 1) (GEQ s2 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]]
Stuttering criterion allowed to conclude after 21 steps with 3 reset in 2 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-00 finished in 518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(p0))||F(p1)))))'
Support contains 201 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 199 place count 217 transition count 613
Iterating global reduction 0 with 199 rules applied. Total rules applied 398 place count 217 transition count 613
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 597 place count 217 transition count 414
Applied a total of 597 rules in 12 ms. Remains 217 /416 variables (removed 199) and now considering 414/812 (removed 398) transitions.
// Phase 1: matrix 414 rows 217 cols
[2022-05-15 23:51:16] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-15 23:51:16] [INFO ] Implicit Places using invariants in 77 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 216/416 places, 414/812 transitions.
Applied a total of 0 rules in 2 ms. Remains 216 /216 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 216/416 places, 414/812 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(LT s215 1), p1:(OR (AND (GEQ s5 1) (GEQ s135 1)) (AND (GEQ s5 1) (GEQ s200 1)) (AND (GEQ s5 1) (GEQ s70 1)) (AND (GEQ s5 1) (GEQ s143 1)) (AND (GEQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 13405 reset in 1041 ms.
Product exploration explored 100000 steps with 13416 reset in 893 ms.
Computed a total of 216 stabilizing places and 414 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 216 transition count 414
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 (NOT p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 547 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0200-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLFireability-02 finished in 2841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(X(X(G(p0))))||p1)))))'
Support contains 103 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 298 places :
Symmetric choice reduction at 0 with 298 rule applications. Total rules 298 place count 118 transition count 514
Iterating global reduction 0 with 298 rules applied. Total rules applied 596 place count 118 transition count 514
Ensure Unique test removed 298 transitions
Reduce isomorphic transitions removed 298 transitions.
Iterating post reduction 0 with 298 rules applied. Total rules applied 894 place count 118 transition count 216
Applied a total of 894 rules in 21 ms. Remains 118 /416 variables (removed 298) and now considering 216/812 (removed 596) transitions.
// Phase 1: matrix 216 rows 118 cols
[2022-05-15 23:51:18] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:51:19] [INFO ] Implicit Places using invariants in 60 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/416 places, 216/812 transitions.
Graph (complete) has 115 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 116 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 115 transition count 214
Applied a total of 3 rules in 17 ms. Remains 115 /117 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 115 cols
[2022-05-15 23:51:19] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 23:51:19] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 214 rows 115 cols
[2022-05-15 23:51:19] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-15 23:51:19] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/416 places, 214/812 transitions.
Finished structural reductions, in 2 iterations. Remains : 115/416 places, 214/812 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s111 1), p1:(AND (GEQ s112 1) (OR (GEQ s113 1) (AND (GEQ s9 1) (GEQ s32 1)) (AND (GEQ s9 1) (GEQ s97 1)) (AND (GEQ s9 1) (GEQ s36 1)) (AND (GEQ s9 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14427 reset in 429 ms.
Product exploration explored 100000 steps with 14393 reset in 566 ms.
Computed a total of 115 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 115 transition count 214
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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 398 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0200-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLFireability-03 finished in 1835 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 201 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 199 place count 217 transition count 613
Iterating global reduction 0 with 199 rules applied. Total rules applied 398 place count 217 transition count 613
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 597 place count 217 transition count 414
Applied a total of 597 rules in 5 ms. Remains 217 /416 variables (removed 199) and now considering 414/812 (removed 398) transitions.
// Phase 1: matrix 414 rows 217 cols
[2022-05-15 23:51:20] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-15 23:51:20] [INFO ] Implicit Places using invariants in 69 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 216/416 places, 414/812 transitions.
Applied a total of 0 rules in 2 ms. Remains 216 /216 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 216/416 places, 414/812 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s215 1), p1:(OR (AND (GEQ s5 1) (GEQ s135 1)) (AND (GEQ s5 1) (GEQ s200 1)) (AND (GEQ s5 1) (GEQ s70 1)) (AND (GEQ s5 1) (GEQ s143 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 49 reset in 3 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-04 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p1)||G(p2)||p0))||X(G(X(p2))))))'
Support contains 4 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 397 places :
Symmetric choice reduction at 0 with 397 rule applications. Total rules 397 place count 19 transition count 415
Iterating global reduction 0 with 397 rules applied. Total rules applied 794 place count 19 transition count 415
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 0 with 397 rules applied. Total rules applied 1191 place count 19 transition count 18
Applied a total of 1191 rules in 14 ms. Remains 19 /416 variables (removed 397) and now considering 18/812 (removed 794) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:51:21] [INFO ] Implicit Places using invariants in 34 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/416 places, 18/812 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/416 places, 18/812 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s14 1), p2:(AND (GEQ s2 1) (GEQ s4 1)), p0:(OR (GEQ s15 1) (GEQ s15 1) (GEQ s15 1) (GEQ s15 1) (GEQ s15 1) (GEQ s15 1) (GEQ s15 1) (GEQ s15 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-06 finished in 364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 101 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 299 places :
Symmetric choice reduction at 0 with 299 rule applications. Total rules 299 place count 117 transition count 513
Iterating global reduction 0 with 299 rules applied. Total rules applied 598 place count 117 transition count 513
Ensure Unique test removed 299 transitions
Reduce isomorphic transitions removed 299 transitions.
Iterating post reduction 0 with 299 rules applied. Total rules applied 897 place count 117 transition count 214
Applied a total of 897 rules in 7 ms. Remains 117 /416 variables (removed 299) and now considering 214/812 (removed 598) transitions.
// Phase 1: matrix 214 rows 117 cols
[2022-05-15 23:51:21] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:51:21] [INFO ] Implicit Places using invariants in 108 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/416 places, 214/812 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/416 places, 214/812 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s114 1), p1:(OR (AND (GEQ s8 1) (GEQ s32 1)) (AND (GEQ s8 1) (GEQ s93 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s8 1) (GEQ s89 1)) (AND (GEQ s8 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-07 finished in 337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(F((F(p0)&&F(p1)))))))'
Support contains 4 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 397 places :
Symmetric choice reduction at 0 with 397 rule applications. Total rules 397 place count 19 transition count 415
Iterating global reduction 0 with 397 rules applied. Total rules applied 794 place count 19 transition count 415
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 0 with 397 rules applied. Total rules applied 1191 place count 19 transition count 18
Applied a total of 1191 rules in 6 ms. Remains 19 /416 variables (removed 397) and now considering 18/812 (removed 794) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:51:21] [INFO ] Implicit Places using invariants in 43 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/416 places, 18/812 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/416 places, 18/812 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s14 1), p0:(AND (GEQ s15 1) (OR (LT s2 1) (LT s4 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-08 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1)&&!p1)))'
Support contains 3 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 397 places :
Symmetric choice reduction at 0 with 397 rule applications. Total rules 397 place count 19 transition count 415
Iterating global reduction 0 with 397 rules applied. Total rules applied 794 place count 19 transition count 415
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 0 with 397 rules applied. Total rules applied 1191 place count 19 transition count 18
Applied a total of 1191 rules in 6 ms. Remains 19 /416 variables (removed 397) and now considering 18/812 (removed 794) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:51:21] [INFO ] Implicit Places using invariants in 28 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/416 places, 18/812 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/416 places, 18/812 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, true, true, (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s15 1), p0:(AND (OR (LT s2 1) (LT s3 1)) (LT s15 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 4 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-09 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Graph (complete) has 416 edges and 416 vertex of which 314 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.2 ms
Discarding 102 places :
Also discarding 200 output transitions
Drop transitions removed 200 transitions
Discarding 297 places :
Symmetric choice reduction at 0 with 297 rule applications. Total rules 298 place count 17 transition count 315
Iterating global reduction 0 with 297 rules applied. Total rules applied 595 place count 17 transition count 315
Ensure Unique test removed 297 transitions
Reduce isomorphic transitions removed 297 transitions.
Iterating post reduction 0 with 297 rules applied. Total rules applied 892 place count 17 transition count 18
Applied a total of 892 rules in 11 ms. Remains 17 /416 variables (removed 399) and now considering 18/812 (removed 794) transitions.
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 23:51:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants in 48 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/416 places, 18/812 transitions.
Graph (complete) has 15 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 16
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 14 cols
[2022-05-15 23:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 16 rows 14 cols
[2022-05-15 23:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/416 places, 16/812 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/416 places, 16/812 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s9 1)), p1:(OR (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-10 finished in 248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(((p0 U (G(p1) U p2))||p3))))))'
Support contains 6 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 396 places :
Symmetric choice reduction at 0 with 396 rule applications. Total rules 396 place count 20 transition count 416
Iterating global reduction 0 with 396 rules applied. Total rules applied 792 place count 20 transition count 416
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 0 with 396 rules applied. Total rules applied 1188 place count 20 transition count 20
Applied a total of 1188 rules in 11 ms. Remains 20 /416 variables (removed 396) and now considering 20/812 (removed 792) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:51:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants in 26 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/416 places, 20/812 transitions.
Graph (complete) has 17 edges and 19 vertex of which 18 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
Applied a total of 1 rules in 0 ms. Remains 18 /19 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 18 cols
[2022-05-15 23:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 19 rows 18 cols
[2022-05-15 23:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/416 places, 19/812 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/416 places, 19/812 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p3 p2 p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p3 p1) (AND p2 p1) (AND p1 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={1} source=2 dest: 4}], [{ cond=(OR (AND p3 (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p1) p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={1} source=4 dest: 2}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p3:(GEQ s13 1), p2:(AND (GEQ s10 1) (GEQ s12 1)), p1:(GEQ s16 1), p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-11 finished in 419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(G(X((X(F(X(p0)))||X(p1)))))))))'
Support contains 4 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 395 places :
Symmetric choice reduction at 0 with 395 rule applications. Total rules 395 place count 21 transition count 417
Iterating global reduction 0 with 395 rules applied. Total rules applied 790 place count 21 transition count 417
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 395 transitions.
Iterating post reduction 0 with 395 rules applied. Total rules applied 1185 place count 21 transition count 22
Applied a total of 1185 rules in 12 ms. Remains 21 /416 variables (removed 395) and now considering 22/812 (removed 790) transitions.
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 23:51:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants in 28 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/416 places, 22/812 transitions.
Graph (complete) has 19 edges and 20 vertex of which 19 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 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 18 transition count 20
Applied a total of 3 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-15 23:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-15 23:51:22] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:51:22] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/416 places, 20/812 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/416 places, 20/812 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s6 1) (LT s8 1)), p0:(AND (GEQ s10 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14422 reset in 102 ms.
Product exploration explored 100000 steps with 14415 reset in 102 ms.
Computed a total of 18 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 20
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 p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0200-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLFireability-12 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((F(p0)&&(G(p1)||X(F(p2))))))))'
Support contains 5 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 397 places :
Symmetric choice reduction at 0 with 397 rule applications. Total rules 397 place count 19 transition count 415
Iterating global reduction 0 with 397 rules applied. Total rules applied 794 place count 19 transition count 415
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 0 with 397 rules applied. Total rules applied 1191 place count 19 transition count 18
Applied a total of 1191 rules in 6 ms. Remains 19 /416 variables (removed 397) and now considering 18/812 (removed 794) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:51:23] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:51:23] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:51:23] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/416 places, 18/812 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/416 places, 18/812 transitions.
Stuttering acceptance computed with spot in 497 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s2 1)), p1:(OR (LT s3 1) (LT s5 1)), p2:(LT s18 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]]
Product exploration explored 100000 steps with 14407 reset in 100 ms.
Product exploration explored 100000 steps with 14388 reset in 105 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
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 (NOT p2)), true, (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0200-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLFireability-13 finished in 1191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U ((G(p1) U p2)&&p3))))'
Support contains 5 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 812/812 transitions.
Discarding 397 places :
Symmetric choice reduction at 0 with 397 rule applications. Total rules 397 place count 19 transition count 415
Iterating global reduction 0 with 397 rules applied. Total rules applied 794 place count 19 transition count 415
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 0 with 397 rules applied. Total rules applied 1191 place count 19 transition count 18
Applied a total of 1191 rules in 9 ms. Remains 19 /416 variables (removed 397) and now considering 18/812 (removed 794) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:24] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 23:51:24] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:51:24] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:51:24] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:51:24] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/416 places, 18/812 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/416 places, 18/812 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=1 dest: 6}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0} source=1 dest: 7}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p1) p0) (AND (NOT p2) (NOT p1) p0)), acceptance={0} source=6 dest: 1}, { cond=(OR (AND (NOT p3) p1 p0) (AND (NOT p2) p1 p0)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(GEQ s16 1), p0:(OR (GEQ s14 1) (AND (GEQ s1 1) (GEQ s2 1))), p2:(AND (GEQ s1 1) (GEQ s2 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-14 finished in 660 ms.
All properties solved by simple procedures.
Total runtime 17603 ms.

BK_STOP 1652658685721

--------------------
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-0200"
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-0200, 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-165245689100276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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