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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 6.8K Apr 29 21:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 21:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 21:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 21:07 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 4.2K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 67K 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-COL-0200-LTLFireability-00
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-01
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-02
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-03
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-04
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-05
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-06
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-07
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-08
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-09
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-10
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-11
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-12
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-13
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-14
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652658209679

Running Version 202205111006
[2022-05-15 23:43:32] [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:43:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:43:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-15 23:43:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 23:43:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1029 ms
[2022-05-15 23:43:33] [INFO ] Detected 3 constant HL places corresponding to 602 PT places.
[2022-05-15 23:43:33] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 1419 PT places and 2412.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2022-05-15 23:43:33] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 5 ms.
[2022-05-15 23:43:33] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA AirplaneLD-COL-0200-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 3 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 39 steps, including 5 resets, run visited all 2 properties in 26 ms. (steps per millisecond=1 )
[2022-05-15 23:43:33] [INFO ] Flatten gal took : 16 ms
[2022-05-15 23:43:33] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:400) in guard (OR (GEQ $A 199) (EQ $A 399))introduces in Altitude(400) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:400) in guard (AND (LT $A 199) (NEQ $A 399))introduces in Altitude(400) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition Partition [nbSubs=2, partition=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 400 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 199) (EQ $A 399)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 199) (NEQ $A 399)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:200) in guard (OR (LEQ $S 99) (EQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:200) in guard (AND (GT $S 99) (NEQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:200) in guard (OR (LEQ $S 99) (EQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:200) in guard (AND (GT $S 99) (NEQ $S 199))introduces in Speed(200) partition with 2 elements
Sort wr.t. initial and guards Speed has partition Partition [nbSubs=2, partition=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 200 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 99) (EQ $S 199)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 99) (NEQ $S 199)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 99) (EQ $S 199)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 99) (NEQ $S 199)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2022-05-15 23:43:33] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 23 ms.
[2022-05-15 23:43:33] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:43:33] [INFO ] Reduced 1 identical enabling conditions.
Reduce places removed 6 places and 0 transitions.
FORMULA AirplaneLD-COL-0200-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0200-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0200-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Applied a total of 3 rules in 63 ms. Remains 20 /23 variables (removed 3) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:43:33] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-15 23:43:33] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:43:33] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:43:33] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:43:33] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 23:43:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 20/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 20/20 transitions.
Support contains 17 out of 20 places after structural reductions.
[2022-05-15 23:43:34] [INFO ] Flatten gal took : 5 ms
[2022-05-15 23:43:34] [INFO ] Flatten gal took : 4 ms
[2022-05-15 23:43:34] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 124 steps, including 15 resets, run visited all 13 properties in 34 ms. (steps per millisecond=3 )
FORMULA AirplaneLD-COL-0200-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 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).
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 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 6 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:34] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:43:34] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:43:34] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:43:34] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 18/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), p0, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-COL-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 s8 1) (LT s11 1)), p1:(AND (GEQ s9 1) (GEQ s12 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 16 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-00 finished in 599 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 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:35] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 23:43:35] [INFO ] Implicit Places using invariants in 54 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/20 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-COL-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 s1 1), p1:(AND (GEQ s7 1) (GEQ s13 1))], 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 12830 reset in 331 ms.
Product exploration explored 100000 steps with 12829 reset in 233 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 (NOT p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND 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 p0))
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-COL-0200-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0200-LTLFireability-02 finished in 1048 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 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:43:36] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:43:36] [INFO ] Implicit Places using invariants in 85 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/20 places, 20/20 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.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 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 18
Applied a total of 3 rules in 2 ms. Remains 17 /19 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 23:43:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:43:36] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 23:43:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:43:36] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/20 places, 18/20 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-COL-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 s3 1), p1:(AND (GEQ s2 1) (OR (GEQ s0 1) (AND (GEQ s5 1) (GEQ s15 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 14448 reset in 513 ms.
Product exploration explored 100000 steps with 14434 reset in 251 ms.
Computed a total of 17 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (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 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-COL-0200-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0200-LTLFireability-03 finished in 1370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:43:37] [INFO ] Implicit Places using invariants in 34 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/20 places, 18/20 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/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-COL-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 s1 1), p1:(AND (GEQ s7 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 4 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-04 finished in 197 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p0)||G(p1)||p2))||X(G(X(p1))))))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:43:37] [INFO ] Implicit Places using invariants in 47 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/20 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s8 1) (GEQ s10 1)), p2:(GEQ s2 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]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-06 finished in 315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:43:38] [INFO ] Implicit Places using invariants in 39 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/20 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-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 s0 1), p1:(AND (GEQ s6 1) (GEQ 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][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-07 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 18 edges and 20 vertex of which 1 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 18 output transitions
Drop transitions removed 18 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 1 ms. Remains 1 /20 variables (removed 19) and now considering 1/20 (removed 19) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:43:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:43:38] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:43:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:43:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 23:43:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:43:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:43:38] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/20 places, 1/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/20 places, 1/20 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-10 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:(LT s0 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 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 114 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 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-COL-0200-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0200-LTLFireability-10 finished in 561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(X(X(G(X(p1)))))&&p0))&&G(F(p2))))'
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:43:39] [INFO ] Implicit Places using invariants in 40 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/20 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 5}, { cond=p0, acceptance={0} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 7}, { cond=p0, acceptance={0} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 9}, { cond=p0, acceptance={0} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}, { cond=(AND p0 p1), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 7}, { cond=(AND p0 p1), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=10 dest: 9}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p2:(GEQ s0 1), p0:(AND (GEQ s6 1) (GEQ s16 1)), p1:(AND (GEQ s6 1) (GEQ s16 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, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-11 finished in 498 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(G(p0))))&&F(p1))))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 18 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /20 variables (removed 12) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:43:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:43:39] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:43:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:43:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-15 23:43:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:43:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:43:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/20 places, 8/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/20 places, 8/20 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-12 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1)), p1:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-12 finished in 218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 18 edges and 20 vertex of which 4 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 4 /20 variables (removed 16) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-15 23:43:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:43:39] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-15 23:43:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:43:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-15 23:43:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-15 23:43:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:43:39] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/20 places, 4/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/20 places, 4/20 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-13 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 s2 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 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-13 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((X(((G(p0)||p1)&&X(p2))) U G(p3))&&p2))))'
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:43:39] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:39] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 23:43:40] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:43:40] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:43:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 18/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 735 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3) p1 (NOT p0))]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p2 p3), acceptance={1} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p2 p3), acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={0} source=2 dest: 7}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={0} source=2 dest: 8}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=2 dest: 9}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 2}, { cond=p3, acceptance={1} source=3 dest: 3}, { cond=(NOT p3), acceptance={0, 1} source=3 dest: 3}, { cond=p3, acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 7}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=4 dest: 8}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 8}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 10}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={1} source=4 dest: 11}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=4 dest: 12}], [{ cond=(NOT p2), acceptance={0, 1} source=5 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p2 p3 (NOT p0)), acceptance={1} source=6 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p2 (NOT p3) p0), acceptance={0} source=6 dest: 7}, { cond=(AND p2 p3 p0), acceptance={} source=6 dest: 8}, { cond=(AND p2 (NOT p3) p0), acceptance={0} source=6 dest: 8}, { cond=(AND p2 p3 p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=7 dest: 13}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={1} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={1} source=8 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={0} source=8 dest: 7}, { cond=(AND p3 p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) p0), acceptance={0} source=8 dest: 8}, { cond=(AND p3 p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={0, 1} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={1} source=9 dest: 10}, { cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={1} source=9 dest: 11}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=9 dest: 12}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={0} source=9 dest: 13}, { cond=(AND (NOT p2) p3 p1 p0), acceptance={} source=9 dest: 14}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=10 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=10 dest: 2}, { cond=(AND p2 p3), acceptance={1} source=10 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=10 dest: 3}, { cond=(AND p2 p3), acceptance={1} source=10 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={1} source=10 dest: 10}], [{ cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={0, 1} source=11 dest: 1}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={1} source=11 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 1} source=12 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=12 dest: 2}, { cond=(AND p2 p3 (NOT p0)), acceptance={1} source=12 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=12 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={1} source=12 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=12 dest: 6}, { cond=(AND p2 (NOT p3) p0), acceptance={0} source=12 dest: 7}, { cond=(AND p2 p3 p0), acceptance={} source=12 dest: 8}, { cond=(AND p2 (NOT p3) p0), acceptance={0} source=12 dest: 8}, { cond=(AND p2 p3 p0), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={1} source=12 dest: 10}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=13 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=13 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={0, 1} source=14 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={0} source=14 dest: 6}, { cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={1} source=14 dest: 10}, { cond=(AND (NOT p2) p3 p1 p0), acceptance={} source=14 dest: 12}]], initial=0, aps=[p2:(GEQ s1 1), p3:(AND (GEQ s6 1) (GEQ s17 1)), p1:(AND (GEQ s9 1) (GEQ s13 1)), p0:(AND (GEQ s7 1) (GEQ s14 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-14 finished in 937 ms.
All properties solved by simple procedures.
Total runtime 8764 ms.

BK_STOP 1652658221218

--------------------
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-COL-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-COL-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-165245689000204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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