About the Execution of LTSMin+red for DNAwalker-PT-03track12BlockBoth
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1433.319 | 231038.00 | 250453.00 | 1558.90 | TFFFF?FF?FFTFF?F | normal |
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.r105-tall-167814481800892.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DNAwalker-PT-03track12BlockBoth, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481800892
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 12:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K 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 DNAwalker-PT-03track12BlockBoth-LTLFireability-00
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-01
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-02
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-03
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-04
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-05
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-06
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-07
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-08
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-09
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-10
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-11
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-12
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-13
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-14
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678402992946
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=DNAwalker-PT-03track12BlockBoth
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 23:03:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 23:03:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:03:14] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-09 23:03:14] [INFO ] Transformed 14 places.
[2023-03-09 23:03:14] [INFO ] Transformed 84 transitions.
[2023-03-09 23:03:14] [INFO ] Parsed PT model containing 14 places and 84 transitions and 244 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:14] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 14 cols
[2023-03-09 23:03:14] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-09 23:03:14] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
[2023-03-09 23:03:14] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:14] [INFO ] Invariant cache hit.
[2023-03-09 23:03:14] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-09 23:03:14] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:14] [INFO ] Invariant cache hit.
[2023-03-09 23:03:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:14] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 23:03:14] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:14] [INFO ] Invariant cache hit.
[2023-03-09 23:03:14] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 14/14 places, 84/84 transitions.
Support contains 12 out of 14 places after structural reductions.
[2023-03-09 23:03:15] [INFO ] Flatten gal took : 27 ms
[2023-03-09 23:03:15] [INFO ] Flatten gal took : 8 ms
[2023-03-09 23:03:15] [INFO ] Input system was already deterministic with 84 transitions.
Incomplete random walk after 10000 steps, including 1114 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 205 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 23:03:15] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:15] [INFO ] Invariant cache hit.
[2023-03-09 23:03:15] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 23:03:16] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
Computed a total of 14 stabilizing places and 82 stable transitions
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((X(p0)&&(G(p1)||!(!p0 U p2)))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:16] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:16] [INFO ] Invariant cache hit.
[2023-03-09 23:03:16] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-09 23:03:16] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:16] [INFO ] Invariant cache hit.
[2023-03-09 23:03:16] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 23:03:16] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:16] [INFO ] Invariant cache hit.
[2023-03-09 23:03:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:16] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-09 23:03:16] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:16] [INFO ] Invariant cache hit.
[2023-03-09 23:03:16] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 486 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s2 2) (GEQ s12 1)), p1:(OR (LT s3 2) (LT s6 1)), p0:(OR (LT s9 2) (LT s12 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (OR (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) p1 p0)
Knowledge based reduction with 16 factoid took 1215 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-00 finished in 2346 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(F(p0))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:18] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:18] [INFO ] Invariant cache hit.
[2023-03-09 23:03:18] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2023-03-09 23:03:18] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:18] [INFO ] Invariant cache hit.
[2023-03-09 23:03:18] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 23:03:18] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:18] [INFO ] Invariant cache hit.
[2023-03-09 23:03:18] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:18] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-09 23:03:18] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:18] [INFO ] Invariant cache hit.
[2023-03-09 23:03:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-01 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:(AND (GEQ s2 2) (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][false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-01 finished in 297 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(G(p0))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s3 1) (GEQ s7 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-02 finished in 265 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(p0))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 7 steps with 3 reset in 1 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-03 finished in 251 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(G(p1))&&p0) U (!p1 U p2)))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:19] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s2 2)), p0:(AND (GEQ s0 2) (GEQ s1 1)), p1:(AND (GEQ s1 2) (GEQ s9 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 10 steps with 1 reset in 1 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-04 finished in 338 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))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 23:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:19] [INFO ] Invariant cache hit.
[2023-03-09 23:03:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:20] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-09 23:03:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:03:20] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:20] [INFO ] Invariant cache hit.
[2023-03-09 23:03:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 2) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 35937 reset in 153 ms.
Product exploration explored 100000 steps with 36007 reset in 132 ms.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-09 23:03:20] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:20] [INFO ] Invariant cache hit.
[2023-03-09 23:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:03:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 23:03:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:03:21] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-09 23:03:21] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:21] [INFO ] [Nat]Added 19 Read/Feed constraints in 9 ms returned sat
[2023-03-09 23:03:21] [INFO ] Computed and/alt/rep : 43/309/42 causal constraints (skipped 34 transitions) in 6 ms.
[2023-03-09 23:03:21] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:21] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:21] [INFO ] Invariant cache hit.
[2023-03-09 23:03:21] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-09 23:03:21] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:21] [INFO ] Invariant cache hit.
[2023-03-09 23:03:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 23:03:21] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:21] [INFO ] Invariant cache hit.
[2023-03-09 23:03:21] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:21] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-09 23:03:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:03:21] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:21] [INFO ] Invariant cache hit.
[2023-03-09 23:03:21] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 14/14 places, 84/84 transitions.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-09 23:03:21] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:21] [INFO ] Invariant cache hit.
[2023-03-09 23:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:03:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-09 23:03:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:03:21] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-09 23:03:21] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:21] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2023-03-09 23:03:21] [INFO ] Computed and/alt/rep : 43/309/42 causal constraints (skipped 34 transitions) in 5 ms.
[2023-03-09 23:03:22] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 35945 reset in 117 ms.
Product exploration explored 100000 steps with 35931 reset in 115 ms.
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:22] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-09 23:03:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 14/14 places, 84/84 transitions.
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-05 finished in 2584 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 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:22] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-09 23:03:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-06 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 s3 1) (GEQ s11 2))], 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 7 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-06 finished in 235 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&&X((p1&&X(G((G(p3)||p2)))))))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:03:22] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-09 23:03:22] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:22] [INFO ] Invariant cache hit.
[2023-03-09 23:03:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={1} source=3 dest: 5}, { cond=(AND p0 (NOT p2) p3), acceptance={1} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={1} source=4 dest: 7}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={1} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={1} source=5 dest: 5}, { cond=(AND p0 p3), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={1} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) p1 p3), acceptance={1} source=6 dest: 7}, { cond=(AND p0 p1 p3), acceptance={1} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={1} source=7 dest: 5}, { cond=(AND p0 (NOT p2) p3), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2 p3), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=8 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={1} source=8 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={1} source=8 dest: 6}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={1} source=8 dest: 7}, { cond=(AND p0 p2 p3), acceptance={} source=8 dest: 8}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={1} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s11 2) (LT s13 1)), p1:(OR (LT s1 1) (LT s11 2)), p2:(OR (LT s1 1) (LT s11 2)), p3:(OR (LT s9 2) (LT s11 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 0 reset in 229 ms.
Product exploration explored 100000 steps with 0 reset in 258 ms.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p0 p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 3604 ms. Reduced automaton from 9 states, 57 edges and 4 AP (stutter sensitive) to 15 states, 81 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 751 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 p1 (NOT p3) (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 1129 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 34) seen :19
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-09 23:03:28] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:03:28] [INFO ] Invariant cache hit.
[2023-03-09 23:03:28] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:12
[2023-03-09 23:03:29] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
Fused 15 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 15 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p0 p3 (NOT p1)))), (G (NOT (AND p0 p3 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) p1 p2))), (G (NOT (AND (NOT p0) (NOT p3) p2))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p3) (NOT p1)))), (G (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (G (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3)))), (G (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (AND p0 p3 (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p0 p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p3 (NOT p2)))), (F (AND p0 (NOT p3) p1)), (F (NOT (AND p0 p3 p1 p2))), (F (AND p0 (NOT p3) p1 p2)), (F (NOT p0)), (F (NOT (AND p0 p3 p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p3 p1 p2)), (F (NOT (AND p0 p3))), (F (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p2))), (F (NOT (OR (AND p0 p3) (AND p0 p2)))), (F (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p3))), (F (NOT (AND p0 p3 p2))), (F (AND (NOT p0) p3 p2)), (F (AND p0 (NOT p3) p2))]
Error while executing :'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--small' '--given-formula=G(!(p0&&p3&&!p2))' '-F' '/tmp/b4k12651189852017012589.hoa' '--given-strategy=relax'
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--small' '--given-formula=G(!(p0&&p3&&!p2))' '-F' '/tmp/b4k12651189852017012589.hoa' '--given-strategy=relax' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:141)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:115)
at fr.lip6.move.gal.application.runner.spot.SpotRunner.givenThat(SpotRunner.java:786)
at fr.lip6.move.gal.application.runner.spot.SpotRunner.givenThat(SpotRunner.java:756)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.knowledgeLoop(LTLPropertySolver.java:808)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.spotIntegrateKnowledge(LTLPropertySolver.java:751)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:573)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Knowledge based reduction with 36 factoid took 84173 ms. Reduced automaton from 15 states, 81 edges and 4 AP (stutter insensitive) to 9 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 515 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p3)), (OR (AND (NOT p0) p2) (AND (NOT p1) p3)), (AND (NOT p1) p3), false, false, false, false, false, (AND p0 (NOT p1) p3)]
Stuttering acceptance computed with spot in 405 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p3)), (OR (AND (NOT p0) p2) (AND (NOT p1) p3)), (AND (NOT p1) p3), false, false, false, false, false, (AND p0 (NOT p1) p3)]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:04:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:04:54] [INFO ] Invariant cache hit.
[2023-03-09 23:04:54] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-09 23:04:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:04:54] [INFO ] Invariant cache hit.
[2023-03-09 23:04:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 23:04:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:04:54] [INFO ] Invariant cache hit.
[2023-03-09 23:04:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:04:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-09 23:04:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:04:54] [INFO ] Invariant cache hit.
[2023-03-09 23:04:54] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 14/14 places, 84/84 transitions.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p1 p0), (X (NOT (OR (AND (NOT p0) p2) (AND p3 (NOT p1))))), (X (OR p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X p3), (X (AND p0 p2)), (X (AND p0 p3 p1)), (X (X (OR p2 (NOT p3) (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p3 (NOT p1)))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (OR (AND p2 p1) (NOT p3)))), (X (X (NOT (OR (AND p2 p1) (NOT p3)))))]
Knowledge based reduction with 12 factoid took 6201 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (AND (NOT p1) p3), false, false, false, false, false, (AND p0 (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 1121 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 190 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:05:01] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:01] [INFO ] Invariant cache hit.
[2023-03-09 23:05:01] [INFO ] After 19ms 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 p2 p3 p1 p0), (X (NOT (OR (AND (NOT p0) p2) (AND p3 (NOT p1))))), (X (OR p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X p3), (X (AND p0 p2)), (X (AND p0 p3 p1)), (X (X (OR p2 (NOT p3) (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p3) (NOT p1) p2))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p3 (NOT p1)))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (OR (AND p2 p1) (NOT p3)))), (X (X (NOT (OR (AND p2 p1) (NOT p3))))), (F (NOT (AND p3 p0 p1))), (F (NOT p3)), (F (NOT (OR (NOT p3) (AND p1 p2)))), (F (AND p3 (NOT p1))), (F (NOT (AND p0 p2))), (F (OR (AND p3 (NOT p1)) (AND (NOT p0) p2))), (F (NOT (AND p3 p0))), (F (NOT (AND p3 p2))), (F (AND p3 (NOT p1) (NOT p2))), (F (NOT (AND p3 p1 p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 6136 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (AND (NOT p1) p3), false, false, false, false, false, (AND (NOT p1) p3 (NOT p2) p0)]
Stuttering acceptance computed with spot in 427 ms :[(OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (AND (NOT p1) p3), false, false, false, false, false, (AND (NOT p1) p3 (NOT p2) p0)]
Stuttering acceptance computed with spot in 493 ms :[(OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (AND (NOT p1) p3), false, false, false, false, false, (AND (NOT p1) p3 (NOT p2) p0)]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 41 ms.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:05:09] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 14/14 places, 84/84 transitions.
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-08 finished in 106541 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 U (p1||G(!p0)))) U (p2||X(p2)))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:05:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p2), (AND (NOT p1) p0)]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s11 2)), p1:(AND (NOT (AND (GEQ s2 1) (GEQ s11 2))) (NOT (AND (GEQ s4 2) (GEQ s11 1)))), p0:(AND (GEQ s4 2) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-09 finished in 307 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((p0||F(p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:05:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 23:05:09] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:09] [INFO ] Invariant cache hit.
[2023-03-09 23:05:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s6 2)), p0:(LT s13 2)], 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 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-11 finished in 602 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(F((G(F(!p0))||(!p1&&F(!p0)))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:10] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:10] [INFO ] Invariant cache hit.
[2023-03-09 23:05:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-09 23:05:10] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:10] [INFO ] Invariant cache hit.
[2023-03-09 23:05:10] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 23:05:10] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:10] [INFO ] Invariant cache hit.
[2023-03-09 23:05:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:05:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-09 23:05:10] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:10] [INFO ] Invariant cache hit.
[2023-03-09 23:05:10] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0, p0]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3 2) (GEQ s4 1)), p0:(AND (GEQ s1 2) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 32166 reset in 100 ms.
Product exploration explored 100000 steps with 32194 reset in 112 ms.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[p0, p0, p0, p0]
Finished random walk after 14 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 241 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 146 ms :[p0, p0, p0, p0]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:11] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:11] [INFO ] Invariant cache hit.
[2023-03-09 23:05:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-09 23:05:11] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:11] [INFO ] Invariant cache hit.
[2023-03-09 23:05:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 23:05:11] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:11] [INFO ] Invariant cache hit.
[2023-03-09 23:05:11] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:05:11] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-09 23:05:11] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:11] [INFO ] Invariant cache hit.
[2023-03-09 23:05:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 14/14 places, 84/84 transitions.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[p0, p0, p0, p0]
Finished random walk after 274 steps, including 30 resets, run visited all 2 properties in 6 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 132 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 32180 reset in 107 ms.
Product exploration explored 100000 steps with 32160 reset in 111 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 167 ms :[p0, p0, p0, p0]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-09 23:05:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 14/14 places, 84/84 transitions.
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:05:13] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 14/14 places, 84/84 transitions.
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-14 finished in 3299 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 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:05:13] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 23:05:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:05:13] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:13] [INFO ] Invariant cache hit.
[2023-03-09 23:05:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 198 ms :[p0]
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s11 2))], 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 10 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-15 finished in 371 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))'
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&&X((p1&&X(G((G(p3)||p2)))))))))'
Found a Shortening insensitive property : DNAwalker-PT-03track12BlockBoth-LTLFireability-08
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:05:14] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:14] [INFO ] Invariant cache hit.
[2023-03-09 23:05:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-09 23:05:14] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:14] [INFO ] Invariant cache hit.
[2023-03-09 23:05:14] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 23:05:14] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:14] [INFO ] Invariant cache hit.
[2023-03-09 23:05:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:05:14] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-09 23:05:14] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:14] [INFO ] Invariant cache hit.
[2023-03-09 23:05:14] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 147 ms. Remains : 14/14 places, 84/84 transitions.
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={1} source=3 dest: 5}, { cond=(AND p0 (NOT p2) p3), acceptance={1} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={1} source=4 dest: 7}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={1} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={1} source=5 dest: 5}, { cond=(AND p0 p3), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={1} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) p1 p3), acceptance={1} source=6 dest: 7}, { cond=(AND p0 p1 p3), acceptance={1} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={1} source=7 dest: 5}, { cond=(AND p0 (NOT p2) p3), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2 p3), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=8 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={1} source=8 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={1} source=8 dest: 6}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={1} source=8 dest: 7}, { cond=(AND p0 p2 p3), acceptance={} source=8 dest: 8}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={1} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s11 2) (LT s13 1)), p1:(OR (LT s1 1) (LT s11 2)), p2:(OR (LT s1 1) (LT s11 2)), p3:(OR (LT s9 2) (LT s11 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 179 ms.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p0 p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 3460 ms. Reduced automaton from 9 states, 57 edges and 4 AP (stutter sensitive) to 15 states, 81 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 853 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 p1 (NOT p3) (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 1112 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 34) seen :19
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-09 23:05:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:05:19] [INFO ] Invariant cache hit.
[2023-03-09 23:05:19] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:12
[2023-03-09 23:05:20] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
Fused 15 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 15 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p0 p3 (NOT p1)))), (G (NOT (AND p0 p3 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) p1 p2))), (G (NOT (AND (NOT p0) (NOT p3) p2))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p3) (NOT p1)))), (G (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (G (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3)))), (G (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (AND p0 p3 (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p0 p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p3 (NOT p2)))), (F (AND p0 (NOT p3) p1)), (F (NOT (AND p0 p3 p1 p2))), (F (AND p0 (NOT p3) p1 p2)), (F (NOT p0)), (F (NOT (AND p0 p3 p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p3 p1 p2)), (F (NOT (AND p0 p3))), (F (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p2))), (F (NOT (OR (AND p0 p3) (AND p0 p2)))), (F (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p3))), (F (NOT (AND p0 p3 p2))), (F (AND (NOT p0) p3 p2)), (F (AND p0 (NOT p3) p2))]
Error while executing :'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--small' '--given-formula=G(!(p0&&p3&&!p2))' '-F' '/tmp/b4k15326179442217303277.hoa' '--given-strategy=relax'
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--small' '--given-formula=G(!(p0&&p3&&!p2))' '-F' '/tmp/b4k15326179442217303277.hoa' '--given-strategy=relax' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:141)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:115)
at fr.lip6.move.gal.application.runner.spot.SpotRunner.givenThat(SpotRunner.java:786)
at fr.lip6.move.gal.application.runner.spot.SpotRunner.givenThat(SpotRunner.java:756)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.knowledgeLoop(LTLPropertySolver.java:808)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.spotIntegrateKnowledge(LTLPropertySolver.java:751)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:573)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Knowledge based reduction with 36 factoid took 83717 ms. Reduced automaton from 15 states, 81 edges and 4 AP (stutter insensitive) to 9 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p3)), (OR (AND (NOT p0) p2) (AND (NOT p1) p3)), (AND (NOT p1) p3), false, false, false, false, false, (AND p0 (NOT p1) p3)]
Stuttering acceptance computed with spot in 388 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p3)), (OR (AND (NOT p0) p2) (AND (NOT p1) p3)), (AND (NOT p1) p3), false, false, false, false, false, (AND p0 (NOT p1) p3)]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:06:44] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:44] [INFO ] Invariant cache hit.
[2023-03-09 23:06:44] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-09 23:06:44] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:44] [INFO ] Invariant cache hit.
[2023-03-09 23:06:44] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 23:06:44] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:44] [INFO ] Invariant cache hit.
[2023-03-09 23:06:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:06:44] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-09 23:06:44] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:44] [INFO ] Invariant cache hit.
[2023-03-09 23:06:44] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 14/14 places, 84/84 transitions.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p1 p0), (X (NOT (OR (AND (NOT p0) p2) (AND p3 (NOT p1))))), (X (OR p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X p3), (X (AND p0 p2)), (X (AND p0 p3 p1)), (X (X (OR p2 (NOT p3) (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p3 (NOT p1)))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (OR (AND p2 p1) (NOT p3)))), (X (X (NOT (OR (AND p2 p1) (NOT p3)))))]
Knowledge based reduction with 12 factoid took 6283 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (AND (NOT p1) p3), false, false, false, false, false, (AND p0 (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 1115 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 192 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:06:51] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:51] [INFO ] Invariant cache hit.
[2023-03-09 23:06:51] [INFO ] After 13ms 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 p2 p3 p1 p0), (X (NOT (OR (AND (NOT p0) p2) (AND p3 (NOT p1))))), (X (OR p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X p3), (X (AND p0 p2)), (X (AND p0 p3 p1)), (X (X (OR p2 (NOT p3) (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p3) (NOT p1) p2))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p3 (NOT p1)))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (OR (AND p2 p1) (NOT p3)))), (X (X (NOT (OR (AND p2 p1) (NOT p3))))), (F (NOT (AND p3 p0 p1))), (F (NOT p3)), (F (NOT (OR (NOT p3) (AND p1 p2)))), (F (AND p3 (NOT p1))), (F (NOT (AND p0 p2))), (F (OR (AND p3 (NOT p1)) (AND (NOT p0) p2))), (F (NOT (AND p3 p0))), (F (NOT (AND p3 p2))), (F (AND p3 (NOT p1) (NOT p2))), (F (NOT (AND p3 p1 p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 5967 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[(OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (AND (NOT p1) p3), false, false, false, false, false, (AND (NOT p1) p3 (NOT p2) p0)]
Stuttering acceptance computed with spot in 417 ms :[(OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (AND (NOT p1) p3), false, false, false, false, false, (AND (NOT p1) p3 (NOT p2) p0)]
Stuttering acceptance computed with spot in 390 ms :[(OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (OR (AND (NOT p1) p3) (AND (NOT p0) p2)), (AND (NOT p1) p3), false, false, false, false, false, (AND (NOT p1) p3 (NOT p2) p0)]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Product exploration explored 100000 steps with 1 reset in 74 ms.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:06:59] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:59] [INFO ] Invariant cache hit.
[2023-03-09 23:06:59] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-09 23:06:59] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:59] [INFO ] Invariant cache hit.
[2023-03-09 23:06:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 23:06:59] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:59] [INFO ] Invariant cache hit.
[2023-03-09 23:06:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:06:59] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-09 23:06:59] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:59] [INFO ] Invariant cache hit.
[2023-03-09 23:06:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 14/14 places, 84/84 transitions.
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-08 finished in 105333 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(F((G(F(!p0))||(!p1&&F(!p0)))))))'
Found a Shortening insensitive property : DNAwalker-PT-03track12BlockBoth-LTLFireability-14
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, p0]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 6 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:06:59] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:59] [INFO ] Invariant cache hit.
[2023-03-09 23:06:59] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-09 23:06:59] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:59] [INFO ] Invariant cache hit.
[2023-03-09 23:06:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-09 23:06:59] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:59] [INFO ] Invariant cache hit.
[2023-03-09 23:06:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:06:59] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-09 23:06:59] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:06:59] [INFO ] Invariant cache hit.
[2023-03-09 23:06:59] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 167 ms. Remains : 14/14 places, 84/84 transitions.
Running random walk in product with property : DNAwalker-PT-03track12BlockBoth-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3 2) (GEQ s4 1)), p0:(AND (GEQ s1 2) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 32185 reset in 117 ms.
Product exploration explored 100000 steps with 32165 reset in 113 ms.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0, p0]
Finished random walk after 213 steps, including 23 resets, run visited all 2 properties in 3 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:07:00] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:00] [INFO ] Invariant cache hit.
[2023-03-09 23:07:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-09 23:07:00] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:00] [INFO ] Invariant cache hit.
[2023-03-09 23:07:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 23:07:00] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:00] [INFO ] Invariant cache hit.
[2023-03-09 23:07:00] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:07:00] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-09 23:07:00] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:00] [INFO ] Invariant cache hit.
[2023-03-09 23:07:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 14/14 places, 84/84 transitions.
Computed a total of 14 stabilizing places and 82 stable transitions
Computed a total of 14 stabilizing places and 82 stable transitions
Detected a total of 14/14 stabilizing places and 82/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, p0]
Finished random walk after 116 steps, including 13 resets, run visited all 2 properties in 2 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 152 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 32210 reset in 107 ms.
Product exploration explored 100000 steps with 32257 reset in 111 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 140 ms :[p0, p0, p0, p0]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:07:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:02] [INFO ] Invariant cache hit.
[2023-03-09 23:07:02] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-09 23:07:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:07:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:02] [INFO ] Invariant cache hit.
[2023-03-09 23:07:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 14/14 places, 84/84 transitions.
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:07:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:02] [INFO ] Invariant cache hit.
[2023-03-09 23:07:02] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-09 23:07:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:02] [INFO ] Invariant cache hit.
[2023-03-09 23:07:02] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 23:07:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:02] [INFO ] Invariant cache hit.
[2023-03-09 23:07:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 23:07:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-09 23:07:02] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 23:07:02] [INFO ] Invariant cache hit.
[2023-03-09 23:07:02] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 14/14 places, 84/84 transitions.
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-14 finished in 3435 ms.
[2023-03-09 23:07:02] [INFO ] Flatten gal took : 5 ms
[2023-03-09 23:07:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-09 23:07:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 84 transitions and 244 arcs took 1 ms.
Total runtime 228418 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3234/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3234/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3234/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DNAwalker-PT-03track12BlockBoth-LTLFireability-05
Could not compute solution for formula : DNAwalker-PT-03track12BlockBoth-LTLFireability-08
Could not compute solution for formula : DNAwalker-PT-03track12BlockBoth-LTLFireability-14
BK_STOP 1678403223984
--------------------
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 DNAwalker-PT-03track12BlockBoth-LTLFireability-05
ltl formula formula --ltl=/tmp/3234/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 14 places, 84 transitions and 244 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3234/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3234/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3234/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3234/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name DNAwalker-PT-03track12BlockBoth-LTLFireability-08
ltl formula formula --ltl=/tmp/3234/ltl_1_
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 14 places, 84 transitions and 244 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( 3/ 4): LTL layer: formula: /tmp/3234/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3234/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3234/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3234/ltl_1_
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:
ltl formula name DNAwalker-PT-03track12BlockBoth-LTLFireability-14
ltl formula formula --ltl=/tmp/3234/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 14 places, 84 transitions and 244 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3234/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3234/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3234/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3234/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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:
0: pnml2lts-mc(+0xa23f4) [0x558b69ea43f4]
1: pnml2lts-mc(+0xa2496) [0x558b69ea4496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fb71b972140]
3: pnml2lts-mc(+0x405b30) [0x558b6a207b30]
4: pnml2lts-mc(+0x16b3f9) [0x558b69f6d3f9]
5: pnml2lts-mc(+0x164ac4) [0x558b69f66ac4]
6: pnml2lts-mc(+0x272e0a) [0x558b6a074e0a]
7: pnml2lts-mc(+0xb61f0) [0x558b69eb81f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fb71b7c54d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fb71b7c567a]
10: pnml2lts-mc(+0xa1581) [0x558b69ea3581]
11: pnml2lts-mc(+0xa1910) [0x558b69ea3910]
12: pnml2lts-mc(+0xa32a2) [0x558b69ea52a2]
13: pnml2lts-mc(+0xa50f4) [0x558b69ea70f4]
14: pnml2lts-mc(+0xa516b) [0x558b69ea716b]
15: pnml2lts-mc(+0x3f34b3) [0x558b6a1f54b3]
16: pnml2lts-mc(+0x7c63d) [0x558b69e7e63d]
17: pnml2lts-mc(+0x67d86) [0x558b69e69d86]
18: pnml2lts-mc(+0x60a8a) [0x558b69e62a8a]
19: pnml2lts-mc(+0x5eb15) [0x558b69e60b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fb71b7add0a]
21: pnml2lts-mc(+0x6075e) [0x558b69e6275e]
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="DNAwalker-PT-03track12BlockBoth"
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 DNAwalker-PT-03track12BlockBoth, 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 r105-tall-167814481800892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-03track12BlockBoth.tgz
mv DNAwalker-PT-03track12BlockBoth 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 '
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 ;