About the Execution of ITS-Tools for Eratosthenes-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 355.680 | 13805.00 | 19357.00 | 875.10 | TFTTFFFFTFTFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110400476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Eratosthenes-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110400476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 15:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 29 15:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 29 15:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 50K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652686137788
Running Version 202205111006
[2022-05-16 07:28:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 07:28:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:28:59] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2022-05-16 07:28:59] [INFO ] Transformed 49 places.
[2022-05-16 07:28:59] [INFO ] Transformed 108 transitions.
[2022-05-16 07:28:59] [INFO ] Parsed PT model containing 49 places and 108 transitions in 170 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 3 formulas.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA Eratosthenes-PT-050-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 80/80 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 32 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 32 transition count 78
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 50 place count 32 transition count 32
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 24 transition count 24
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 24 transition count 24
Applied a total of 66 rules in 13 ms. Remains 24 /34 variables (removed 10) and now considering 24/80 (removed 56) transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:28:59] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 07:28:59] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:28:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:28:59] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 24 rows 24 cols
[2022-05-16 07:28:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:28:59] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/34 places, 24/80 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/34 places, 24/80 transitions.
Support contains 23 out of 24 places after structural reductions.
[2022-05-16 07:28:59] [INFO ] Flatten gal took : 15 ms
[2022-05-16 07:28:59] [INFO ] Flatten gal took : 3 ms
[2022-05-16 07:28:59] [INFO ] Input system was already deterministic with 24 transitions.
Support contains 22 out of 24 places (down from 23) after GAL structural reductions.
Finished random walk after 33 steps, including 0 resets, run visited all 24 properties in 133 ms. (steps per millisecond=0 )
FORMULA Eratosthenes-PT-050-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 24
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(F((!X(p0)&&p1)))))||X(p2)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 4 transition count 4
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 4 transition count 4
Applied a total of 40 rules in 1 ms. Remains 4 /24 variables (removed 20) and now considering 4/24 (removed 20) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:00] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:00] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:00] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:00] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:00] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/24 places, 4/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/24 places, 4/24 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LT s3 1), p1:(LT s2 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20417 reset in 156 ms.
Product exploration explored 100000 steps with 20504 reset in 91 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true, (F (G p2)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) p0)
Knowledge based reduction with 5 factoid took 442 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-050-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-00 finished in 1199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((!G((p0 U G(p1))) U p2)))&&F(p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Graph (complete) has 0 edges and 24 vertex of which 4 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 6 ms. Remains 4 /24 variables (removed 20) and now considering 4/24 (removed 20) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:01] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:01] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-16 07:29:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:01] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:29:01] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/24 places, 4/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/24 places, 4/24 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p0) p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s3 1)), p1:(GEQ s0 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 3 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-01 finished in 247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Graph (complete) has 0 edges and 24 vertex of which 2 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /24 variables (removed 22) and now considering 2/24 (removed 22) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:29:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:01] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:29:01] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:29:01] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-16 07:29:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:29:01] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 07:29:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/24 places, 2/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/24 places, 2/24 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 39953 reset in 139 ms.
Product exploration explored 100000 steps with 40022 reset in 99 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-050-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-03 finished in 489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!G(p0)) U G(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 4 transition count 4
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 4 transition count 4
Applied a total of 40 rules in 2 ms. Remains 4 /24 variables (removed 20) and now considering 4/24 (removed 20) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:02] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:29:02] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:02] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/24 places, 4/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/24 places, 4/24 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-04 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=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s3 1), p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 16037 reset in 54 ms.
Product exploration explored 100000 steps with 16054 reset in 52 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 1 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Graph (complete) has 0 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/4 (removed 1) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:29:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:03] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:29:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:03] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-16 07:29:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:29:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:03] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/4 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/4 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (F (G (NOT p1)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p1, (F (G (NOT p1)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-04 finished in 1483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(G(p1))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 3 transition count 3
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 3 transition count 3
Applied a total of 42 rules in 2 ms. Remains 3 /24 variables (removed 21) and now considering 3/24 (removed 21) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:29:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:29:03] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:29:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:29:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:03] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/24 places, 3/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/24 places, 3/24 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s0 1), p1:(LT s1 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 69 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-05 finished in 220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(X(X(!X((X(p0) U !p2)))))&&p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5 transition count 5
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5 transition count 5
Applied a total of 38 rules in 2 ms. Remains 5 /24 variables (removed 19) and now considering 5/24 (removed 19) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:04] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/24 places, 5/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/24 places, 5/24 transitions.
Stuttering acceptance computed with spot in 4758 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 9}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 10}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 3}, { cond=p2, acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 5}, { cond=p1, acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 14}, { cond=(AND p0 p1), acceptance={0} source=10 dest: 15}], [{ cond=true, acceptance={} source=11 dest: 16}], [{ cond=(NOT p1), acceptance={} source=12 dest: 6}, { cond=p1, acceptance={} source=12 dest: 17}], [{ cond=(NOT p1), acceptance={} source=13 dest: 16}, { cond=p1, acceptance={} source=13 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 19}, { cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 20}, { cond=(AND p0 (NOT p1)), acceptance={0} source=14 dest: 21}, { cond=(AND p0 p1), acceptance={0} source=14 dest: 22}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 23}, { cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 24}, { cond=(AND p0 (NOT p1)), acceptance={0} source=15 dest: 25}, { cond=(AND p0 p1), acceptance={0} source=15 dest: 26}], [{ cond=true, acceptance={} source=16 dest: 27}], [{ cond=true, acceptance={} source=17 dest: 28}], [{ cond=true, acceptance={} source=18 dest: 29}], [{ cond=(NOT p1), acceptance={} source=19 dest: 7}, { cond=p1, acceptance={} source=19 dest: 30}], [{ cond=(NOT p1), acceptance={} source=20 dest: 28}, { cond=p1, acceptance={} source=20 dest: 31}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=21 dest: 32}, { cond=(AND (NOT p0) p1), acceptance={} source=21 dest: 33}, { cond=(AND p0 (NOT p1)), acceptance={0} source=21 dest: 34}, { cond=(AND p0 p1), acceptance={0} source=21 dest: 35}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=22 dest: 36}, { cond=(AND (NOT p0) p1), acceptance={} source=22 dest: 37}, { cond=(AND p0 (NOT p1)), acceptance={0} source=22 dest: 38}, { cond=(AND p0 p1), acceptance={0} source=22 dest: 39}], [{ cond=(NOT p1), acceptance={} source=23 dest: 27}, { cond=p1, acceptance={} source=23 dest: 40}], [{ cond=(NOT p1), acceptance={} source=24 dest: 29}, { cond=p1, acceptance={} source=24 dest: 41}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=25 dest: 42}, { cond=(AND (NOT p0) p1), acceptance={} source=25 dest: 43}, { cond=(AND p0 (NOT p1)), acceptance={0} source=25 dest: 44}, { cond=(AND p0 p1), acceptance={0} source=25 dest: 45}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=26 dest: 46}, { cond=(AND (NOT p0) p1), acceptance={} source=26 dest: 47}, { cond=(AND p0 (NOT p1)), acceptance={0} source=26 dest: 48}, { cond=(AND p0 p1), acceptance={0} source=26 dest: 49}], [{ cond=(NOT p2), acceptance={} source=27 dest: 7}, { cond=p2, acceptance={} source=27 dest: 8}], [{ cond=(NOT p2), acceptance={} source=28 dest: 6}, { cond=p2, acceptance={} source=28 dest: 50}], [{ cond=(NOT p2), acceptance={} source=29 dest: 27}, { cond=p2, acceptance={} source=29 dest: 50}], [{ cond=(NOT p2), acceptance={} source=30 dest: 5}, { cond=p2, acceptance={} source=30 dest: 51}], [{ cond=(NOT p2), acceptance={} source=31 dest: 16}, { cond=p2, acceptance={} source=31 dest: 52}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=32 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=32 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=32 dest: 8}, { cond=(AND p1 p2), acceptance={} source=32 dest: 53}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=33 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=33 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=33 dest: 51}, { cond=(AND p1 p2), acceptance={} source=33 dest: 54}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=34 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=34 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=34 dest: 9}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=34 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=34 dest: 55}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=34 dest: 56}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=34 dest: 57}, { cond=(AND p0 p1 p2), acceptance={0} source=34 dest: 58}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=35 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=35 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=35 dest: 14}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=35 dest: 15}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=35 dest: 59}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=35 dest: 60}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=35 dest: 61}, { cond=(AND p0 p1 p2), acceptance={0} source=35 dest: 62}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=36 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=36 dest: 17}, { cond=(AND (NOT p1) p2), acceptance={} source=36 dest: 50}, { cond=(AND p1 p2), acceptance={} source=36 dest: 63}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=37 dest: 16}, { cond=(AND p1 (NOT p2)), acceptance={} source=37 dest: 18}, { cond=(AND (NOT p1) p2), acceptance={} source=37 dest: 52}, { cond=(AND p1 p2), acceptance={} source=37 dest: 64}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=38 dest: 19}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=38 dest: 20}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=38 dest: 21}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=38 dest: 22}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=38 dest: 65}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=38 dest: 66}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=38 dest: 67}, { cond=(AND p0 p1 p2), acceptance={0} source=38 dest: 68}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=39 dest: 23}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=39 dest: 24}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=39 dest: 25}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=39 dest: 26}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=39 dest: 69}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=39 dest: 70}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=39 dest: 71}, { cond=(AND p0 p1 p2), acceptance={0} source=39 dest: 72}], [{ cond=(NOT p2), acceptance={} source=40 dest: 28}, { cond=p2, acceptance={} source=40 dest: 51}], [{ cond=(NOT p2), acceptance={} source=41 dest: 29}, { cond=p2, acceptance={} source=41 dest: 52}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=42 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=42 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=42 dest: 30}, { cond=(AND p1 p2), acceptance={} source=42 dest: 53}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=43 dest: 28}, { cond=(AND p1 (NOT p2)), acceptance={} source=43 dest: 31}, { cond=(AND (NOT p1) p2), acceptance={} source=43 dest: 51}, { cond=(AND p1 p2), acceptance={} source=43 dest: 54}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=44 dest: 32}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=44 dest: 33}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=44 dest: 34}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=44 dest: 35}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=44 dest: 55}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=44 dest: 56}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=44 dest: 57}, { cond=(AND p0 p1 p2), acceptance={0} source=44 dest: 58}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=45 dest: 36}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=45 dest: 37}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=45 dest: 38}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=45 dest: 39}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=45 dest: 59}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=45 dest: 60}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=45 dest: 61}, { cond=(AND p0 p1 p2), acceptance={0} source=45 dest: 62}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=46 dest: 27}, { cond=(AND p1 (NOT p2)), acceptance={} source=46 dest: 40}, { cond=(AND (NOT p1) p2), acceptance={} source=46 dest: 50}, { cond=(AND p1 p2), acceptance={} source=46 dest: 63}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=47 dest: 29}, { cond=(AND p1 (NOT p2)), acceptance={} source=47 dest: 41}, { cond=(AND (NOT p1) p2), acceptance={} source=47 dest: 52}, { cond=(AND p1 p2), acceptance={} source=47 dest: 64}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=48 dest: 42}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=48 dest: 43}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=48 dest: 44}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=48 dest: 45}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=48 dest: 65}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=48 dest: 66}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=48 dest: 67}, { cond=(AND p0 p1 p2), acceptance={0} source=48 dest: 68}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=49 dest: 46}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=49 dest: 47}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=49 dest: 48}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=49 dest: 49}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=49 dest: 69}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=49 dest: 70}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=49 dest: 71}, { cond=(AND p0 p1 p2), acceptance={0} source=49 dest: 72}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=50 dest: 7}, { cond=(AND p0 p2), acceptance={} source=50 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=51 dest: 6}, { cond=(AND p0 p2), acceptance={} source=51 dest: 50}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=52 dest: 27}, { cond=(AND p0 p2), acceptance={} source=52 dest: 50}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=53 dest: 5}, { cond=(AND p0 p2), acceptance={} source=53 dest: 51}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=54 dest: 16}, { cond=(AND p0 p2), acceptance={} source=54 dest: 52}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=55 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=55 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=55 dest: 8}, { cond=(AND p0 p1 p2), acceptance={} source=55 dest: 53}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=56 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=56 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=56 dest: 51}, { cond=(AND p0 p1 p2), acceptance={} source=56 dest: 54}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=57 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=57 dest: 10}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=57 dest: 57}, { cond=(AND p0 p1 p2), acceptance={} source=57 dest: 58}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=58 dest: 14}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=58 dest: 15}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=58 dest: 61}, { cond=(AND p0 p1 p2), acceptance={} source=58 dest: 62}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=59 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=59 dest: 17}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=59 dest: 50}, { cond=(AND p0 p1 p2), acceptance={} source=59 dest: 63}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=60 dest: 16}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=60 dest: 18}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=60 dest: 52}, { cond=(AND p0 p1 p2), acceptance={} source=60 dest: 64}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=61 dest: 21}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=61 dest: 22}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=61 dest: 67}, { cond=(AND p0 p1 p2), acceptance={} source=61 dest: 68}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=62 dest: 25}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=62 dest: 26}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=62 dest: 71}, { cond=(AND p0 p1 p2), acceptance={} source=62 dest: 72}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=63 dest: 28}, { cond=(AND p0 p2), acceptance={} source=63 dest: 51}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=64 dest: 29}, { cond=(AND p0 p2), acceptance={} source=64 dest: 52}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=65 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=65 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=65 dest: 30}, { cond=(AND p0 p1 p2), acceptance={} source=65 dest: 53}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=66 dest: 28}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=66 dest: 31}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=66 dest: 51}, { cond=(AND p0 p1 p2), acceptance={} source=66 dest: 54}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=67 dest: 34}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=67 dest: 35}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=67 dest: 57}, { cond=(AND p0 p1 p2), acceptance={} source=67 dest: 58}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=68 dest: 38}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=68 dest: 39}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=68 dest: 61}, { cond=(AND p0 p1 p2), acceptance={} source=68 dest: 62}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=69 dest: 27}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=69 dest: 40}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=69 dest: 50}, { cond=(AND p0 p1 p2), acceptance={} source=69 dest: 63}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=70 dest: 29}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=70 dest: 41}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=70 dest: 52}, { cond=(AND p0 p1 p2), acceptance={} source=70 dest: 64}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=71 dest: 44}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=71 dest: 45}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=71 dest: 67}, { cond=(AND p0 p1 p2), acceptance={} source=71 dest: 68}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=72 dest: 48}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=72 dest: 49}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=72 dest: 71}, { cond=(AND p0 p1 p2), acceptance={} source=72 dest: 72}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1)), p1:(AND (GEQ s1 1) (GEQ s4 1)), p2:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-06 finished in 4858 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X((F(p0)||G(!X(p1))||p2)) U p0)))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 4 transition count 4
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 4 transition count 4
Applied a total of 40 rules in 1 ms. Remains 4 /24 variables (removed 20) and now considering 4/24 (removed 20) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:08] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:29:08] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/24 places, 4/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/24 places, 4/24 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-07 finished in 199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(F(X(!(p0 U p1)))))||(X(p2)&&!p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5 transition count 5
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5 transition count 5
Applied a total of 38 rules in 3 ms. Remains 5 /24 variables (removed 19) and now considering 5/24 (removed 19) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:29:09] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:09] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/24 places, 5/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/24 places, 5/24 transitions.
Stuttering acceptance computed with spot in 183 ms :[p1, (AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), p1]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LT s3 1), p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32084 reset in 78 ms.
Product exploration explored 100000 steps with 32026 reset in 88 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p0 p1), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 4 factoid took 261 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-050-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-08 finished in 718 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||G(p1)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 4 transition count 4
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 4 transition count 4
Applied a total of 40 rules in 3 ms. Remains 4 /24 variables (removed 20) and now considering 4/24 (removed 20) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:09] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:29:09] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:09] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/24 places, 4/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/24 places, 4/24 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s1 1) (GEQ s2 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 42 steps with 4 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-09 finished in 176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Graph (complete) has 0 edges and 24 vertex of which 5 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /24 variables (removed 19) and now considering 5/24 (removed 19) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:10] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:29:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-16 07:29:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:29:10] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 07:29:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/24 places, 5/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/24 places, 5/24 transitions.
Stuttering acceptance computed with spot in 418 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s2 1) (AND (GEQ s1 1) (GEQ s4 1))), p0:(OR (LT s0 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-11 finished in 511 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Graph (complete) has 0 edges and 24 vertex of which 2 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /24 variables (removed 22) and now considering 2/24 (removed 22) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:29:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:10] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:29:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 07:29:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:29:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/24 places, 2/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/24 places, 2/24 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 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 50000 reset in 39 ms.
Product exploration explored 100000 steps with 50000 reset in 40 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-050-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-12 finished in 275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 4 transition count 4
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 4 transition count 4
Applied a total of 40 rules in 0 ms. Remains 4 /24 variables (removed 20) and now considering 4/24 (removed 20) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:10] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:10] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:29:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:29:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/24 places, 4/24 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/24 places, 4/24 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (AND (GEQ s2 1) (GEQ s3 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][false, false]]
Product exploration explored 100000 steps with 30747 reset in 73 ms.
Product exploration explored 100000 steps with 30698 reset in 46 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-050-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-15 finished in 404 ms.
All properties solved by simple procedures.
Total runtime 11928 ms.
BK_STOP 1652686151593
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Eratosthenes-PT-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Eratosthenes-PT-050, 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 r078-tall-165260110400476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-050.tgz
mv Eratosthenes-PT-050 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 ;