Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597600212.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AirplaneLD-COL-0500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597600212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.2K Feb 26 11:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 11:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 109K Mar 5 18:22 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-0500-LTLFireability-00
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-01
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-02
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-03
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-04
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-05
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-06
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-07
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-08
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-09
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-10
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-11
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-12
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-13
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-14
FORMULA_NAME AirplaneLD-COL-0500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678620560476

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-0500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:29:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 11:29:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:29:22] [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.
[2023-03-12 11:29:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 11:29:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2023-03-12 11:29:23] [INFO ] Detected 3 constant HL places corresponding to 1502 PT places.
[2023-03-12 11:29:23] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 3519 PT places and 6012.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 11:29:23] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 4 ms.
[2023-03-12 11:29:23] [INFO ] Skeletonized 15 HLPN properties in 1 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA AirplaneLD-COL-0500-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLFireability-07 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).
Incomplete random walk after 10000 steps, including 1259 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 291 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14 rows 17 cols
[2023-03-12 11:29:23] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 11:29:23] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-12 11:29:23] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 11:29:23] [INFO ] After 192ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
[2023-03-12 11:29:23] [INFO ] Flatten gal took : 29 ms
[2023-03-12 11:29:23] [INFO ] Flatten gal took : 5 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:1000) in guard (OR (GEQ $A 499) (EQ $A 999))introduces in Altitude(1000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:1000) in guard (AND (LT $A 499) (NEQ $A 999))introduces in Altitude(1000) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 1000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 499) (EQ $A 999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 499) (NEQ $A 999)) -> (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:500) in guard (OR (LEQ $S 249) (EQ $S 499))introduces in Speed(500) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:500) in guard (AND (GT $S 249) (NEQ $S 499))introduces in Speed(500) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:500) in guard (OR (LEQ $S 249) (EQ $S 499))introduces in Speed(500) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:500) in guard (AND (GT $S 249) (NEQ $S 499))introduces in Speed(500) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 500 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 249) (EQ $S 499)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 249) (NEQ $S 499)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 249) (EQ $S 499)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 249) (NEQ $S 499)) -> (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
[2023-03-12 11:29:23] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 48 ms.
[2023-03-12 11:29:23] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-12 11:29:23] [INFO ] Reduced 1 identical enabling conditions.
Reduce places removed 6 places and 0 transitions.
FORMULA AirplaneLD-COL-0500-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 35 ms. Remains 20 /23 variables (removed 3) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-12 11:29:24] [INFO ] Computed 1 place invariants in 7 ms
[2023-03-12 11:29:24] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 11:29:24] [INFO ] Invariant cache hit.
[2023-03-12 11:29:24] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-12 11:29:24] [INFO ] Invariant cache hit.
[2023-03-12 11:29:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 20/23 places, 20/20 transitions.
Support contains 18 out of 20 places after structural reductions.
[2023-03-12 11:29:24] [INFO ] Flatten gal took : 3 ms
[2023-03-12 11:29:24] [INFO ] Flatten gal took : 3 ms
[2023-03-12 11:29:24] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 245 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 11:29:24] [INFO ] Invariant cache hit.
[2023-03-12 11:29:24] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:29:24] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA AirplaneLD-COL-0500-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(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 4 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:29:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:29:24] [INFO ] Implicit Places using invariants in 49 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 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 LTL mode , in 2 iterations and 59 ms. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 356 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s8 1) (LT s9 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 1 reset in 4 ms.
FORMULA AirplaneLD-COL-0500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0500-LTLFireability-01 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--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.2 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 7 ms. Remains 1 /20 variables (removed 19) and now considering 1/20 (removed 19) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-12 11:29:25] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 11:29:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 11:29:25] [INFO ] Invariant cache hit.
[2023-03-12 11:29:25] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-12 11:29:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:29:25] [INFO ] Invariant cache hit.
[2023-03-12 11:29:25] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/20 places, 1/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 1/20 places, 1/20 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-02 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 183 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0500-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0500-LTLFireability-02 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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
[2023-03-12 11:29:26] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants in 46 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 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.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 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 3 ms. Remains 17 /19 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-03-12 11:29:26] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-12 11:29:26] [INFO ] Invariant cache hit.
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 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 SI_LTL mode , in 2 iterations and 127 ms. Remains : 17/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0500-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0500-LTLFireability-03 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 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 13 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 13 transition count 13
Applied a total of 2 rules in 5 ms. Remains 13 /20 variables (removed 7) and now considering 13/20 (removed 7) transitions.
// Phase 1: matrix 13 rows 13 cols
[2023-03-12 11:29:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants in 39 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/20 places, 13/20 transitions.
Graph (complete) has 9 edges and 12 vertex of which 11 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 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 6 ms. Remains 10 /12 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 10 cols
[2023-03-12 11:29:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 11:29:26] [INFO ] Invariant cache hit.
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/20 places, 11/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 134 ms. Remains : 10/20 places, 11/20 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0500-LTLFireability-04 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(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 5 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:29:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants in 53 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 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 LTL mode , in 2 iterations and 60 ms. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-08 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-COL-0500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0500-LTLFireability-08 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&((!p1&&G(F(p2))) U (G((G(!p1)||(!p1&&G(F(p2)))))||(!p3&&(G(!p1)||(!p1&&G(F(p2)))))))))))'
Support contains 6 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.
[2023-03-12 11:29:26] [INFO ] Invariant cache hit.
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 11:29:26] [INFO ] Invariant cache hit.
[2023-03-12 11:29:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-12 11:29:26] [INFO ] Invariant cache hit.
[2023-03-12 11:29:27] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 19/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 946 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=p1, acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=p1, acceptance={} source=5 dest: 8}], [{ cond=p1, acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={0} source=7 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=8 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=8 dest: 7}, { cond=(OR (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s12 1)), p1:(GEQ s4 1), p2:(LT s2 1), p3:(AND (GEQ s6 1) (GEQ s16 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][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13754 reset in 255 ms.
Product exploration explored 100000 steps with 13737 reset in 212 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (F (G p0)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p3)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 11 factoid took 1757 ms. Reduced automaton from 9 states, 37 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Finished random walk after 68 steps, including 8 resets, run visited all 4 properties in 6 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (F (G p0)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p3)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (AND p3 (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (AND p0 p3 (NOT p1)))]
Knowledge based reduction with 11 factoid took 1457 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
[2023-03-12 11:29:32] [INFO ] Invariant cache hit.
[2023-03-12 11:29:32] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 11:29:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:29:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:32] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-12 11:29:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 11:29:32] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG p1
Support contains 5 out of 19 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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.
[2023-03-12 11:29:32] [INFO ] Invariant cache hit.
[2023-03-12 11:29:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 11:29:32] [INFO ] Invariant cache hit.
[2023-03-12 11:29:32] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-12 11:29:32] [INFO ] Invariant cache hit.
[2023-03-12 11:29:32] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. 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 p0 p1 (NOT p3)), (X (NOT (AND p0 p3 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 493 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Finished random walk after 723 steps, including 90 resets, run visited all 4 properties in 14 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p0 p1 (NOT p3)), (X (NOT (AND p0 p3 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p3 (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (AND p0 p3 (NOT p1)))]
Knowledge based reduction with 7 factoid took 762 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
[2023-03-12 11:29:34] [INFO ] Invariant cache hit.
[2023-03-12 11:29:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:34] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 11:29:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:29:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:29:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-12 11:29:34] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 11:29:34] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 20054 reset in 161 ms.
Product exploration explored 100000 steps with 19960 reset in 153 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
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.
[2023-03-12 11:29:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2023-03-12 11:29:35] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 11:29:36] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/19 places, 16/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 16/19 places, 16/18 transitions.
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 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:29:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:29:36] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 11:29:36] [INFO ] Invariant cache hit.
[2023-03-12 11:29:36] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-12 11:29:36] [INFO ] Invariant cache hit.
[2023-03-12 11:29:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 19/19 places, 18/18 transitions.
Treatment of property AirplaneLD-COL-0500-LTLFireability-10 finished in 9434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p1)||F(G(!p2)))))'
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.
Graph (complete) has 18 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-12 11:29:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:29:36] [INFO ] Implicit Places using invariants in 37 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 16/20 transitions.
Graph (complete) has 13 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 5 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 13 cols
[2023-03-12 11:29:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 11:29:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 11:29:36] [INFO ] Invariant cache hit.
[2023-03-12 11:29:36] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/20 places, 14/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 13/20 places, 14/20 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND p1 p2), p2, (AND p2 p1)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s12 1)), p2:(AND (GEQ s5 1) (GEQ s9 1)), p0:(GEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 17038 reset in 226 ms.
Product exploration explored 100000 steps with 17071 reset in 136 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 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).
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 p1) (NOT p2) p0), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 16 factoid took 817 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0500-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0500-LTLFireability-11 finished in 1577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-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 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 4 ms. Remains 16 /20 variables (removed 4) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-12 11:29:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:29:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 11:29:37] [INFO ] Invariant cache hit.
[2023-03-12 11:29:38] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-12 11:29:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:29:38] [INFO ] Invariant cache hit.
[2023-03-12 11:29:38] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 16/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 667 ms. Remains : 16/20 places, 16/20 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s11 1)), p1:(OR (LT s4 1) (LT s15 1) (AND (GEQ s7 1) (GEQ s11 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 14565 reset in 92 ms.
Product exploration explored 100000 steps with 14543 reset in 153 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
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 p1), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0500-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0500-LTLFireability-12 finished in 1346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(!p1)||p0))||(X((X(!p1)||p2))&&G(p3)))))'
Support contains 4 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
[2023-03-12 11:29:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:29:39] [INFO ] Implicit Places using invariants in 68 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 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 LTL mode , in 2 iterations and 87 ms. Remains : 19/20 places, 20/20 transitions.
Stuttering acceptance computed with spot in 945 ms :[(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND p3 p0 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(AND p3 (NOT p0) p1), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 p0 p1), acceptance={1} source=0 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND p3 (NOT p0) p1), acceptance={1} source=0 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p3 p0), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 7}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=2 dest: 8}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 9}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=2 dest: 10}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0, 1} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0, 1} source=3 dest: 7}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 8}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={0, 1} source=3 dest: 8}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 9}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={0, 1} source=3 dest: 9}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 10}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=3 dest: 10}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 11}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={1} source=3 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 1}, { cond=(AND p3 p0), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p0 p1), acceptance={1} source=5 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p3 (NOT p0) p1), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=6 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0} source=6 dest: 2}, { cond=(AND p3 (NOT p0) p1), acceptance={0} source=6 dest: 3}, { cond=(AND p3 p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1} source=7 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p3 (NOT p0) p1), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p3 p0 p1), acceptance={1} source=7 dest: 4}, { cond=(AND p3 (NOT p0) p1), acceptance={1} source=7 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=8 dest: 7}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={0} source=8 dest: 8}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={0} source=8 dest: 9}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={} source=8 dest: 10}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0, 1} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0, 1} source=9 dest: 7}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={0, 1} source=9 dest: 8}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={0, 1} source=9 dest: 9}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=9 dest: 10}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={1} source=9 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=10 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=10 dest: 1}, { cond=(AND p3 p0 p1), acceptance={} source=10 dest: 4}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=10 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 1} source=11 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1} source=11 dest: 1}, { cond=(AND p3 p0 p1), acceptance={1} source=11 dest: 4}, { cond=(AND p3 (NOT p0) p1), acceptance={1} source=11 dest: 5}]], initial=0, aps=[p3:(OR (LT s5 1) (LT s17 1)), p0:(OR (LT s6 1) (LT s15 1)), p1:(AND (GEQ s6 1) (GEQ s15 1)), p2:(OR (LT s6 1) (LT s15 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][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20166 reset in 161 ms.
Product exploration explored 100000 steps with 20042 reset in 140 ms.
Computed a total of 19 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 p0 (NOT p1) p2), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p3 (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (AND p3 p0 (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND p3 (NOT p2) (NOT p0) p1))), (X (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND p3 (NOT p2) p0 p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND p3 p0 p1))), (X (AND p3 p0)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p3 p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND p3 (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (AND p3 p0))), (F (G p3)), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 53 factoid took 2520 ms. Reduced automaton from 12 states, 80 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0500-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0500-LTLFireability-13 finished in 3945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&(p2||X(!p3)))))'
Support contains 7 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.
[2023-03-12 11:29:43] [INFO ] Invariant cache hit.
[2023-03-12 11:29:43] [INFO ] Implicit Places using invariants in 44 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 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 LTL mode , in 2 iterations and 48 ms. Remains : 19/20 places, 20/20 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (AND (NOT p2) p3)), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p2) p3))]
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s13 1)), p0:(AND (GEQ s8 1) (GEQ s10 1)), p2:(AND (GEQ s5 1) (GEQ s18 1)), p3:(LT s2 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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-0500-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0500-LTLFireability-15 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&((!p1&&G(F(p2))) U (G((G(!p1)||(!p1&&G(F(p2)))))||(!p3&&(G(!p1)||(!p1&&G(F(p2)))))))))))'
Found a Shortening insensitive property : AirplaneLD-COL-0500-LTLFireability-10
Stuttering acceptance computed with spot in 806 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LI_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.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 4 ms. Remains 16 /20 variables (removed 4) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-12 11:29:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:29:44] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-12 11:29:44] [INFO ] Invariant cache hit.
[2023-03-12 11:29:44] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-12 11:29:44] [INFO ] Invariant cache hit.
[2023-03-12 11:29:44] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/20 places, 16/20 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 205 ms. Remains : 16/20 places, 16/20 transitions.
Running random walk in product with property : AirplaneLD-COL-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=p1, acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=p1, acceptance={} source=5 dest: 8}], [{ cond=p1, acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={0} source=7 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=8 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=8 dest: 7}, { cond=(OR (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s10 1)), p1:(GEQ s3 1), p2:(LT s1 1), p3:(AND (GEQ s4 1) (GEQ s14 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], 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 15689 reset in 131 ms.
Product exploration explored 100000 steps with 15723 reset in 150 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (F (G p0)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p3)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 11 factoid took 1495 ms. Reduced automaton from 9 states, 37 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Finished random walk after 137 steps, including 19 resets, run visited all 4 properties in 6 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (F (G p0)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p3)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (AND p3 (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (AND p0 p3 (NOT p1)))]
Knowledge based reduction with 11 factoid took 1130 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
[2023-03-12 11:29:48] [INFO ] Invariant cache hit.
[2023-03-12 11:29:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 11:29:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:29:48] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:48] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-12 11:29:48] [INFO ] Computed and/alt/rep : 8/14/8 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 11:29:48] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG p1
Support contains 5 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-12 11:29:48] [INFO ] Invariant cache hit.
[2023-03-12 11:29:48] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 11:29:48] [INFO ] Invariant cache hit.
[2023-03-12 11:29:48] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-12 11:29:48] [INFO ] Invariant cache hit.
[2023-03-12 11:29:48] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 16/16 places, 16/16 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p3)), (X (NOT (AND p0 p3 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 521 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Finished random walk after 14 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1 (NOT p3)), (X (NOT (AND p0 p3 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p3 (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (AND p0 p3 (NOT p1)))]
Knowledge based reduction with 7 factoid took 753 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
[2023-03-12 11:29:50] [INFO ] Invariant cache hit.
[2023-03-12 11:29:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 11:29:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:29:50] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:29:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 11:29:50] [INFO ] Computed and/alt/rep : 8/14/8 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 11:29:50] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 22269 reset in 135 ms.
Product exploration explored 100000 steps with 22248 reset in 88 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-12 11:29:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:29:51] [INFO ] Invariant cache hit.
[2023-03-12 11:29:51] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-12 11:29:51] [INFO ] Invariant cache hit.
[2023-03-12 11:29:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 11:29:51] [INFO ] Invariant cache hit.
[2023-03-12 11:29:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-12 11:29:51] [INFO ] Invariant cache hit.
[2023-03-12 11:29:51] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 16/16 places, 16/16 transitions.
Treatment of property AirplaneLD-COL-0500-LTLFireability-10 finished in 8323 ms.
[2023-03-12 11:29:51] [INFO ] Flatten gal took : 10 ms
[2023-03-12 11:29:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-12 11:29:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 20 transitions and 44 arcs took 1 ms.
Total runtime 29350 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1807/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AirplaneLD-COL-0500-LTLFireability-10

BK_STOP 1678620592803

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AirplaneLD-COL-0500-LTLFireability-10
ltl formula formula --ltl=/tmp/1807/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 20 places, 20 transitions and 44 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1807/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1807/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1807/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1807/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-0500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is AirplaneLD-COL-0500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597600212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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