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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.6K Apr 29 20:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 20:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 20:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 20:42 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 27K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:01 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 40K 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-0010-LTLFireability-00
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-01
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-02
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-03
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-04
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-05
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-06
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-07
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-08
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-09
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-10
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-11
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-12
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-13
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-14
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652657883637

Running Version 202205111006
[2022-05-15 23:38:05] [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:38:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:38:05] [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:38:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 23:38:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 566 ms
[2022-05-15 23:38:05] [INFO ] Detected 3 constant HL places corresponding to 32 PT places.
[2022-05-15 23:38:05] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 89 PT places and 132.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-15 23:38:05] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 5 ms.
[2022-05-15 23:38:05] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA AirplaneLD-COL-0010-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0010-LTLFireability-10 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 5 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 80 steps, including 9 resets, run visited all 7 properties in 19 ms. (steps per millisecond=4 )
[2022-05-15 23:38:05] [INFO ] Flatten gal took : 13 ms
[2022-05-15 23:38:05] [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:20) in guard (OR (GEQ $A 9) (EQ $A 19))introduces in Altitude(20) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:20) in guard (AND (LT $A 9) (NEQ $A 19))introduces in Altitude(20) 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 20 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 9) (EQ $A 19)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 9) (NEQ $A 19)) -> (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:10) in guard (OR (LEQ $S 4) (EQ $S 9))introduces in Speed(10) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:10) in guard (AND (GT $S 4) (NEQ $S 9))introduces in Speed(10) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:10) in guard (OR (LEQ $S 4) (EQ $S 9))introduces in Speed(10) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:10) in guard (AND (GT $S 4) (NEQ $S 9))introduces in Speed(10) partition with 2 elements
Sort wr.t. initial and guards Speed has partition Partition [nbSubs=2, partition=[1, 1, 1, 1, 1, 0, 0, 0, 0, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 10 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 4) (EQ $S 9)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 4) (NEQ $S 9)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 4) (EQ $S 9)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 4) (NEQ $S 9)) -> (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:38:05] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 11 ms.
[2022-05-15 23:38:05] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2022-05-15 23:38:05] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:05] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:05] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
[2022-05-15 23:38:06] [INFO ] Reduced 1 identical enabling conditions.
Reduce places removed 6 places and 0 transitions.
Support contains 18 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 10 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:38:06] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-15 23:38:06] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:38:06] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 23:38:06] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:38:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:06] [INFO ] Dead Transitions using invariants and state equation in 583 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 18 out of 20 places after structural reductions.
[2022-05-15 23:38:06] [INFO ] Flatten gal took : 4 ms
[2022-05-15 23:38:06] [INFO ] Flatten gal took : 3 ms
[2022-05-15 23:38:06] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 776 steps, including 97 resets, run visited all 18 properties in 63 ms. (steps per millisecond=12 )
FORMULA AirplaneLD-COL-0010-LTLFireability-14 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' '!((X(X((G(p0)&&F(p1))))&&X(p0)))'
Support contains 2 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 16 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:38:07] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-15 23:38:07] [INFO ] Implicit Places using invariants in 63 ms returned [9]
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 : 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 379 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s3 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-00 finished in 536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)||(F(p3)&&p2))))'
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 2 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:38:08] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:38:08] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:38:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:38:08] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:38:08] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 20/20 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p3), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), p1, (AND p1 (NOT p3))]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(OR (LT s5 1) (LT s19 1)), p1:(AND (GEQ s9 1) (GEQ s13 1)), p2:(AND (OR (LT s5 1) (LT s19 1)) (OR (LT s9 1) (LT s12 1))), p0:(AND (GEQ s9 1) (GEQ s12 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 42211 reset in 350 ms.
Product exploration explored 100000 steps with 42129 reset in 279 ms.
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).
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 p3 (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (F (G p3)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 742 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Finished random walk after 20 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p3 (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (F (G p3)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p2) p0)), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 12 factoid took 717 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 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:38:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:11] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:38:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:11] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:38:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 20/20 transitions.
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).
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 p2 (NOT p0) (NOT p1)), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 375 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Finished random walk after 20 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p0)), (F p1)]
Knowledge based reduction with 4 factoid took 321 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Product exploration explored 100000 steps with 42378 reset in 87 ms.
Product exploration explored 100000 steps with 42210 reset in 131 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), 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 5 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2022-05-15 23:38:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:38:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:13] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 20/20 transitions.
Product exploration explored 100000 steps with 42163 reset in 172 ms.
Product exploration explored 100000 steps with 42164 reset in 173 ms.
Built C files in :
/tmp/ltsmin18310687259429522262
[2022-05-15 23:38:13] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18310687259429522262
Running compilation step : cd /tmp/ltsmin18310687259429522262;'/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 272 ms.
Running link step : cd /tmp/ltsmin18310687259429522262;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin18310687259429522262;'/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/stateBased10587805839107011138.hoa' '--buchi-type=spotba'
LTSmin run took 274 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-COL-0010-LTLFireability-02 finished in 6184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((p0 U X(X(!(X(p1) U p2))))))))'
Support contains 5 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:38:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:14] [INFO ] Implicit Places using invariants in 35 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 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 668 ms :[p2, p2, p2, p2, p2, p2, true, (AND p2 p1), p2, p2, (AND p2 p1), (AND p1 p2)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 8}, { cond=p0, acceptance={} source=4 dest: 9}], [{ cond=p2, acceptance={} source=5 dest: 6}, { cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 5}, { cond=(NOT p2), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 8}, { cond=(AND p0 p2), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 11}], [{ cond=(AND p2 p1), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 7}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 8}, { cond=(AND p0 p2 p1), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s10 1)), p2:(GEQ s0 1), p1:(OR (GEQ s0 1) (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, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 2 reset in 1 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-03 finished in 735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(F(X(p1)))&&p2)))'
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 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:38:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:38:15] [INFO ] Implicit Places using invariants in 74 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/20 places, 20/20 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(GEQ s1 1), p0:(AND (GEQ s7 1) (GEQ s14 1)), p1:(AND (GEQ s5 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-04 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(((p2 U (p3 U p4))&&p1))&&p0)))))'
Support contains 8 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 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 7 ms. Remains 16 /20 variables (removed 4) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-15 23:38:15] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:38:15] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-15 23:38:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:15] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-15 23:38:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-15 23:38:15] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:38:15] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 16/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 16/20 transitions.
Stuttering acceptance computed with spot in 567 ms :[(OR (NOT p4) (NOT p1) (NOT p0)), (OR (NOT p4) (NOT p1) (NOT p0)), (NOT p4), (OR (NOT p1) (NOT p4)), (NOT p4), (OR (AND (NOT p1) p2 (NOT p4)) (AND p2 (NOT p3) (NOT p4)))]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p4) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p4) p3 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p4) p2), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p1 p4) (AND p0 p1 p3) (AND p0 p1 p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p4) p3 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p4) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (NOT p1) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p4) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 p4) (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p4) p3 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p4) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p4) p3) (AND (NOT p1) (NOT p4) p3) (AND (NOT p4) p3 (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p4) p3 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p3 p2), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p4) p3 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s15 1)), p1:(AND (GEQ s6 1) (GEQ s9 1)), p4:(AND (GEQ s7 1) (GEQ s11 1)), p3:(AND (GEQ s4 1) (GEQ s15 1)), p2:(AND (GEQ s5 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-05 finished in 771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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.
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:38:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:16] [INFO ] Implicit Places using invariants in 38 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 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 4 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:38:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:38:16] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 23:38:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:38:16] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 94 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 53 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s15 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-06 finished in 213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((F(p1) U p2)&&X(p0))))'
Support contains 5 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 2 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:38:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:16] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:16] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:16] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-15 23:38:16] [INFO ] Dead Transitions using invariants and state equation in 69 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 546 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) p2 (NOT p0)), (NOT p2), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s14 1)), p1:(AND (GEQ s9 1) (GEQ s12 1)), p0:(AND (GEQ s9 1) (GEQ s13 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 3 reset in 0 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-07 finished in 755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(X(X(p0)))||G(!p1)) U (p2 U p1))))'
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 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:38:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:17] [INFO ] Implicit Places using invariants in 723 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 725 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/20 places, 20/20 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p1), (NOT p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s13 1)), p2:(AND (GEQ s5 1) (GEQ s18 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 46 steps with 6 reset in 0 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-08 finished in 1138 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(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 2 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:38:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:18] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:18] [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 18 rows 19 cols
[2022-05-15 23:38:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:18] [INFO ] Dead Transitions using invariants and state equation in 64 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 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1) (GEQ s12 1)), p1:(OR (LT s9 1) (LT s12 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 23 steps with 2 reset in 1 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-09 finished in 378 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.
Applied a total of 0 rules in 1 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:38:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:18] [INFO ] Implicit Places using invariants in 69 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 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.7 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 10 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:38:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:38:18] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 23:38:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:38:18] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
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 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-11 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 s5 1) (GEQ s16 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 5 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLFireability-11 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(X(G(X(p0)))))||X(p0)))))'
Support contains 1 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 2 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:38:18] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-15 23:38:18] [INFO ] Implicit Places using invariants in 42 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 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 3 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 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s0 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]]
Product exploration explored 100000 steps with 19186 reset in 137 ms.
Product exploration explored 100000 steps with 19221 reset in 235 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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-COL-0010-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0010-LTLFireability-12 finished in 769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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.0 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 2 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:38:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:38:19] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:38:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:38:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-15 23:38:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:38:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:38:19] [INFO ] Dead Transitions using invariants and state equation in 25 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 54 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-13 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 51 ms.
Product exploration explored 100000 steps with 50000 reset in 112 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 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-COL-0010-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0010-LTLFireability-13 finished in 528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U !(X((F(p0) U p1)) U (p1 U p2))))))'
Support contains 5 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:38:20] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-15 23:38:20] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:20] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:20] [INFO ] Dead Transitions using invariants and state equation in 42 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 613 ms :[p2, p2, p2, (NOT p0), (AND p1 p2), (AND (NOT p1) p2), (AND p2 p0 p1), (AND p2 p0 (NOT p1)), (AND p0 p2)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={1, 2} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=6 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={2} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={2} source=6 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=6 dest: 8}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=7 dest: 8}], [{ cond=(AND p2 p0), acceptance={0, 1, 2} source=8 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={1, 2} source=8 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=8 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={2} source=8 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={0, 2} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s17 1)), p0:(AND (GEQ s9 1) (GEQ s13 1)), p1:(AND (GEQ s9 1) (GEQ s12 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13595 reset in 234 ms.
Product exploration explored 100000 steps with 13562 reset in 183 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 743 ms. Reduced automaton from 9 states, 35 edges and 3 AP to 9 states, 35 edges and 3 AP.
Stuttering acceptance computed with spot in 636 ms :[p2, p2, p2, (NOT p0), (AND p1 p2), (AND (NOT p1) p2), (AND p2 p0 p1), (AND p2 p0 (NOT p1)), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 1249 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 17) seen :11
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 261 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 262 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:23] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:38:23] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:2
[2022-05-15 23:38:23] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:38:23] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND p2 (NOT p1) p0))), (G (NOT (AND p2 p1))), (G (NOT (AND p2 p0))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND p2 p1 (NOT p0)))), (G (NOT (AND p2 p1 p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND p2 (NOT p1) (NOT p0))), (F (AND (NOT p2) p0)), (F p0), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F p2), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 12 factoid took 1990 ms. Reduced automaton from 9 states, 35 edges and 3 AP to 9 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 591 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (OR (NOT p0) p2), (AND p2 p1 (NOT p0)), p2, false, false, false]
Stuttering acceptance computed with spot in 568 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (OR (NOT p0) p2), (AND p2 p1 (NOT p0)), p2, false, false, false]
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:27] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:27] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 18/18 transitions.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 1536 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 9 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 616 ms :[p2, p2, p2, (OR (NOT p0) p2), (AND p2 p1 (NOT p0)), p2, false, false, false]
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:38:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:38:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:38:29] [INFO ] After 64ms 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 (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p2), (F (NOT (OR p2 (NOT p0)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 7 factoid took 1899 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 9 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 671 ms :[p2, p2, p2, (OR (NOT p0) p2), (AND p2 p1 (NOT p0)), p2, false, false, false]
Stuttering acceptance computed with spot in 622 ms :[p2, p2, p2, (OR (NOT p0) p2), (AND p2 p1 (NOT p0)), p2, false, false, false]
Stuttering acceptance computed with spot in 655 ms :[p2, p2, p2, (OR (NOT p0) p2), (AND p2 p1 (NOT p0)), p2, false, false, false]
Product exploration explored 100000 steps with 13599 reset in 176 ms.
Product exploration explored 100000 steps with 13611 reset in 160 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 557 ms :[p2, p2, p2, (OR (NOT p0) p2), (AND p2 p1 (NOT p0)), p2, false, false, false]
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Graph (complete) has 17 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 3 ms. Remains 16 /19 variables (removed 3) and now considering 16/18 (removed 2) transitions.
[2022-05-15 23:38:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-15 23:38:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:38:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/19 places, 16/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/19 places, 16/18 transitions.
Product exploration explored 100000 steps with 13620 reset in 162 ms.
Product exploration explored 100000 steps with 13588 reset in 137 ms.
Built C files in :
/tmp/ltsmin4375493596228483013
[2022-05-15 23:38:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4375493596228483013
Running compilation step : cd /tmp/ltsmin4375493596228483013;'/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 115 ms.
Running link step : cd /tmp/ltsmin4375493596228483013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4375493596228483013;'/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/stateBased4074756250038846230.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA AirplaneLD-COL-0010-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-COL-0010-LTLFireability-15 finished in 15500 ms.
All properties solved by simple procedures.
Total runtime 30644 ms.

BK_STOP 1652657916169

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

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