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.r101-tall-167814476000892.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 itstools
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 r101-tall-167814476000892
=====================================================================

--------------------
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 1678329988948

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-03track12BlockBoth
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 02:46:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 02:46:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:46:30] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-09 02:46:30] [INFO ] Transformed 14 places.
[2023-03-09 02:46:30] [INFO ] Transformed 84 transitions.
[2023-03-09 02:46:30] [INFO ] Parsed PT model containing 14 places and 84 transitions and 244 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 10 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:46:30] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 14 cols
[2023-03-09 02:46:30] [INFO ] Computed 0 place invariants in 11 ms
[2023-03-09 02:46:31] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
[2023-03-09 02:46:31] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:31] [INFO ] Invariant cache hit.
[2023-03-09 02:46:31] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 02:46:31] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:31] [INFO ] Invariant cache hit.
[2023-03-09 02:46:31] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:31] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-09 02:46:31] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:31] [INFO ] Invariant cache hit.
[2023-03-09 02:46:31] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 14/14 places, 84/84 transitions.
Support contains 12 out of 14 places after structural reductions.
[2023-03-09 02:46:31] [INFO ] Flatten gal took : 23 ms
[2023-03-09 02:46:31] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:46:31] [INFO ] Input system was already deterministic with 84 transitions.
Incomplete random walk after 10000 steps, including 1119 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 197 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 204 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:32] [INFO ] Invariant cache hit.
[2023-03-09 02:46:32] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 02:46:32] [INFO ] After 175ms 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 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:32] [INFO ] Invariant cache hit.
[2023-03-09 02:46:32] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:32] [INFO ] Invariant cache hit.
[2023-03-09 02:46:32] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:32] [INFO ] Invariant cache hit.
[2023-03-09 02:46:32] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:32] [INFO ] Invariant cache hit.
[2023-03-09 02:46:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 489 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 242 ms.
Product exploration explored 100000 steps with 50000 reset in 184 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 1213 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 2397 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 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:35] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 105 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 6 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-01 finished in 304 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 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 175 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 374 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 7 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:36] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-09 02:46:36] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:36] [INFO ] Invariant cache hit.
[2023-03-09 02:46:36] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:36] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-09 02:46:36] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:36] [INFO ] Invariant cache hit.
[2023-03-09 02:46:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 98 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 3 steps with 1 reset in 1 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-03 finished in 481 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 02:46:36] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:36] [INFO ] Invariant cache hit.
[2023-03-09 02:46:36] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-09 02:46:36] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:36] [INFO ] Invariant cache hit.
[2023-03-09 02:46:36] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-09 02:46:36] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:36] [INFO ] Invariant cache hit.
[2023-03-09 02:46:36] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:36] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-09 02:46:36] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:36] [INFO ] Invariant cache hit.
[2023-03-09 02:46:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 236 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 9 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-04 finished in 758 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 7 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:46:37] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:37] [INFO ] Invariant cache hit.
[2023-03-09 02:46:37] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
[2023-03-09 02:46:37] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:37] [INFO ] Invariant cache hit.
[2023-03-09 02:46:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 02:46:37] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:37] [INFO ] Invariant cache hit.
[2023-03-09 02:46:37] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:37] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-09 02:46:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 02:46:37] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:37] [INFO ] Invariant cache hit.
[2023-03-09 02:46:37] [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 358 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 141 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 36013 reset in 136 ms.
Product exploration explored 100000 steps with 35992 reset in 119 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 171 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 47 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 203 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 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
[2023-03-09 02:46:38] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:38] [INFO ] Invariant cache hit.
[2023-03-09 02:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-09 02:46:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:38] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-09 02:46:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:38] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2023-03-09 02:46:38] [INFO ] Computed and/alt/rep : 43/309/42 causal constraints (skipped 34 transitions) in 8 ms.
[2023-03-09 02:46:38] [INFO ] Added : 0 causal constraints over 0 iterations in 21 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 3 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:46:38] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:38] [INFO ] Invariant cache hit.
[2023-03-09 02:46:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-09 02:46:38] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:38] [INFO ] Invariant cache hit.
[2023-03-09 02:46:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 02:46:38] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:38] [INFO ] Invariant cache hit.
[2023-03-09 02:46:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:38] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-09 02:46:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:46:38] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:38] [INFO ] Invariant cache hit.
[2023-03-09 02:46:38] [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 189 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 153 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 33 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 191 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 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-09 02:46:39] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:39] [INFO ] Invariant cache hit.
[2023-03-09 02:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-09 02:46:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:39] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-09 02:46:39] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:39] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-09 02:46:39] [INFO ] Computed and/alt/rep : 43/309/42 causal constraints (skipped 34 transitions) in 7 ms.
[2023-03-09 02:46:39] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 36042 reset in 120 ms.
Product exploration explored 100000 steps with 35953 reset in 119 ms.
Built C files in :
/tmp/ltsmin6496116727153505884
[2023-03-09 02:46:40] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2023-03-09 02:46:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:46:40] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2023-03-09 02:46:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:46:40] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2023-03-09 02:46:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:46:40] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6496116727153505884
Running compilation step : cd /tmp/ltsmin6496116727153505884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 274 ms.
Running link step : cd /tmp/ltsmin6496116727153505884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6496116727153505884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1752624068807026148.hoa' '--buchi-type=spotba'
LTSmin run took 87 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-05 finished in 3333 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 5 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:46:40] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:40] [INFO ] Invariant cache hit.
[2023-03-09 02:46:40] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2023-03-09 02:46:40] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:40] [INFO ] Invariant cache hit.
[2023-03-09 02:46:40] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 02:46:40] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:40] [INFO ] Invariant cache hit.
[2023-03-09 02:46:40] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-09 02:46:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 02:46:40] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:40] [INFO ] Invariant cache hit.
[2023-03-09 02:46:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 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 12 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 239 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 02:46:40] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:40] [INFO ] Invariant cache hit.
[2023-03-09 02:46:40] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-09 02:46:40] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:40] [INFO ] Invariant cache hit.
[2023-03-09 02:46:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 02:46:40] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:40] [INFO ] Invariant cache hit.
[2023-03-09 02:46:40] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:46:40] [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 02:46:40] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:40] [INFO ] Invariant cache hit.
[2023-03-09 02:46:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 504 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 201 ms.
Product exploration explored 100000 steps with 0 reset in 169 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 3648 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 765 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 1111 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 34) seen :19
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 1001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 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 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 17 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 17 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 19 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 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 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 17 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 17 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 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 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 16 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 19 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 02:46:46] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:46:46] [INFO ] Invariant cache hit.
[2023-03-09 02:46:46] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:12
[2023-03-09 02:46:47] [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/b4k2766733893483446206.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/b4k2766733893483446206.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 84542 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 381 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 414 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 02:48:12] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:12] [INFO ] Invariant cache hit.
[2023-03-09 02:48:12] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-09 02:48:12] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:12] [INFO ] Invariant cache hit.
[2023-03-09 02:48:12] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 02:48:12] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:12] [INFO ] Invariant cache hit.
[2023-03-09 02:48:12] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:48:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-09 02:48:12] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:12] [INFO ] Invariant cache hit.
[2023-03-09 02:48:12] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 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 6144 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 379 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 1112 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 02:48:19] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:19] [INFO ] Invariant cache hit.
[2023-03-09 02:48:19] [INFO ] After 14ms 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 5992 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 367 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 374 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 381 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 46 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Built C files in :
/tmp/ltsmin12888413378147866277
[2023-03-09 02:48:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12888413378147866277
Running compilation step : cd /tmp/ltsmin12888413378147866277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin12888413378147866277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin12888413378147866277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4627062593936021399.hoa' '--buchi-type=spotba'
LTSmin run took 417 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-08 finished in 106923 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 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:48:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:27] [INFO ] Invariant cache hit.
[2023-03-09 02:48:27] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-09 02:48:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:27] [INFO ] Invariant cache hit.
[2023-03-09 02:48:27] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-09 02:48:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:27] [INFO ] Invariant cache hit.
[2023-03-09 02:48:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:48:27] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-09 02:48:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:27] [INFO ] Invariant cache hit.
[2023-03-09 02:48:27] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 139 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 6 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-09 finished in 301 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 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:48:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:27] [INFO ] Invariant cache hit.
[2023-03-09 02:48:27] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-03-09 02:48:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:27] [INFO ] Invariant cache hit.
[2023-03-09 02:48:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 02:48:27] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:27] [INFO ] Invariant cache hit.
[2023-03-09 02:48:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:48:28] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-09 02:48:28] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:28] [INFO ] Invariant cache hit.
[2023-03-09 02:48:28] [INFO ] Dead Transitions using invariants and state equation in 41 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 109 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 96 ms.
Product exploration explored 100000 steps with 50000 reset in 105 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 108 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 599 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 0 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:48:28] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:28] [INFO ] Invariant cache hit.
[2023-03-09 02:48:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-09 02:48:28] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:28] [INFO ] Invariant cache hit.
[2023-03-09 02:48:28] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 02:48:28] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:28] [INFO ] Invariant cache hit.
[2023-03-09 02:48:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:48:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-09 02:48:28] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:28] [INFO ] Invariant cache hit.
[2023-03-09 02:48:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 117 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 32143 reset in 112 ms.
Product exploration explored 100000 steps with 32173 reset in 116 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 206 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]
Finished random walk after 40 steps, including 5 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
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 272 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]
Stuttering acceptance computed with spot in 130 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 02:48:29] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:29] [INFO ] Invariant cache hit.
[2023-03-09 02:48:29] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-09 02:48:29] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:29] [INFO ] Invariant cache hit.
[2023-03-09 02:48:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-09 02:48:29] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:29] [INFO ] Invariant cache hit.
[2023-03-09 02:48:30] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:48:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-09 02:48:30] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:30] [INFO ] Invariant cache hit.
[2023-03-09 02:48:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 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 185 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 145 ms :[p0, p0, p0, p0]
Finished random walk after 60 steps, including 6 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
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 228 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 129 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 32203 reset in 120 ms.
Product exploration explored 100000 steps with 32184 reset in 118 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 125 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 7 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 02:48:31] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:31] [INFO ] Invariant cache hit.
[2023-03-09 02:48:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-09 02:48:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:48:31] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:31] [INFO ] Invariant cache hit.
[2023-03-09 02:48:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 14/14 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin11716824935187025637
[2023-03-09 02:48:31] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11716824935187025637
Running compilation step : cd /tmp/ltsmin11716824935187025637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin11716824935187025637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin11716824935187025637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15643712298660770099.hoa' '--buchi-type=spotba'
LTSmin run took 270 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-14 finished in 3528 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 02:48:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:32] [INFO ] Invariant cache hit.
[2023-03-09 02:48:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-09 02:48:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:32] [INFO ] Invariant cache hit.
[2023-03-09 02:48:32] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 02:48:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:32] [INFO ] Invariant cache hit.
[2023-03-09 02:48:32] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 02:48:32] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-09 02:48:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:48:32] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-09 02:48:32] [INFO ] Invariant cache hit.
[2023-03-09 02:48:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 14/14 places, 84/84 transitions.
Stuttering acceptance computed with spot in 42 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 8 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-03track12BlockBoth-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-03track12BlockBoth-LTLFireability-15 finished in 226 ms.
All properties solved by simple procedures.
Total runtime 121802 ms.

BK_STOP 1678330113169

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r101-tall-167814476000892"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;