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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 158K Apr 29 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 567K Apr 29 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 183K Apr 29 21:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 29 21:04 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 171K May 9 07:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 445K May 9 07:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 77K May 9 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 316K May 9 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 9 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K 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 2.2M 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-0500-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652658722559

Running Version 202205111006
[2022-05-15 23:52:04] [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:52:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:52:05] [INFO ] Load time of PNML (sax parser for PT used): 446 ms
[2022-05-15 23:52:05] [INFO ] Transformed 3519 places.
[2022-05-15 23:52:05] [INFO ] Transformed 4008 transitions.
[2022-05-15 23:52:05] [INFO ] Parsed PT model containing 3519 places and 4008 transitions in 680 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 182 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 1502 places and 0 transitions.
FORMULA AirplaneLD-PT-0500-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 517 out of 2017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2017/2017 places, 4008/4008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2014 transition count 4008
Discarding 1492 places :
Symmetric choice reduction at 1 with 1492 rule applications. Total rules 1495 place count 522 transition count 2516
Iterating global reduction 1 with 1492 rules applied. Total rules applied 2987 place count 522 transition count 2516
Ensure Unique test removed 1492 transitions
Reduce isomorphic transitions removed 1492 transitions.
Iterating post reduction 1 with 1492 rules applied. Total rules applied 4479 place count 522 transition count 1024
Applied a total of 4479 rules in 147 ms. Remains 522 /2017 variables (removed 1495) and now considering 1024/4008 (removed 2984) transitions.
// Phase 1: matrix 1024 rows 522 cols
[2022-05-15 23:52:06] [INFO ] Computed 1 place invariants in 110 ms
[2022-05-15 23:52:06] [INFO ] Implicit Places using invariants in 492 ms returned []
// Phase 1: matrix 1024 rows 522 cols
[2022-05-15 23:52:06] [INFO ] Computed 1 place invariants in 88 ms
[2022-05-15 23:52:08] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2568 ms to find 0 implicit places.
// Phase 1: matrix 1024 rows 522 cols
[2022-05-15 23:52:08] [INFO ] Computed 1 place invariants in 36 ms
[2022-05-15 23:52:09] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 522/2017 places, 1024/4008 transitions.
Finished structural reductions, in 1 iterations. Remains : 522/2017 places, 1024/4008 transitions.
Support contains 517 out of 522 places after structural reductions.
[2022-05-15 23:52:09] [INFO ] Flatten gal took : 173 ms
[2022-05-15 23:52:09] [INFO ] Flatten gal took : 93 ms
[2022-05-15 23:52:10] [INFO ] Input system was already deterministic with 1024 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 818 ms. (steps per millisecond=12 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1024 rows 522 cols
[2022-05-15 23:52:11] [INFO ] Computed 1 place invariants in 43 ms
[2022-05-15 23:52:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:52:11] [INFO ] After 407ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:52:12] [INFO ] After 495ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 174 ms.
[2022-05-15 23:52:12] [INFO ] After 859ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 2 ms.
Computed a total of 522 stabilizing places and 1024 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 522 transition count 1024
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(F(p0)))'
Support contains 250 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 254 places :
Symmetric choice reduction at 0 with 254 rule applications. Total rules 254 place count 268 transition count 770
Iterating global reduction 0 with 254 rules applied. Total rules applied 508 place count 268 transition count 770
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 0 with 254 rules applied. Total rules applied 762 place count 268 transition count 516
Applied a total of 762 rules in 74 ms. Remains 268 /522 variables (removed 254) and now considering 516/1024 (removed 508) transitions.
// Phase 1: matrix 516 rows 268 cols
[2022-05-15 23:52:12] [INFO ] Computed 1 place invariants in 24 ms
[2022-05-15 23:52:12] [INFO ] Implicit Places using invariants in 127 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 267/522 places, 516/1024 transitions.
Graph (complete) has 265 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 266 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 265 transition count 514
Applied a total of 3 rules in 12 ms. Remains 265 /267 variables (removed 2) and now considering 514/516 (removed 2) transitions.
// Phase 1: matrix 514 rows 265 cols
[2022-05-15 23:52:12] [INFO ] Computed 0 place invariants in 13 ms
[2022-05-15 23:52:13] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 514 rows 265 cols
[2022-05-15 23:52:13] [INFO ] Computed 0 place invariants in 27 ms
[2022-05-15 23:52:13] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 265/522 places, 514/1024 transitions.
Finished structural reductions, in 2 iterations. Remains : 265/522 places, 514/1024 transitions.
Stuttering acceptance computed with spot in 706 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s9 1) (LT s30 1)) (OR (LT s9 1) (LT s95 1)) (OR (LT s9 1) (LT s160 1)) (OR (LT s9 1) (LT s225 1)) (OR (LT s9 1) (LT s22 1)) (OR (LT s9 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14378 reset in 1639 ms.
Product exploration explored 100000 steps with 14402 reset in 1387 ms.
Computed a total of 265 stabilizing places and 514 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 265 transition count 514
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0500-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-01 finished in 5608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!(!X(p0) U (F(p2)||p1)))&&p0)))'
Support contains 4 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 503 places :
Symmetric choice reduction at 0 with 503 rule applications. Total rules 503 place count 19 transition count 521
Iterating global reduction 0 with 503 rules applied. Total rules applied 1006 place count 19 transition count 521
Ensure Unique test removed 503 transitions
Reduce isomorphic transitions removed 503 transitions.
Iterating post reduction 0 with 503 rules applied. Total rules applied 1509 place count 19 transition count 18
Applied a total of 1509 rules in 11 ms. Remains 19 /522 variables (removed 503) and now considering 18/1024 (removed 1006) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:52:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:18] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:52:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:52:19] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:52:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:52:19] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/522 places, 18/1024 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/522 places, 18/1024 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p0) p1 p2), (OR (NOT p0) p1 p2), (OR p1 p2)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR p2 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s0 1) (GEQ s2 1)), p0:(GEQ s15 1), p1:(OR (GEQ s17 1) (GEQ s17 1) (GEQ s17 1) (GEQ s17 1) (GEQ s17 1) (GEQ s17 1) (GEQ s17 1) (GEQ s17 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-02 finished in 1299 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Graph (complete) has 522 edges and 522 vertex of which 1 are kept as prefixes of interest. Removing 521 places using SCC suffix rule.1 ms
Discarding 521 places :
Also discarding 1019 output transitions
Drop transitions removed 1019 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1 transition count 1
Applied a total of 5 rules in 4 ms. Remains 1 /522 variables (removed 521) and now considering 1/1024 (removed 1023) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:52:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:52:19] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:52:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:19] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-15 23:52:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:52:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:19] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/522 places, 1/1024 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/522 places, 1/1024 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT 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 38 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0500-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-03 finished in 619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((X(p0) U F(X(p0)))))))'
Support contains 2 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Graph (complete) has 522 edges and 522 vertex of which 8 are kept as prefixes of interest. Removing 514 places using SCC suffix rule.1 ms
Discarding 514 places :
Also discarding 1016 output transitions
Drop transitions removed 1016 transitions
Applied a total of 1 rules in 3 ms. Remains 8 /522 variables (removed 514) and now considering 8/1024 (removed 1016) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:52:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:52:20] [INFO ] Implicit Places using invariants in 44 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/522 places, 8/1024 transitions.
Graph (complete) has 5 edges and 7 vertex of which 6 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 10 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 23:52:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:20] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 23:52:20] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 23:52:20] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/522 places, 7/1024 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/522 places, 7/1024 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-04 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(p0)))))'
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Graph (complete) has 522 edges and 522 vertex of which 1 are kept as prefixes of interest. Removing 521 places using SCC suffix rule.1 ms
Discarding 521 places :
Also discarding 1022 output transitions
Drop transitions removed 1022 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 5 ms. Remains 1 /522 variables (removed 521) and now considering 1/1024 (removed 1023) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:52:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:20] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:52:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:52:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-15 23:52:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:52:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:52:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/522 places, 1/1024 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/522 places, 1/1024 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0500-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-05 finished in 473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(X(F(p1)))||p0)))))'
Support contains 254 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 252 places :
Symmetric choice reduction at 0 with 252 rule applications. Total rules 252 place count 270 transition count 772
Iterating global reduction 0 with 252 rules applied. Total rules applied 504 place count 270 transition count 772
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 0 with 252 rules applied. Total rules applied 756 place count 270 transition count 520
Applied a total of 756 rules in 32 ms. Remains 270 /522 variables (removed 252) and now considering 520/1024 (removed 504) transitions.
// Phase 1: matrix 520 rows 270 cols
[2022-05-15 23:52:21] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-15 23:52:21] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 520 rows 270 cols
[2022-05-15 23:52:21] [INFO ] Computed 1 place invariants in 11 ms
[2022-05-15 23:52:21] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2022-05-15 23:52:21] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 520 rows 270 cols
[2022-05-15 23:52:21] [INFO ] Computed 1 place invariants in 11 ms
[2022-05-15 23:52:21] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 270/522 places, 520/1024 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/522 places, 520/1024 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s22 1)) (AND (GEQ s12 1) (GEQ s87 1)) (AND (GEQ s12 1) (GEQ s152 1)) (AND (GEQ s12 1) (GEQ s217 1)) (AND (GEQ s12 1) (GEQ s14...], 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 12840 reset in 1989 ms.
Product exploration explored 100000 steps with 12866 reset in 2107 ms.
Computed a total of 270 stabilizing places and 520 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 270 transition count 520
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)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0500-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-06 finished in 5499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X((G(p0)&&F(p1))) U X(X(X(p2)))))'
Support contains 5 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 502 places :
Symmetric choice reduction at 0 with 502 rule applications. Total rules 502 place count 20 transition count 522
Iterating global reduction 0 with 502 rules applied. Total rules applied 1004 place count 20 transition count 522
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Iterating post reduction 0 with 502 rules applied. Total rules applied 1506 place count 20 transition count 20
Applied a total of 1506 rules in 23 ms. Remains 20 /522 variables (removed 502) and now considering 20/1024 (removed 1004) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:26] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:52:26] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:26] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/522 places, 20/1024 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/522 places, 20/1024 transitions.
Stuttering acceptance computed with spot in 614 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 (NOT p2)), p0, (AND p0 p1)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p0 p1), acceptance={} source=3 dest: 9}], [{ cond=p0, acceptance={} source=4 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=p0, acceptance={0} source=10 dest: 10}], [{ cond=(AND p0 p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s0 1) (GEQ s2 1)), p2:(AND (GEQ s6 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-08 finished in 839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(F(p1))||X(F(G(p2)))||p0))))'
Support contains 6 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 500 places :
Symmetric choice reduction at 0 with 500 rule applications. Total rules 500 place count 22 transition count 524
Iterating global reduction 0 with 500 rules applied. Total rules applied 1000 place count 22 transition count 524
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 1500 place count 22 transition count 24
Applied a total of 1500 rules in 8 ms. Remains 22 /522 variables (removed 500) and now considering 24/1024 (removed 1000) transitions.
// Phase 1: matrix 24 rows 22 cols
[2022-05-15 23:52:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:27] [INFO ] Implicit Places using invariants in 55 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/522 places, 24/1024 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/522 places, 24/1024 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s8 1))), p1:(LT s19 1), p2:(AND (GEQ s12 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21474 reset in 84 ms.
Product exploration explored 100000 steps with 21427 reset in 97 ms.
Computed a total of 21 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 24
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) (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 256 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0500-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-09 finished in 728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((G(p0) U X(p1)) U p2)) U X(p3)))'
Support contains 5 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 502 places :
Symmetric choice reduction at 0 with 502 rule applications. Total rules 502 place count 20 transition count 522
Iterating global reduction 0 with 502 rules applied. Total rules applied 1004 place count 20 transition count 522
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Iterating post reduction 0 with 502 rules applied. Total rules applied 1506 place count 20 transition count 20
Applied a total of 1506 rules in 25 ms. Remains 20 /522 variables (removed 502) and now considering 20/1024 (removed 1004) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:28] [INFO ] Implicit Places using invariants in 62 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/522 places, 20/1024 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/522 places, 20/1024 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p3), (NOT p3), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s2 1) (GEQ s3 1)), p2:(OR (AND (GEQ s2 1) (GEQ s3 1)) (AND (GEQ s2 1) (GEQ s4 1))), p0:(AND (GEQ s2 1) (GEQ s4 1)), p1:(AND (GEQ s8 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][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-0500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-10 finished in 455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(!(G(p1)||F(p2)))))'
Support contains 6 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 502 places :
Symmetric choice reduction at 0 with 502 rule applications. Total rules 502 place count 20 transition count 522
Iterating global reduction 0 with 502 rules applied. Total rules applied 1004 place count 20 transition count 522
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Iterating post reduction 0 with 502 rules applied. Total rules applied 1506 place count 20 transition count 20
Applied a total of 1506 rules in 11 ms. Remains 20 /522 variables (removed 502) and now considering 20/1024 (removed 1004) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:28] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:28] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/522 places, 20/1024 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/522 places, 20/1024 transitions.
Stuttering acceptance computed with spot in 666 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p1), p2, p1]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 1}, { cond=p2, acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s14 1)), p2:(AND (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 4 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-11 finished in 880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&G((X(X((p2 U G(p2))))||p1))))'
Support contains 7 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 502 places :
Symmetric choice reduction at 0 with 502 rule applications. Total rules 502 place count 20 transition count 522
Iterating global reduction 0 with 502 rules applied. Total rules applied 1004 place count 20 transition count 522
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Iterating post reduction 0 with 502 rules applied. Total rules applied 1506 place count 20 transition count 20
Applied a total of 1506 rules in 10 ms. Remains 20 /522 variables (removed 502) and now considering 20/1024 (removed 1004) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:29] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:52:29] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:52:29] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/522 places, 20/1024 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/522 places, 20/1024 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s3 1) (GEQ s4 1)) (AND (GEQ s6 1) (GEQ s8 1))), p0:(AND (GEQ s0 1) (GEQ s2 1)), p2:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-12 finished in 513 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(X(G(p0)))||G(p1)))))'
Support contains 3 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Graph (complete) has 522 edges and 522 vertex of which 8 are kept as prefixes of interest. Removing 514 places using SCC suffix rule.1 ms
Discarding 514 places :
Also discarding 1016 output transitions
Drop transitions removed 1016 transitions
Applied a total of 1 rules in 3 ms. Remains 8 /522 variables (removed 514) and now considering 8/1024 (removed 1016) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:52:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:29] [INFO ] Implicit Places using invariants in 63 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/522 places, 8/1024 transitions.
Graph (complete) has 5 edges and 7 vertex of which 6 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 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 23:52:29] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:29] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 23:52:29] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:29] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/522 places, 7/1024 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/522 places, 7/1024 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-13 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:(GEQ s4 1), p1:(OR (LT s1 1) (LT s3 1))], 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 25007 reset in 66 ms.
Product exploration explored 100000 steps with 25012 reset in 77 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 7
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 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 9 factoid took 338 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0500-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-13 finished in 783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 2 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 1024/1024 transitions.
Discarding 502 places :
Symmetric choice reduction at 0 with 502 rule applications. Total rules 502 place count 20 transition count 522
Iterating global reduction 0 with 502 rules applied. Total rules applied 1004 place count 20 transition count 522
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Iterating post reduction 0 with 502 rules applied. Total rules applied 1506 place count 20 transition count 20
Applied a total of 1506 rules in 14 ms. Remains 20 /522 variables (removed 502) and now considering 20/1024 (removed 1004) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:52:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:52:30] [INFO ] Implicit Places using invariants in 36 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/522 places, 20/1024 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/522 places, 20/1024 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s11 1) (LT s13 1)), p1:(OR (LT s11 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12612 reset in 143 ms.
Product exploration explored 100000 steps with 12620 reset in 87 ms.
Computed a total of 19 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 451 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 245 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 19 cols
[2022-05-15 23:52:31] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:31] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G p0)), (F (G p1)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 630 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 19 cols
[2022-05-15 23:52:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:32] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 20 rows 19 cols
[2022-05-15 23:52:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:33] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 19 cols
[2022-05-15 23:52:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:52:33] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 20/20 transitions.
Computed a total of 19 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 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 p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 107 steps, including 12 resets, run visited all 2 properties in 3 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 12593 reset in 118 ms.
Product exploration explored 100000 steps with 12595 reset in 150 ms.
Built C files in :
/tmp/ltsmin11609587284380584557
[2022-05-15 23:52:35] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11609587284380584557
Running compilation step : cd /tmp/ltsmin11609587284380584557;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin11609587284380584557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11609587284380584557;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15736301128879296509.hoa' '--buchi-type=spotba'
LTSmin run took 2859 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-0500-LTLFireability-15 finished in 7647 ms.
All properties solved by simple procedures.
Total runtime 33784 ms.

BK_STOP 1652658758802

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

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