About the Execution of LoLa+red for QuasiCertifProtocol-COL-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1090.884 | 199194.00 | 235612.00 | 1103.60 | FFFFFFFFTTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948400836.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is QuasiCertifProtocol-COL-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948400836
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:23 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 QuasiCertifProtocol-COL-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678914251865
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 21:04:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 21:04:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:04:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 21:04:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 21:04:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 456 ms
[2023-03-15 21:04:13] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 21:04:14] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-15 21:04:14] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10009 steps, including 318 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 21:04:14] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-15 21:04:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 21:04:15] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:5
[2023-03-15 21:04:15] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :2 real:5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-15 21:04:15] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :2 real:5
[2023-03-15 21:04:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 21:04:15] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-15 21:04:15] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-15 21:04:15] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 7 properties in 5 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2023-03-15 21:04:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-15 21:04:15] [INFO ] Flatten gal took : 40 ms
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 21:04:15] [INFO ] Flatten gal took : 4 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2023-03-15 21:04:15] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 24 ms.
[2023-03-15 21:04:15] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 1824 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 18 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-15 21:04:15] [INFO ] Computed 1562 place invariants in 111 ms
[2023-03-15 21:04:16] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-15 21:04:16] [INFO ] Invariant cache hit.
[2023-03-15 21:04:17] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2023-03-15 21:04:17] [INFO ] Invariant cache hit.
[2023-03-15 21:04:17] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2379 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 1824 out of 1916 places after structural reductions.
[2023-03-15 21:04:18] [INFO ] Flatten gal took : 123 ms
[2023-03-15 21:04:18] [INFO ] Flatten gal took : 100 ms
[2023-03-15 21:04:18] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-15 21:04:19] [INFO ] Invariant cache hit.
[2023-03-15 21:04:20] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 263 ms returned sat
[2023-03-15 21:04:20] [INFO ] After 1146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-15 21:04:21] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 246 ms returned sat
[2023-03-15 21:04:26] [INFO ] After 4268ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-15 21:04:29] [INFO ] After 7364ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 2389 ms.
[2023-03-15 21:04:31] [INFO ] After 11015ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 173 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=34 )
Parikh walk visited 12 properties in 41 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))&&(F(p0) U p2)))))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 308 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-15 21:04:32] [INFO ] Invariant cache hit.
[2023-03-15 21:04:34] [INFO ] Implicit Places using invariants in 2063 ms returned []
[2023-03-15 21:04:34] [INFO ] Invariant cache hit.
[2023-03-15 21:04:38] [INFO ] Implicit Places using invariants and state equation in 3846 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5919 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 87 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6314 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (LT s1825 1) (LT s1824 1) (LT s1823 1) (LT s1822 1) (LT s1829 1) (LT s1828 1) (LT s1827 1) (LT s1826 1) (LT s1821 1) (LT s1820 1) (LT s1819 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 11 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-00 finished in 6794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U p2)))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.22 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1891 transition count 353
Applied a total of 4 rules in 363 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2023-03-15 21:04:39] [INFO ] Computed 1540 place invariants in 52 ms
[2023-03-15 21:04:41] [INFO ] Implicit Places using invariants in 2011 ms returned []
[2023-03-15 21:04:41] [INFO ] Invariant cache hit.
[2023-03-15 21:04:45] [INFO ] Implicit Places using invariants and state equation in 3741 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5757 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 92 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6213 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s1611 1) (GEQ s1612 1) (GEQ s1613 1) (GEQ s1614 1) (GEQ s1615 1) (GEQ s1616 1) (GEQ s1617 1) (GEQ s1618 1) (GEQ s1619 1) (GEQ s1620 1) (GEQ s...], 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, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-01 finished in 6363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 37 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-15 21:04:45] [INFO ] Computed 1562 place invariants in 36 ms
[2023-03-15 21:04:47] [INFO ] Implicit Places using invariants in 1759 ms returned []
[2023-03-15 21:04:47] [INFO ] Invariant cache hit.
[2023-03-15 21:04:50] [INFO ] Implicit Places using invariants and state equation in 3053 ms returned []
Implicit Place search using SMT with State Equation took 4817 ms to find 0 implicit places.
[2023-03-15 21:04:50] [INFO ] Invariant cache hit.
[2023-03-15 21:04:50] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5439 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (OR (LT s0 1) (LT s1841 1)) (OR (LT s0 1) (LT s1842 1)) (OR (LT s0 1) (LT s1843 1)) (OR (LT s0 1) (LT s1844 1)) (OR (LT s0 1) (LT s1845 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3716 reset in 561 ms.
Product exploration explored 100000 steps with 3710 reset in 544 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1855 steps, run visited all 1 properties in 14 ms. (steps per millisecond=132 )
Probabilistic random walk after 1855 steps, saw 1806 distinct states, run finished after 15 ms. (steps per millisecond=123 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 40 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-15 21:04:53] [INFO ] Invariant cache hit.
[2023-03-15 21:04:54] [INFO ] Implicit Places using invariants in 1590 ms returned []
[2023-03-15 21:04:54] [INFO ] Invariant cache hit.
[2023-03-15 21:04:57] [INFO ] Implicit Places using invariants and state equation in 3067 ms returned []
Implicit Place search using SMT with State Equation took 4659 ms to find 0 implicit places.
[2023-03-15 21:04:57] [INFO ] Invariant cache hit.
[2023-03-15 21:04:58] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5284 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1855 steps, run visited all 1 properties in 11 ms. (steps per millisecond=168 )
Probabilistic random walk after 1855 steps, saw 1806 distinct states, run finished after 11 ms. (steps per millisecond=168 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3716 reset in 488 ms.
Product exploration explored 100000 steps with 3720 reset in 517 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.10 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1892 transition count 356
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 220 ms. Remains 1892 /1916 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2023-03-15 21:05:01] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 356 rows 1892 cols
[2023-03-15 21:05:01] [INFO ] Computed 1540 place invariants in 24 ms
[2023-03-15 21:05:01] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1916 places, 356/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 925 ms. Remains : 1892/1916 places, 356/356 transitions.
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 36 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-15 21:05:01] [INFO ] Computed 1562 place invariants in 30 ms
[2023-03-15 21:05:03] [INFO ] Implicit Places using invariants in 1699 ms returned []
[2023-03-15 21:05:03] [INFO ] Invariant cache hit.
[2023-03-15 21:05:06] [INFO ] Implicit Places using invariants and state equation in 2925 ms returned []
Implicit Place search using SMT with State Equation took 4628 ms to find 0 implicit places.
[2023-03-15 21:05:06] [INFO ] Invariant cache hit.
[2023-03-15 21:05:07] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5258 ms. Remains : 1916/1916 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-03 finished in 21857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 69 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-15 21:05:07] [INFO ] Invariant cache hit.
[2023-03-15 21:05:09] [INFO ] Implicit Places using invariants in 2119 ms returned []
[2023-03-15 21:05:09] [INFO ] Invariant cache hit.
[2023-03-15 21:05:13] [INFO ] Implicit Places using invariants and state equation in 3899 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6020 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6151 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1888 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3716 reset in 275 ms.
Product exploration explored 100000 steps with 3716 reset in 239 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1803 steps, run visited all 1 properties in 7 ms. (steps per millisecond=257 )
Probabilistic random walk after 1803 steps, saw 1756 distinct states, run finished after 8 ms. (steps per millisecond=225 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 67 ms :[true, p0, p0]
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-15 21:05:15] [INFO ] Computed 1540 place invariants in 133 ms
[2023-03-15 21:05:17] [INFO ] Implicit Places using invariants in 2138 ms returned []
[2023-03-15 21:05:17] [INFO ] Invariant cache hit.
[2023-03-15 21:05:21] [INFO ] Implicit Places using invariants and state equation in 3883 ms returned []
Implicit Place search using SMT with State Equation took 6023 ms to find 0 implicit places.
[2023-03-15 21:05:21] [INFO ] Invariant cache hit.
[2023-03-15 21:05:21] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6677 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1803 steps, run visited all 1 properties in 8 ms. (steps per millisecond=225 )
Probabilistic random walk after 1803 steps, saw 1756 distinct states, run finished after 8 ms. (steps per millisecond=225 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 90 ms :[true, p0, p0]
Product exploration explored 100000 steps with 3715 reset in 228 ms.
Product exploration explored 100000 steps with 3712 reset in 259 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 144 are kept as prefixes of interest. Removing 1749 places using SCC suffix rule.8 ms
Discarding 1749 places :
Also discarding 140 output transitions
Drop transitions removed 140 transitions
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 144 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 144 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 117 rules in 16 ms. Remains 144 /1893 variables (removed 1749) and now considering 102/356 (removed 254) transitions.
[2023-03-15 21:05:23] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 102 rows 144 cols
[2023-03-15 21:05:23] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-15 21:05:23] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/1893 places, 102/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 144/1893 places, 102/356 transitions.
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-15 21:05:23] [INFO ] Computed 1540 place invariants in 113 ms
[2023-03-15 21:05:25] [INFO ] Implicit Places using invariants in 2168 ms returned []
[2023-03-15 21:05:25] [INFO ] Invariant cache hit.
[2023-03-15 21:05:29] [INFO ] Implicit Places using invariants and state equation in 3911 ms returned []
Implicit Place search using SMT with State Equation took 6083 ms to find 0 implicit places.
[2023-03-15 21:05:29] [INFO ] Invariant cache hit.
[2023-03-15 21:05:30] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6720 ms. Remains : 1893/1893 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-04 finished in 22849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 143 are kept as prefixes of interest. Removing 1773 places using SCC suffix rule.6 ms
Discarding 1773 places :
Also discarding 142 output transitions
Drop transitions removed 142 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 142 transition count 99
Applied a total of 115 rules in 14 ms. Remains 142 /1916 variables (removed 1774) and now considering 99/356 (removed 257) transitions.
// Phase 1: matrix 99 rows 142 cols
[2023-03-15 21:05:30] [INFO ] Computed 44 place invariants in 0 ms
[2023-03-15 21:05:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-15 21:05:30] [INFO ] Invariant cache hit.
[2023-03-15 21:05:30] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 156 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1916 places, 99/356 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 119/1916 places, 99/356 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), 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 (GEQ s117 1) (AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-06 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((F(p0)||X(F(p1))))||(p2&&X((F(p0)||X(F(p1))))))))))'
Support contains 48 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-15 21:05:30] [INFO ] Computed 1562 place invariants in 30 ms
[2023-03-15 21:05:32] [INFO ] Implicit Places using invariants in 1984 ms returned []
[2023-03-15 21:05:32] [INFO ] Invariant cache hit.
[2023-03-15 21:05:35] [INFO ] Implicit Places using invariants and state equation in 3221 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5209 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5333 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(LT s1891 1), p0:(AND (OR (LT s0 1) (LT s1781 1)) (OR (LT s0 1) (LT s1780 1)) (OR (LT s0 1) (LT s1779 1)) (OR (LT s0 1) (LT s1778 1)) (OR (LT s0 1) (LT...], 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 23807 reset in 659 ms.
Product exploration explored 100000 steps with 23786 reset in 636 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 p0 p1), (F (G p2)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-08 finished in 7234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((F(p2)||p1))))))'
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 37 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-15 21:05:37] [INFO ] Invariant cache hit.
[2023-03-15 21:05:39] [INFO ] Implicit Places using invariants in 1645 ms returned []
[2023-03-15 21:05:39] [INFO ] Invariant cache hit.
[2023-03-15 21:05:41] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4040 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 32 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4109 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s1634 1) (GEQ s1635 1) (GEQ s1636 1) (GEQ s1637 1) (GEQ s1638 1) (GEQ s1639 1) (GEQ s1640 1) (GEQ s1641 1) (GEQ s1642 1) (GEQ s1643 1) (GEQ s...], 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]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 4316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F(G(p1)))) U p2))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 105 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2023-03-15 21:05:42] [INFO ] Computed 1540 place invariants in 19 ms
[2023-03-15 21:05:43] [INFO ] Implicit Places using invariants in 1383 ms returned []
[2023-03-15 21:05:43] [INFO ] Invariant cache hit.
[2023-03-15 21:05:45] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 3680 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 44 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3829 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), p0, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s1696 1) (GEQ s1742 1)) (AND (GEQ s1688 1) (GEQ s1734 1)) (AND (GEQ s1701 1) (GEQ s1747 1)) (AND (GEQ s1690 1) (GEQ s1736 1)) (AND (GEQ s...], 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 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-12 finished in 4023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 24 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-15 21:05:46] [INFO ] Computed 1562 place invariants in 31 ms
[2023-03-15 21:05:48] [INFO ] Implicit Places using invariants in 2118 ms returned []
[2023-03-15 21:05:48] [INFO ] Invariant cache hit.
[2023-03-15 21:05:51] [INFO ] Implicit Places using invariants and state equation in 3500 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5626 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5749 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (OR (LT s0 1) (LT s1739 1)) (OR (LT s0 1) (LT s1740 1)) (OR (LT s0 1) (LT s1737 1)) (OR (LT s0 1) (LT s1738 1)) (OR (LT s0 1) (LT s1735 1)) (OR (L...], 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]]
Product exploration explored 100000 steps with 20000 reset in 511 ms.
Product exploration explored 100000 steps with 20000 reset in 520 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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, true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-13 finished in 7360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&G((X(p1)&&F((!p2&&X(G((!p2||G(!p3))))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-15 21:05:53] [INFO ] Invariant cache hit.
[2023-03-15 21:05:55] [INFO ] Implicit Places using invariants in 1996 ms returned []
[2023-03-15 21:05:55] [INFO ] Invariant cache hit.
[2023-03-15 21:05:59] [INFO ] Implicit Places using invariants and state equation in 3912 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5911 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6036 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) p2 p0), p0, (OR (NOT p1) p2), p2, (AND p2 p3), true, (AND p2 p3), (AND p2 p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p2 p3), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p2 p3), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=6 dest: 7}], [{ cond=(AND p2 p3), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s1677 1) (GEQ s1792 1)) (AND (GEQ s1661 1) (GEQ s1776 1)) (AND (GEQ s1664 1) (GEQ s1779 1)) (AND (GEQ s1669 1) (GEQ s1784 1)) (AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3713 reset in 293 ms.
Product exploration explored 100000 steps with 3711 reset in 300 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1014 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1855 steps, run visited all 1 properties in 8 ms. (steps per millisecond=231 )
Probabilistic random walk after 1855 steps, saw 1806 distinct states, run finished after 8 ms. (steps per millisecond=231 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 24 factoid took 808 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p1), (NOT p1)]
Support contains 23 out of 1893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-15 21:06:02] [INFO ] Computed 1540 place invariants in 116 ms
[2023-03-15 21:06:04] [INFO ] Implicit Places using invariants in 2131 ms returned []
[2023-03-15 21:06:04] [INFO ] Invariant cache hit.
[2023-03-15 21:06:08] [INFO ] Implicit Places using invariants and state equation in 3746 ms returned []
Implicit Place search using SMT with State Equation took 5879 ms to find 0 implicit places.
[2023-03-15 21:06:08] [INFO ] Invariant cache hit.
[2023-03-15 21:06:09] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6549 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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, (X p1), (X (X p1)), true, (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1855 steps, run visited all 1 properties in 8 ms. (steps per millisecond=231 )
Probabilistic random walk after 1855 steps, saw 1806 distinct states, run finished after 8 ms. (steps per millisecond=231 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1)), true, (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3712 reset in 326 ms.
Product exploration explored 100000 steps with 3716 reset in 346 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (NOT p1)]
Support contains 23 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1869 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1869 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 141 ms. Remains 1869 /1893 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2023-03-15 21:06:11] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 356 rows 1869 cols
[2023-03-15 21:06:11] [INFO ] Computed 1518 place invariants in 147 ms
[2023-03-15 21:06:11] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1893 places, 356/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 909 ms. Remains : 1869/1893 places, 356/356 transitions.
Support contains 23 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-15 21:06:12] [INFO ] Computed 1540 place invariants in 109 ms
[2023-03-15 21:06:14] [INFO ] Implicit Places using invariants in 2116 ms returned []
[2023-03-15 21:06:14] [INFO ] Invariant cache hit.
[2023-03-15 21:06:18] [INFO ] Implicit Places using invariants and state equation in 3961 ms returned []
Implicit Place search using SMT with State Equation took 6080 ms to find 0 implicit places.
[2023-03-15 21:06:18] [INFO ] Invariant cache hit.
[2023-03-15 21:06:18] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6735 ms. Remains : 1893/1893 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-14 finished in 25440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.5 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 148 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2023-03-15 21:06:18] [INFO ] Computed 1540 place invariants in 20 ms
[2023-03-15 21:06:20] [INFO ] Implicit Places using invariants in 2022 ms returned []
[2023-03-15 21:06:20] [INFO ] Invariant cache hit.
[2023-03-15 21:06:24] [INFO ] Implicit Places using invariants and state equation in 3716 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5740 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 74 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5963 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s1696 1) (GEQ s1742 1)) (AND (GEQ s1688 1) (GEQ s1734 1)) (AND (GEQ s1701 1) (GEQ s1747 1)) (AND (GEQ s1690 1) (GEQ s1736 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-15 finished in 6017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-03
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.10 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1889 transition count 351
Applied a total of 5 rules in 86 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2023-03-15 21:06:25] [INFO ] Computed 1540 place invariants in 33 ms
[2023-03-15 21:06:26] [INFO ] Implicit Places using invariants in 1740 ms returned []
[2023-03-15 21:06:26] [INFO ] Invariant cache hit.
[2023-03-15 21:06:29] [INFO ] Implicit Places using invariants and state equation in 2836 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4580 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1866/1916 places, 351/356 transitions.
Applied a total of 0 rules in 42 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4709 ms. Remains : 1866/1916 places, 351/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (OR (LT s0 1) (LT s1795 1)) (OR (LT s0 1) (LT s1796 1)) (OR (LT s0 1) (LT s1797 1)) (OR (LT s0 1) (LT s1798 1)) (OR (LT s0 1) (LT s1799 1)) (O...], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3476 reset in 538 ms.
Product exploration explored 100000 steps with 3474 reset in 547 ms.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 transition count 351
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, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 347 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1779 steps, run visited all 1 properties in 11 ms. (steps per millisecond=161 )
Probabilistic random walk after 1779 steps, saw 1733 distinct states, run finished after 11 ms. (steps per millisecond=161 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 30 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
// Phase 1: matrix 351 rows 1866 cols
[2023-03-15 21:06:31] [INFO ] Computed 1518 place invariants in 29 ms
[2023-03-15 21:06:33] [INFO ] Implicit Places using invariants in 1628 ms returned []
[2023-03-15 21:06:33] [INFO ] Invariant cache hit.
[2023-03-15 21:06:36] [INFO ] Implicit Places using invariants and state equation in 2778 ms returned []
Implicit Place search using SMT with State Equation took 4407 ms to find 0 implicit places.
[2023-03-15 21:06:36] [INFO ] Invariant cache hit.
[2023-03-15 21:06:36] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5024 ms. Remains : 1866/1866 places, 351/351 transitions.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 transition count 351
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, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1779 steps, run visited all 1 properties in 10 ms. (steps per millisecond=177 )
Probabilistic random walk after 1779 steps, saw 1733 distinct states, run finished after 10 ms. (steps per millisecond=177 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3471 reset in 531 ms.
Product exploration explored 100000 steps with 3474 reset in 550 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 48 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2023-03-15 21:06:39] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 21:06:39] [INFO ] Invariant cache hit.
[2023-03-15 21:06:40] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 641 ms. Remains : 1866/1866 places, 351/351 transitions.
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 26 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2023-03-15 21:06:40] [INFO ] Invariant cache hit.
[2023-03-15 21:06:41] [INFO ] Implicit Places using invariants in 1603 ms returned []
[2023-03-15 21:06:41] [INFO ] Invariant cache hit.
[2023-03-15 21:06:44] [INFO ] Implicit Places using invariants and state equation in 2873 ms returned []
Implicit Place search using SMT with State Equation took 4479 ms to find 0 implicit places.
[2023-03-15 21:06:44] [INFO ] Invariant cache hit.
[2023-03-15 21:06:45] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5108 ms. Remains : 1866/1866 places, 351/351 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-03 finished in 20396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-04
Stuttering acceptance computed with spot in 88 ms :[true, p0, p0]
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 144 are kept as prefixes of interest. Removing 1772 places using SCC suffix rule.5 ms
Discarding 1772 places :
Also discarding 140 output transitions
Drop transitions removed 140 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 143 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 142 transition count 99
Applied a total of 118 rules in 13 ms. Remains 142 /1916 variables (removed 1774) and now considering 99/356 (removed 257) transitions.
// Phase 1: matrix 99 rows 142 cols
[2023-03-15 21:06:45] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-15 21:06:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-15 21:06:45] [INFO ] Invariant cache hit.
[2023-03-15 21:06:45] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 180 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 119/1916 places, 99/356 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 195 ms. Remains : 119/1916 places, 99/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s116 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3441 reset in 229 ms.
Product exploration explored 100000 steps with 3430 reset in 244 ms.
Computed a total of 119 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 119 transition count 99
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1525 steps, run visited all 1 properties in 6 ms. (steps per millisecond=254 )
Probabilistic random walk after 1525 steps, saw 1480 distinct states, run finished after 6 ms. (steps per millisecond=254 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 71 ms :[true, p0, p0]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 119 cols
[2023-03-15 21:06:46] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-15 21:06:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-15 21:06:46] [INFO ] Invariant cache hit.
[2023-03-15 21:06:46] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-15 21:06:46] [INFO ] Invariant cache hit.
[2023-03-15 21:06:46] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 119/119 places, 99/99 transitions.
Computed a total of 119 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 119 transition count 99
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 321 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1525 steps, run visited all 1 properties in 6 ms. (steps per millisecond=254 )
Probabilistic random walk after 1525 steps, saw 1480 distinct states, run finished after 6 ms. (steps per millisecond=254 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 62 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Product exploration explored 100000 steps with 3434 reset in 231 ms.
Product exploration explored 100000 steps with 3435 reset in 245 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 63 ms :[true, p0, p0]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-15 21:06:48] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 21:06:48] [INFO ] Invariant cache hit.
[2023-03-15 21:06:48] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 119/119 places, 99/99 transitions.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-15 21:06:48] [INFO ] Invariant cache hit.
[2023-03-15 21:06:48] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-15 21:06:48] [INFO ] Invariant cache hit.
[2023-03-15 21:06:48] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-15 21:06:48] [INFO ] Invariant cache hit.
[2023-03-15 21:06:48] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 119/119 places, 99/99 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-04 finished in 3242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&G((X(p1)&&F((!p2&&X(G((!p2||G(!p3))))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-14
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) p2 p0), p0, (OR (NOT p1) p2), p2, (AND p2 p3), true, (AND p2 p3), (AND p2 p3)]
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1915 transition count 355
Applied a total of 1 rules in 143 ms. Remains 1915 /1916 variables (removed 1) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1915 cols
[2023-03-15 21:06:48] [INFO ] Computed 1562 place invariants in 31 ms
[2023-03-15 21:06:50] [INFO ] Implicit Places using invariants in 2050 ms returned []
[2023-03-15 21:06:50] [INFO ] Invariant cache hit.
[2023-03-15 21:06:54] [INFO ] Implicit Places using invariants and state equation in 3766 ms returned [1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 5820 ms to find 46 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1869/1916 places, 355/356 transitions.
Applied a total of 0 rules in 73 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6039 ms. Remains : 1869/1916 places, 355/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p2 p3), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p2 p3), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=6 dest: 7}], [{ cond=(AND p2 p3), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s1677 1) (GEQ s1769 1)) (AND (GEQ s1661 1) (GEQ s1753 1)) (AND (GEQ s1664 1) (GEQ s1756 1)) (AND (GEQ s1669 1) (GEQ s1761 1)) (AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3477 reset in 251 ms.
Product exploration explored 100000 steps with 3473 reset in 269 ms.
Computed a total of 1869 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 919 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 350 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2117482 steps, run timeout after 3001 ms. (steps per millisecond=705 ) properties seen :{}
Probabilistic random walk after 2117482 steps, saw 272239 distinct states, run finished after 3002 ms. (steps per millisecond=705 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 355 rows 1869 cols
[2023-03-15 21:06:59] [INFO ] Computed 1518 place invariants in 110 ms
[2023-03-15 21:07:00] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 266 ms returned sat
[2023-03-15 21:07:00] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:07:00] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 263 ms returned sat
[2023-03-15 21:07:01] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 21:07:01] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-15 21:07:01] [INFO ] After 1091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 24 factoid took 808 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (NOT p1)]
Support contains 23 out of 1869 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Applied a total of 0 rules in 55 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-15 21:07:02] [INFO ] Invariant cache hit.
[2023-03-15 21:07:04] [INFO ] Implicit Places using invariants in 1972 ms returned []
[2023-03-15 21:07:04] [INFO ] Invariant cache hit.
[2023-03-15 21:07:07] [INFO ] Implicit Places using invariants and state equation in 3454 ms returned []
Implicit Place search using SMT with State Equation took 5427 ms to find 0 implicit places.
[2023-03-15 21:07:07] [INFO ] Invariant cache hit.
[2023-03-15 21:07:08] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6052 ms. Remains : 1869/1869 places, 355/355 transitions.
Computed a total of 1869 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 355
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, (X p1), (X (X p1)), true, (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 347 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2139033 steps, run timeout after 3001 ms. (steps per millisecond=712 ) properties seen :{}
Probabilistic random walk after 2139033 steps, saw 274838 distinct states, run finished after 3001 ms. (steps per millisecond=712 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:07:12] [INFO ] Invariant cache hit.
[2023-03-15 21:07:12] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 265 ms returned sat
[2023-03-15 21:07:12] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:07:12] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 268 ms returned sat
[2023-03-15 21:07:13] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 21:07:13] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 21:07:13] [INFO ] After 1085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), true, (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3470 reset in 359 ms.
Product exploration explored 100000 steps with 3475 reset in 374 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (NOT p1)]
Support contains 23 out of 1869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Graph (complete) has 14655 edges and 1869 vertex of which 1845 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 353
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1845 transition count 354
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 150 ms. Remains 1845 /1869 variables (removed 24) and now considering 354/355 (removed 1) transitions.
[2023-03-15 21:07:15] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 354 rows 1845 cols
[2023-03-15 21:07:15] [INFO ] Computed 1496 place invariants in 119 ms
[2023-03-15 21:07:15] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1869 places, 354/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 884 ms. Remains : 1845/1869 places, 354/355 transitions.
Support contains 23 out of 1869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Applied a total of 0 rules in 57 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
// Phase 1: matrix 355 rows 1869 cols
[2023-03-15 21:07:16] [INFO ] Computed 1518 place invariants in 112 ms
[2023-03-15 21:07:18] [INFO ] Implicit Places using invariants in 2195 ms returned []
[2023-03-15 21:07:18] [INFO ] Invariant cache hit.
[2023-03-15 21:07:21] [INFO ] Implicit Places using invariants and state equation in 3741 ms returned []
Implicit Place search using SMT with State Equation took 5938 ms to find 0 implicit places.
[2023-03-15 21:07:21] [INFO ] Invariant cache hit.
[2023-03-15 21:07:22] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6606 ms. Remains : 1869/1869 places, 355/355 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-14 finished in 34146 ms.
[2023-03-15 21:07:22] [INFO ] Flatten gal took : 65 ms
[2023-03-15 21:07:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-15 21:07:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1916 places, 356 transitions and 4110 arcs took 5 ms.
Total runtime 189369 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-COL-22
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678914451059
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 17 (type SKEL/SRCH) for 3 QuasiCertifProtocol-COL-22-LTLFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 17 (type SKEL/SRCH) for QuasiCertifProtocol-COL-22-LTLFireability-04
lola: result : false
lola: markings : 191
lola: fired transitions : 191
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-COL-22-LTLFireability-04
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for QuasiCertifProtocol-COL-22-LTLFireability-04
lola: result : false
lola: markings : 191
lola: fired transitions : 191
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 6 QuasiCertifProtocol-COL-22-LTLFireability-14
lola: time limit : 898 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for QuasiCertifProtocol-COL-22-LTLFireability-14
lola: result : false
lola: markings : 191
lola: fired transitions : 191
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-COL-22-LTLFireability-03
lola: time limit : 3593 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for QuasiCertifProtocol-COL-22-LTLFireability-03
lola: result : false
lola: markings : 191
lola: fired transitions : 191
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-22-LTLFireability-03: LTL false LTL model checker
QuasiCertifProtocol-COL-22-LTLFireability-04: LTL false LTL model checker
QuasiCertifProtocol-COL-22-LTLFireability-14: CONJ false LTL model checker
Time elapsed: 7 secs. Pages in use: 1
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="QuasiCertifProtocol-COL-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is QuasiCertifProtocol-COL-22, 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 r295-tall-167873948400836"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 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 ;