About the Execution of ITS-Tools for Eratosthenes-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 336.092 | 10573.00 | 17252.00 | 125.70 | TFTTFFFTFFFFFTTT | 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-165260110400484.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-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110400484
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.8K Apr 29 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 29 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 15:58 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.9K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K 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 126K 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-100-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652686204347
Running Version 202205111006
[2022-05-16 07:30:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 07:30:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:30:05] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-16 07:30:05] [INFO ] Transformed 99 places.
[2022-05-16 07:30:05] [INFO ] Transformed 283 transitions.
[2022-05-16 07:30:05] [INFO ] Parsed PT model containing 99 places and 283 transitions in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA Eratosthenes-PT-100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 211/211 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 61 transition count 198
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 61 transition count 198
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 163 place count 61 transition count 61
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 196 place count 28 transition count 28
Iterating global reduction 0 with 33 rules applied. Total rules applied 229 place count 28 transition count 28
Applied a total of 229 rules in 16 ms. Remains 28 /74 variables (removed 46) and now considering 28/211 (removed 183) transitions.
// Phase 1: matrix 28 rows 28 cols
[2022-05-16 07:30:05] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 07:30:05] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 28 rows 28 cols
[2022-05-16 07:30:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:06] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 28 cols
[2022-05-16 07:30:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:06] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/74 places, 28/211 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/74 places, 28/211 transitions.
Support contains 27 out of 28 places after structural reductions.
[2022-05-16 07:30:06] [INFO ] Flatten gal took : 14 ms
[2022-05-16 07:30:06] [INFO ] Flatten gal took : 4 ms
[2022-05-16 07:30:06] [INFO ] Input system was already deterministic with 28 transitions.
Finished random walk after 87 steps, including 1 resets, run visited all 23 properties in 24 ms. (steps per millisecond=3 )
Computed a total of 28 stabilizing places and 28 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 28
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' '!(G((X((X(p0)||F(p1)))||F(p2))))'
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 5 transition count 5
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 5 transition count 5
Applied a total of 46 rules in 1 ms. Remains 5 /28 variables (removed 23) and now considering 5/28 (removed 23) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:06] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:06] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:06] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/28 places, 5/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/28 places, 5/28 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s3 1)), p1:(LT s1 1), p0:(OR (LT s2 1) (LT s4 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][false, false, false, false]]
Product exploration explored 100000 steps with 19892 reset in 185 ms.
Product exploration explored 100000 steps with 19902 reset in 100 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 p2 (NOT p1) (NOT p0)), (F (G (NOT p2))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-00 finished in 913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(X(p1))))'
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 4 transition count 4
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 4 transition count 4
Applied a total of 48 rules in 2 ms. Remains 4 /28 variables (removed 24) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:07] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/28 places, 4/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/28 places, 4/28 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1)), p0:(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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-04 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2 transition count 2
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2 transition count 2
Applied a total of 52 rules in 2 ms. Remains 2 /28 variables (removed 26) and now considering 2/28 (removed 26) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:07] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:07] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/28 places, 2/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/28 places, 2/28 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-05 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:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-05 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X((X(p0)&&p1)))))'
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 6 transition count 6
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 6 transition count 6
Applied a total of 44 rules in 1 ms. Remains 6 /28 variables (removed 22) and now considering 6/28 (removed 22) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:30:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:08] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:30:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:08] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 07:30:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:08] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/28 places, 6/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/28 places, 6/28 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LT s5 1), p0:(OR (AND (OR (LT s1 1) (LT s2 1)) (GEQ s1 1) (GEQ s2 1)) (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-06 finished in 223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F((!(p0 U (F(p1)||p2))||p3)))))'
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Graph (complete) has 0 edges and 28 vertex of which 4 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 4 ms. Remains 4 /28 variables (removed 24) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:08] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 07:30:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/28 places, 4/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/28 places, 4/28 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), (AND p1 (NOT p3))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND (NOT p3) p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p3) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1)), p3:(GEQ s1 1), p2:(AND (GEQ s0 1) (GEQ s2 1)), p1:(GEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 20000 reset in 165 ms.
Product exploration explored 100000 steps with 20000 reset in 131 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 p0 p3 p2 p1), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) p1))), (X (OR (AND p2 (NOT p3)) (AND (NOT p3) p1))), (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 611 ms. Reduced automaton from 3 states, 8 edges and 4 AP to 3 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (AND p1 (NOT p3))]
Incomplete random walk after 10000 steps, including 2000 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 714 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:09] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p2 p1), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1))), (G (NOT (AND (NOT p3) (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) p1))), (X (OR (AND p2 (NOT p3)) (AND (NOT p3) p1))), (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (F (AND (NOT p3) (NOT p1) (NOT p2))), (F (OR (AND (NOT p3) p1) (AND (NOT p3) p2))), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p3) p1)), (F (OR (AND (NOT p3) p1) (AND (NOT p3) p2) (AND (NOT p3) p0))), (F (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 791 ms. Reduced automaton from 3 states, 8 edges and 4 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 132 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (AND p1 (NOT p3))]
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:10] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:10] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-16 07:30:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 4/4 transitions.
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 p3 p2), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
Knowledge based reduction with 7 factoid took 467 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (AND p1 (NOT p3))]
Finished random walk after 12 steps, including 2 resets, run visited all 4 properties in 5 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p3 p2), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (AND (NOT p1) (NOT p3))), (F (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (F (AND p1 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 7 factoid took 584 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 140 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 20000 reset in 88 ms.
Product exploration explored 100000 steps with 20000 reset in 94 ms.
Built C files in :
/tmp/ltsmin5966691707732408859
[2022-05-16 07:30:12] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-16 07:30:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:30:12] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-16 07:30:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:30:12] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-16 07:30:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:30:12] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5966691707732408859
Running compilation step : cd /tmp/ltsmin5966691707732408859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin5966691707732408859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5966691707732408859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12958470383968218837.hoa' '--buchi-type=spotba'
LTSmin run took 65 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Eratosthenes-PT-100-LTLFireability-07 finished in 4643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(X((F(X(G(p0)))&&p1)))))))'
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Graph (complete) has 0 edges and 28 vertex of which 3 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /28 variables (removed 25) and now considering 3/28 (removed 25) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:13] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:13] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 07:30:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/28 places, 3/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/28 places, 3/28 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s2 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-08 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||G(((G(p3)||p1)&&p2))))'
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 5 transition count 5
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 5 transition count 5
Applied a total of 46 rules in 2 ms. Remains 5 /28 variables (removed 23) and now considering 5/28 (removed 23) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:13] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/28 places, 5/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/28 places, 5/28 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 p3)), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p3), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) p3 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p1) (NOT p3) p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p3 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s3 1)), p1:(GEQ s4 1), p3:(AND (GEQ s1 1) (GEQ s3 1)), p0:(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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 7 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-10 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U (G(X(p0))||(!p0&&X(p0))))))'
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Graph (complete) has 0 edges and 28 vertex of which 2 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /28 variables (removed 26) and now considering 2/28 (removed 26) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:13] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:13] [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.
[2022-05-16 07:30:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:13] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/28 places, 2/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/28 places, 2/28 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-11 finished in 159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(F((G(p2)||p1)))||p0))))'
Support contains 6 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 7 transition count 7
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 7 transition count 7
Applied a total of 42 rules in 1 ms. Remains 7 /28 variables (removed 21) and now considering 7/28 (removed 21) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:13] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 07:30:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:13] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/28 places, 7/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/28 places, 7/28 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s1 1) (LT s3 1) (LT s4 1)), p1:(OR (LT s2 1) (LT s5 1)), p2:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1509 reset in 73 ms.
Product exploration explored 100000 steps with 1520 reset in 69 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true, (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-100-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-13 finished in 584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(p0)))))'
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 28/28 transitions.
Graph (complete) has 0 edges and 28 vertex of which 1 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Applied a total of 1 rules in 3 ms. Remains 1 /28 variables (removed 27) and now considering 1/28 (removed 27) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:30:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:14] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:30:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-16 07:30:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:30:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:14] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/28 places, 1/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/28 places, 1/28 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-14 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:(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 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-14 finished in 329 ms.
All properties solved by simple procedures.
Total runtime 9008 ms.
BK_STOP 1652686214920
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Eratosthenes-PT-100"
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-100, 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-165260110400484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-100.tgz
mv Eratosthenes-PT-100 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 ;