About the Execution of ITS-Tools for QuasiCertifProtocol-COL-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.155 | 3600000.00 | 2938126.00 | 859108.40 | T?FFTFFFTFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017400948.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-COL-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400948
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 7.3K Apr 30 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 131K May 10 09:34 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-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652991043643
Running Version 202205111006
[2022-05-19 20:10:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 20:10:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:10:44] [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.
[2022-05-19 20:10:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 20:10:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 682 ms
[2022-05-19 20:10:45] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 20:10:45] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 8 ms.
[2022-05-19 20:10:45] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-12 FALSE 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 10001 steps, including 225 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10002 steps, including 73 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 20:10:47] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-19 20:10:47] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-19 20:10:47] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :2 sat :6 real:6
[2022-05-19 20:10:47] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :5 real:7
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-19 20:10:47] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :5 real:7
[2022-05-19 20:10:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 20:10:47] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2022-05-19 20:10:47] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-19 20:10:47] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 11 different solutions.
Finished Parikh walk after 108 steps, including 0 resets, run visited all 12 properties in 3 ms. (steps per millisecond=36 )
Parikh walk visited 12 properties in 3 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 20:10:47] [INFO ] Flatten gal took : 20 ms
[2022-05-19 20:10:47] [INFO ] Flatten gal took : 5 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2022-05-19 20:10:47] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 30 ms.
[2022-05-19 20:10:47] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 2515 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 179 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 20:10:48] [INFO ] Computed 3232 place invariants in 232 ms
[2022-05-19 20:10:50] [INFO ] Implicit Places using invariants in 2811 ms returned []
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 20:10:50] [INFO ] Computed 3232 place invariants in 82 ms
[2022-05-19 20:10:53] [INFO ] Implicit Places using invariants and state equation in 3120 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 5955 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3806 places, 506/506 transitions.
Applied a total of 0 rules in 130 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3806 places, 506/506 transitions.
Support contains 2515 out of 3703 places after structural reductions.
[2022-05-19 20:10:54] [INFO ] Flatten gal took : 233 ms
[2022-05-19 20:10:54] [INFO ] Flatten gal took : 170 ms
[2022-05-19 20:10:55] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:10:56] [INFO ] Computed 3200 place invariants in 431 ms
[2022-05-19 20:10:59] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 731 ms returned sat
[2022-05-19 20:10:59] [INFO ] After 2599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 20:11:01] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 709 ms returned sat
[2022-05-19 20:11:14] [INFO ] After 11693ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2022-05-19 20:11:21] [INFO ] After 19416ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 2505 ms.
[2022-05-19 20:11:24] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 17 Parikh solutions to 14 different solutions.
Finished Parikh walk after 236 steps, including 0 resets, run visited all 11 properties in 15 ms. (steps per millisecond=15 )
Parikh walk visited 16 properties in 21 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((false U p0)||X(G(X(p1))))))'
Support contains 1123 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 114 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:11:25] [INFO ] Computed 3200 place invariants in 452 ms
[2022-05-19 20:11:30] [INFO ] Implicit Places using invariants in 5416 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:11:30] [INFO ] Computed 3200 place invariants in 448 ms
[2022-05-19 20:11:37] [INFO ] Implicit Places using invariants and state equation in 6736 ms returned []
Implicit Place search using SMT with State Equation took 12158 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:11:37] [INFO ] Computed 3200 place invariants in 414 ms
[2022-05-19 20:11:38] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LT s3699 1), p1:(OR (AND (GEQ s21 1) (GEQ s54 1) (GEQ s87 1) (GEQ s120 1) (GEQ s153 1) (GEQ s186 1) (GEQ s219 1) (GEQ s252 1) (GEQ s285 1) (GEQ s318 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1905 ms.
Product exploration explored 100000 steps with 50000 reset in 1767 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 458 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-00 finished in 18418 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X((G(p0)||p0)))||X(p1)))||G(!p0))))'
Support contains 1123 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 230 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:11:43] [INFO ] Computed 3200 place invariants in 410 ms
[2022-05-19 20:11:46] [INFO ] Implicit Places using invariants in 2726 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:11:46] [INFO ] Computed 3200 place invariants in 415 ms
[2022-05-19 20:11:54] [INFO ] Implicit Places using invariants and state equation in 8736 ms returned []
Implicit Place search using SMT with State Equation took 11464 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:11:55] [INFO ] Computed 3200 place invariants in 420 ms
[2022-05-19 20:11:56] [INFO ] Dead Transitions using invariants and state equation in 1887 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), false, false, false, false, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 0}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=5, aps=[p0:(LT s3698 1), p1:(OR (AND (GEQ s21 1) (GEQ s54 1) (GEQ s87 1) (GEQ s120 1) (GEQ s153 1) (GEQ s186 1) (GEQ s219 1) (GEQ s252 1) (GEQ s285 1) (GEQ s318 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2675 reset in 584 ms.
Product exploration explored 100000 steps with 2680 reset in 544 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 403 ms. Reduced automaton from 8 states, 18 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Finished probabilistic random walk after 113726 steps, run visited all 4 properties in 924 ms. (steps per millisecond=123 )
Probabilistic random walk after 113726 steps, saw 33296 distinct states, run finished after 925 ms. (steps per millisecond=122 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1123 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 120 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:12:02] [INFO ] Computed 3200 place invariants in 462 ms
[2022-05-19 20:12:05] [INFO ] Implicit Places using invariants in 2835 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:12:05] [INFO ] Computed 3200 place invariants in 431 ms
[2022-05-19 20:12:11] [INFO ] Implicit Places using invariants and state equation in 6736 ms returned []
Implicit Place search using SMT with State Equation took 9575 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:12:12] [INFO ] Computed 3200 place invariants in 409 ms
[2022-05-19 20:12:13] [INFO ] Dead Transitions using invariants and state equation in 1875 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Finished probabilistic random walk after 113726 steps, run visited all 4 properties in 921 ms. (steps per millisecond=123 )
Probabilistic random walk after 113726 steps, saw 33296 distinct states, run finished after 922 ms. (steps per millisecond=123 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2679 reset in 520 ms.
Product exploration explored 100000 steps with 2677 reset in 512 ms.
Built C files in :
/tmp/ltsmin6418625068659461296
[2022-05-19 20:12:19] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6418625068659461296
Running compilation step : cd /tmp/ltsmin6418625068659461296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2358 ms.
Running link step : cd /tmp/ltsmin6418625068659461296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6418625068659461296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13486711603237750126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1123 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 131 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:12:35] [INFO ] Computed 3200 place invariants in 437 ms
[2022-05-19 20:12:37] [INFO ] Implicit Places using invariants in 2728 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:12:38] [INFO ] Computed 3200 place invariants in 435 ms
[2022-05-19 20:12:46] [INFO ] Implicit Places using invariants and state equation in 8720 ms returned []
Implicit Place search using SMT with State Equation took 11477 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:12:46] [INFO ] Computed 3200 place invariants in 450 ms
[2022-05-19 20:12:47] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin13426546472524985209
[2022-05-19 20:12:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13426546472524985209
Running compilation step : cd /tmp/ltsmin13426546472524985209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2347 ms.
Running link step : cd /tmp/ltsmin13426546472524985209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13426546472524985209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased875894548069357461.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 20:13:02] [INFO ] Flatten gal took : 119 ms
[2022-05-19 20:13:03] [INFO ] Flatten gal took : 101 ms
[2022-05-19 20:13:03] [INFO ] Time to serialize gal into /tmp/LTL13967790683114262575.gal : 37 ms
[2022-05-19 20:13:03] [INFO ] Time to serialize properties into /tmp/LTL14865890439312645288.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13967790683114262575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14865890439312645288.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1396779...268
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(a4_0<1)"))||("(a4_0<1)"))))||(X("(((((((((((((n9_20>=1)&&(n9_53>=1))&&((n9_86>=1)&&(n9_119>=1)))&&(((n9_152>=1)&&(n9...16860
Formula 0 simplified : !X(G(XX("(a4_0<1)" | G"(a4_0<1)") | X"(((((((((((((n9_20>=1)&&(n9_53>=1))&&((n9_86>=1)&&(n9_119>=1)))&&(((n9_152>=1)&&(n9_185>=1))&&...16841
Detected timeout of ITS tools.
[2022-05-19 20:13:18] [INFO ] Flatten gal took : 114 ms
[2022-05-19 20:13:18] [INFO ] Applying decomposition
[2022-05-19 20:13:18] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7711066161077910931.txt' '-o' '/tmp/graph7711066161077910931.bin' '-w' '/tmp/graph7711066161077910931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7711066161077910931.bin' '-l' '-1' '-v' '-w' '/tmp/graph7711066161077910931.weights' '-q' '0' '-e' '0.001'
[2022-05-19 20:13:18] [INFO ] Decomposing Gal with order
[2022-05-19 20:13:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 20:13:19] [INFO ] Removed a total of 329 redundant transitions.
[2022-05-19 20:13:20] [INFO ] Flatten gal took : 1677 ms
[2022-05-19 20:13:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 178 ms.
[2022-05-19 20:13:21] [INFO ] Time to serialize gal into /tmp/LTL12361257830453077171.gal : 27 ms
[2022-05-19 20:13:21] [INFO ] Time to serialize properties into /tmp/LTL2368792642087557191.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12361257830453077171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2368792642087557191.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1236125...246
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(i39.i0.u193.a4_0<1)"))||("(i39.i0.u193.a4_0<1)"))))||(X("(((((((((((((u162.n9_20>=1)&&(u163.n9_53>=1))&&((u164.n9_86...22571
Formula 0 simplified : !X(G(XX("(i39.i0.u193.a4_0<1)" | G"(i39.i0.u193.a4_0<1)") | X"(((((((((((((u162.n9_20>=1)&&(u163.n9_53>=1))&&((u164.n9_86>=1)&&(u165...22552
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17228152918242195294
[2022-05-19 20:13:36] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17228152918242195294
Running compilation step : cd /tmp/ltsmin17228152918242195294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2421 ms.
Running link step : cd /tmp/ltsmin17228152918242195294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17228152918242195294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-01 finished in 128044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X(F((F((F(p1)||p2))||(p3 U !p0))))))'
Support contains 35 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 335 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:13:51] [INFO ] Computed 3200 place invariants in 409 ms
[2022-05-19 20:13:58] [INFO ] Implicit Places using invariants in 6778 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:13:58] [INFO ] Computed 3200 place invariants in 413 ms
[2022-05-19 20:14:10] [INFO ] Implicit Places using invariants and state equation in 12434 ms returned []
Implicit Place search using SMT with State Equation took 19222 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:11] [INFO ] Computed 3200 place invariants in 408 ms
[2022-05-19 20:14:12] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(GEQ s3698 1), p0:(LT s3697 1), p1:(OR (GEQ s3666 1) (GEQ s3667 1) (GEQ s3664 1) (GEQ s3665 1) (GEQ s3674 1) (GEQ s3675 1) (GEQ s3672 1) (GEQ s3673 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-02 finished in 21564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p0)) U !X(p1))&&X(p2))))'
Support contains 1190 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 120 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:13] [INFO ] Computed 3200 place invariants in 411 ms
[2022-05-19 20:14:18] [INFO ] Implicit Places using invariants in 5100 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:18] [INFO ] Computed 3200 place invariants in 408 ms
[2022-05-19 20:14:26] [INFO ] Implicit Places using invariants and state equation in 8917 ms returned []
Implicit Place search using SMT with State Equation took 14031 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:27] [INFO ] Computed 3200 place invariants in 407 ms
[2022-05-19 20:14:28] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p0), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p2) (AND p1 (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s3701 1), p1:(OR (AND (GEQ s21 1) (GEQ s54 1) (GEQ s87 1) (GEQ s120 1) (GEQ s153 1) (GEQ s186 1) (GEQ s219 1) (GEQ s252 1) (GEQ s285 1) (GEQ s318 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-03 finished in 15542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F((G(p0)||p0))||F(p0))))&&F(p1)))'
Support contains 35 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 237 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:29] [INFO ] Computed 3200 place invariants in 428 ms
[2022-05-19 20:14:32] [INFO ] Implicit Places using invariants in 3523 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:32] [INFO ] Computed 3200 place invariants in 405 ms
[2022-05-19 20:14:44] [INFO ] Implicit Places using invariants and state equation in 11986 ms returned []
Implicit Place search using SMT with State Equation took 15513 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:44] [INFO ] Computed 3200 place invariants in 381 ms
[2022-05-19 20:14:45] [INFO ] Dead Transitions using invariants and state equation in 1818 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s3558 1)) (OR (LT s0 1) (LT s3556 1)) (OR (LT s0 1) (LT s3559 1)) (OR (LT s0 1) (LT s3557 1)) (OR (LT s0 1) (LT s3562 1)) (OR (L...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6457 reset in 466 ms.
Product exploration explored 100000 steps with 6487 reset in 516 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-04 finished in 19463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(X(p0))&&F(p0))))||(F(p2)&&p1))))'
Support contains 1190 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 125 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:48] [INFO ] Computed 3200 place invariants in 396 ms
[2022-05-19 20:14:51] [INFO ] Implicit Places using invariants in 3994 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:52] [INFO ] Computed 3200 place invariants in 443 ms
[2022-05-19 20:14:56] [INFO ] Implicit Places using invariants and state equation in 4718 ms returned []
Implicit Place search using SMT with State Equation took 8715 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:14:57] [INFO ] Computed 3200 place invariants in 441 ms
[2022-05-19 20:14:58] [INFO ] Dead Transitions using invariants and state equation in 1869 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=true, acceptance={} source=7 dest: 3}], [{ cond=(NOT p2), acceptance={} source=8 dest: 4}], [{ cond=(NOT p2), acceptance={} source=9 dest: 8}]], initial=6, aps=[p2:(AND (GEQ s3334 1) (GEQ s3335 1) (GEQ s3336 1) (GEQ s3337 1) (GEQ s3338 1) (GEQ s3339 1) (GEQ s3340 1) (GEQ s3341 1) (GEQ s3342 1) (GEQ s3343 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-05 finished in 11075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 34 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.45 ms
Discarding 34 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3666 transition count 501
Applied a total of 5 rules in 631 ms. Remains 3666 /3703 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3666 cols
[2022-05-19 20:15:00] [INFO ] Computed 3168 place invariants in 434 ms
[2022-05-19 20:15:06] [INFO ] Implicit Places using invariants in 6514 ms returned []
// Phase 1: matrix 501 rows 3666 cols
[2022-05-19 20:15:06] [INFO ] Computed 3168 place invariants in 465 ms
[2022-05-19 20:15:18] [INFO ] Implicit Places using invariants and state equation in 12083 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18604 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3703 places, 501/506 transitions.
Applied a total of 0 rules in 301 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3633/3703 places, 501/506 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3573 1)) (AND (GEQ s0 1) (GEQ s3572 1)) (AND (GEQ s0 1) (GEQ s3571 1)) (AND (GEQ s0 1) (GEQ s3570 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 19987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U p0))||(X(p1)&&G(p2))))'
Support contains 68 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 239 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:15:19] [INFO ] Computed 3200 place invariants in 392 ms
[2022-05-19 20:15:22] [INFO ] Implicit Places using invariants in 3818 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:15:23] [INFO ] Computed 3200 place invariants in 397 ms
[2022-05-19 20:15:35] [INFO ] Implicit Places using invariants and state equation in 12505 ms returned []
Implicit Place search using SMT with State Equation took 16327 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:15:35] [INFO ] Computed 3200 place invariants in 427 ms
[2022-05-19 20:15:36] [INFO ] Dead Transitions using invariants and state equation in 1151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3639 1)) (AND (GEQ s0 1) (GEQ s3638 1)) (AND (GEQ s0 1) (GEQ s3637 1)) (AND (GEQ s0 1) (GEQ s3636 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-07 finished in 17907 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((F(p0) U X(p1)))))))'
Support contains 35 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.18 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 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 3667 transition count 502
Applied a total of 3 rules in 539 ms. Remains 3667 /3703 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3667 cols
[2022-05-19 20:15:37] [INFO ] Computed 3168 place invariants in 453 ms
[2022-05-19 20:15:40] [INFO ] Implicit Places using invariants in 3622 ms returned []
// Phase 1: matrix 502 rows 3667 cols
[2022-05-19 20:15:41] [INFO ] Computed 3168 place invariants in 458 ms
[2022-05-19 20:15:52] [INFO ] Implicit Places using invariants and state equation in 11830 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15460 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3703 places, 502/506 transitions.
Applied a total of 0 rules in 268 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3634/3703 places, 502/506 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3400 1)) (AND (GEQ s0 1) (GEQ s3401 1)) (AND (GEQ s0 1) (GEQ s3402 1)) (AND (GEQ s0 1) (GEQ s3411 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 18094 reset in 1260 ms.
Product exploration explored 100000 steps with 18187 reset in 1307 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
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 p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 410 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Incomplete random walk after 10000 steps, including 247 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Finished probabilistic random walk after 6940 steps, run visited all 4 properties in 113 ms. (steps per millisecond=61 )
Probabilistic random walk after 6940 steps, saw 6807 distinct states, run finished after 114 ms. (steps per millisecond=60 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 493 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 20:15:59] [INFO ] Computed 3136 place invariants in 684 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 710 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-09 finished in 24170 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 103 are kept as prefixes of interest. Removing 3600 places using SCC suffix rule.17 ms
Discarding 3600 places :
Also discarding 237 output transitions
Drop transitions removed 237 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 102 transition count 70
Applied a total of 199 rules in 26 ms. Remains 102 /3703 variables (removed 3601) and now considering 70/506 (removed 436) transitions.
// Phase 1: matrix 70 rows 102 cols
[2022-05-19 20:16:00] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-19 20:16:01] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 70 rows 102 cols
[2022-05-19 20:16:01] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-19 20:16:01] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 206 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/3703 places, 70/506 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/3703 places, 70/506 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-11 finished in 274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(((p0 U X(p0))&&p0)) U X(p0))))'
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 232 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:16:01] [INFO ] Computed 3200 place invariants in 432 ms
[2022-05-19 20:16:08] [INFO ] Implicit Places using invariants in 6633 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:16:08] [INFO ] Computed 3200 place invariants in 423 ms
[2022-05-19 20:16:21] [INFO ] Implicit Places using invariants and state equation in 12992 ms returned []
Implicit Place search using SMT with State Equation took 19645 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:16:21] [INFO ] Computed 3200 place invariants in 434 ms
[2022-05-19 20:16:22] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 126 ms :[p0, p0, true, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (GEQ s3601 1) (GEQ s3600 1) (GEQ s3603 1) (GEQ s3602 1) (GEQ s3599 1) (GEQ s3598 1) (GEQ s3609 1) (GEQ s3608 1) (GEQ s3611 1) (GEQ s3610 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1302 ms.
Product exploration explored 100000 steps with 33333 reset in 1313 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 3 factoid took 406 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-13 finished in 25408 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(G(p0)))||p1))))'
Support contains 67 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 237 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:16:27] [INFO ] Computed 3200 place invariants in 419 ms
[2022-05-19 20:16:30] [INFO ] Implicit Places using invariants in 3493 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:16:30] [INFO ] Computed 3200 place invariants in 419 ms
[2022-05-19 20:16:43] [INFO ] Implicit Places using invariants and state equation in 13168 ms returned []
Implicit Place search using SMT with State Equation took 16668 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 20:16:44] [INFO ] Computed 3200 place invariants in 405 ms
[2022-05-19 20:16:44] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (AND (GEQ s3395 1) (GEQ s3560 1)) (AND (GEQ s3368 1) (GEQ s3533 1)) (AND (GEQ s3374 1) (GEQ s3539 1)) (AND (GEQ s3379 1) (GEQ s3544 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-14 finished in 18196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 34 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 304 are kept as prefixes of interest. Removing 3399 places using SCC suffix rule.11 ms
Discarding 3399 places :
Also discarding 165 output transitions
Drop transitions removed 165 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 303 transition count 209
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 134 place count 302 transition count 208
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 302 transition count 208
Applied a total of 135 rules in 32 ms. Remains 302 /3703 variables (removed 3401) and now considering 208/506 (removed 298) transitions.
// Phase 1: matrix 208 rows 302 cols
[2022-05-19 20:16:44] [INFO ] Computed 96 place invariants in 0 ms
[2022-05-19 20:16:45] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 208 rows 302 cols
[2022-05-19 20:16:45] [INFO ] Computed 96 place invariants in 1 ms
[2022-05-19 20:16:45] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 517 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 269/3703 places, 208/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 269 /269 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 269/3703 places, 208/506 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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 s12 1) (GEQ s13 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-15 finished in 614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X((G(p0)||p0)))||X(p1)))||G(!p0))))'
Found a SL insensitive property : QuasiCertifProtocol-COL-32-LTLFireability-01
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), false, false, false, false, p0]
Support contains 1123 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.16 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 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 3667 transition count 502
Applied a total of 3 rules in 294 ms. Remains 3667 /3703 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3667 cols
[2022-05-19 20:16:46] [INFO ] Computed 3168 place invariants in 425 ms
[2022-05-19 20:16:51] [INFO ] Implicit Places using invariants in 5276 ms returned []
// Phase 1: matrix 502 rows 3667 cols
[2022-05-19 20:16:51] [INFO ] Computed 3168 place invariants in 421 ms
[2022-05-19 20:17:00] [INFO ] Implicit Places using invariants and state equation in 8940 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14247 ms to find 33 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3634/3703 places, 502/506 transitions.
Applied a total of 0 rules in 137 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3634/3703 places, 502/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 0}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=5, aps=[p0:(LT s3631 1), p1:(OR (AND (GEQ s21 1) (GEQ s54 1) (GEQ s87 1) (GEQ s120 1) (GEQ s153 1) (GEQ s186 1) (GEQ s219 1) (GEQ s252 1) (GEQ s285 1) (GEQ s318 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, 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 2461 reset in 525 ms.
Product exploration explored 100000 steps with 2457 reset in 553 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 443 ms. Reduced automaton from 8 states, 18 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Finished probabilistic random walk after 113531 steps, run visited all 4 properties in 774 ms. (steps per millisecond=146 )
Probabilistic random walk after 113531 steps, saw 33141 distinct states, run finished after 775 ms. (steps per millisecond=146 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 1841 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1123 out of 3634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 117 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 20:17:07] [INFO ] Computed 3136 place invariants in 453 ms
[2022-05-19 20:17:11] [INFO ] Implicit Places using invariants in 4980 ms returned []
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 20:17:12] [INFO ] Computed 3136 place invariants in 462 ms
[2022-05-19 20:17:20] [INFO ] Implicit Places using invariants and state equation in 8557 ms returned []
Implicit Place search using SMT with State Equation took 13559 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 20:17:20] [INFO ] Computed 3136 place invariants in 476 ms
[2022-05-19 20:17:22] [INFO ] Dead Transitions using invariants and state equation in 1796 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3634/3634 places, 502/502 transitions.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Finished probabilistic random walk after 113531 steps, run visited all 4 properties in 850 ms. (steps per millisecond=133 )
Probabilistic random walk after 113531 steps, saw 33141 distinct states, run finished after 851 ms. (steps per millisecond=133 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 864 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2466 reset in 527 ms.
Product exploration explored 100000 steps with 2462 reset in 579 ms.
Built C files in :
/tmp/ltsmin2568404615323077072
[2022-05-19 20:17:27] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2568404615323077072
Running compilation step : cd /tmp/ltsmin2568404615323077072;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2231 ms.
Running link step : cd /tmp/ltsmin2568404615323077072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2568404615323077072;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10591120152319597728.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1123 out of 3634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 102 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 20:17:43] [INFO ] Computed 3136 place invariants in 472 ms
[2022-05-19 20:17:47] [INFO ] Implicit Places using invariants in 5438 ms returned []
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 20:17:48] [INFO ] Computed 3136 place invariants in 451 ms
[2022-05-19 20:17:56] [INFO ] Implicit Places using invariants and state equation in 8416 ms returned []
Implicit Place search using SMT with State Equation took 13858 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 20:17:56] [INFO ] Computed 3136 place invariants in 457 ms
[2022-05-19 20:17:58] [INFO ] Dead Transitions using invariants and state equation in 1785 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3634/3634 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin1653023756570417285
[2022-05-19 20:17:58] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1653023756570417285
Running compilation step : cd /tmp/ltsmin1653023756570417285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2188 ms.
Running link step : cd /tmp/ltsmin1653023756570417285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1653023756570417285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15271915647035855100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 20:18:13] [INFO ] Flatten gal took : 120 ms
[2022-05-19 20:18:13] [INFO ] Flatten gal took : 80 ms
[2022-05-19 20:18:13] [INFO ] Time to serialize gal into /tmp/LTL3362019109445882691.gal : 21 ms
[2022-05-19 20:18:13] [INFO ] Time to serialize properties into /tmp/LTL17096427288461237955.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3362019109445882691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17096427288461237955.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3362019...267
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(a4_0<1)"))||("(a4_0<1)"))))||(X("(((((((((((((n9_20>=1)&&(n9_53>=1))&&((n9_86>=1)&&(n9_119>=1)))&&(((n9_152>=1)&&(n9...16860
Formula 0 simplified : !X(G(XX("(a4_0<1)" | G"(a4_0<1)") | X"(((((((((((((n9_20>=1)&&(n9_53>=1))&&((n9_86>=1)&&(n9_119>=1)))&&(((n9_152>=1)&&(n9_185>=1))&&...16841
Detected timeout of ITS tools.
[2022-05-19 20:18:28] [INFO ] Flatten gal took : 77 ms
[2022-05-19 20:18:28] [INFO ] Applying decomposition
[2022-05-19 20:18:28] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3521517055346156684.txt' '-o' '/tmp/graph3521517055346156684.bin' '-w' '/tmp/graph3521517055346156684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3521517055346156684.bin' '-l' '-1' '-v' '-w' '/tmp/graph3521517055346156684.weights' '-q' '0' '-e' '0.001'
[2022-05-19 20:18:29] [INFO ] Decomposing Gal with order
[2022-05-19 20:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 20:18:29] [INFO ] Removed a total of 329 redundant transitions.
[2022-05-19 20:18:29] [INFO ] Flatten gal took : 302 ms
[2022-05-19 20:18:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 80 ms.
[2022-05-19 20:18:29] [INFO ] Time to serialize gal into /tmp/LTL1464198121411527733.gal : 32 ms
[2022-05-19 20:18:29] [INFO ] Time to serialize properties into /tmp/LTL3807816322843431874.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1464198121411527733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3807816322843431874.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1464198...245
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(i23.u133.a4_0<1)"))||("(i23.u133.a4_0<1)"))))||(X("(((((((((((((u100.n9_20>=1)&&(u101.n9_53>=1))&&((u102.n9_86>=1)&&...22578
Formula 0 simplified : !X(G(XX("(i23.u133.a4_0<1)" | G"(i23.u133.a4_0<1)") | X"(((((((((((((u100.n9_20>=1)&&(u101.n9_53>=1))&&((u102.n9_86>=1)&&(u103.n9_11...22559
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16950091434910792088
[2022-05-19 20:18:44] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16950091434910792088
Running compilation step : cd /tmp/ltsmin16950091434910792088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2715 ms.
Running link step : cd /tmp/ltsmin16950091434910792088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16950091434910792088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-01 finished in 134450 ms.
[2022-05-19 20:19:00] [INFO ] Flatten gal took : 116 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17366548097061779455
[2022-05-19 20:19:00] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2022-05-19 20:19:00] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:19:00] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2022-05-19 20:19:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:19:00] [INFO ] Applying decomposition
[2022-05-19 20:19:00] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2022-05-19 20:19:00] [INFO ] Flatten gal took : 83 ms
[2022-05-19 20:19:00] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:19:00] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17366548097061779455
Running compilation step : cd /tmp/ltsmin17366548097061779455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8120754248666629806.txt' '-o' '/tmp/graph8120754248666629806.bin' '-w' '/tmp/graph8120754248666629806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8120754248666629806.bin' '-l' '-1' '-v' '-w' '/tmp/graph8120754248666629806.weights' '-q' '0' '-e' '0.001'
[2022-05-19 20:19:00] [INFO ] Decomposing Gal with order
[2022-05-19 20:19:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 20:19:00] [INFO ] Removed a total of 329 redundant transitions.
[2022-05-19 20:19:00] [INFO ] Flatten gal took : 274 ms
[2022-05-19 20:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 71 ms.
[2022-05-19 20:19:00] [INFO ] Time to serialize gal into /tmp/LTLFireability1456366672141061586.gal : 15 ms
[2022-05-19 20:19:02] [INFO ] Time to serialize properties into /tmp/LTLFireability1909250689702552829.ltl : 1333 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1456366672141061586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1909250689702552829.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(i31.i0.u193.a4_0<1)"))||("(i31.i0.u193.a4_0<1)"))))||(X("(((((((((((((u161.n9_20>=1)&&(u162.n9_53>=1))&&((u163.n9_86...22639
Formula 0 simplified : !X(G(XX("(i31.i0.u193.a4_0<1)" | G"(i31.i0.u193.a4_0<1)") | X"(((((((((((((u161.n9_20>=1)&&(u162.n9_53>=1))&&((u163.n9_86>=1)&&(u164...22620
Compilation finished in 3003 ms.
Running link step : cd /tmp/ltsmin17366548097061779455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17366548097061779455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: LTL layer: formula: X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.019: "X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.020: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.084: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.304: DFS-FIFO for weak LTL, using special progress label 509
pins2lts-mc-linux64( 0/ 8), 0.304: There are 510 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.304: State length is 3704, there are 524 groups
pins2lts-mc-linux64( 0/ 8), 0.304: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.304: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.304: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.304: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.725: ~1 levels ~960 states ~32368 transitions
pins2lts-mc-linux64( 3/ 8), 1.043: ~1 levels ~1920 states ~65192 transitions
pins2lts-mc-linux64( 3/ 8), 1.584: ~1 levels ~3840 states ~135416 transitions
pins2lts-mc-linux64( 0/ 8), 2.457: ~1 levels ~7680 states ~268488 transitions
pins2lts-mc-linux64( 0/ 8), 4.342: ~1 levels ~15360 states ~553720 transitions
pins2lts-mc-linux64( 0/ 8), 7.337: ~1 levels ~30720 states ~1089456 transitions
pins2lts-mc-linux64( 5/ 8), 14.403: ~1 levels ~61440 states ~2359408 transitions
pins2lts-mc-linux64( 1/ 8), 25.630: ~1 levels ~122880 states ~4965768 transitions
pins2lts-mc-linux64( 2/ 8), 51.361: ~1 levels ~245760 states ~9494264 transitions
pins2lts-mc-linux64( 2/ 8), 122.997: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 124.057:
pins2lts-mc-linux64( 0/ 8), 124.057: mean standard work distribution: 8.1% (states) 4.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 124.057:
pins2lts-mc-linux64( 0/ 8), 124.057: Explored 429973 states 22245308 transitions, fanout: 51.737
pins2lts-mc-linux64( 0/ 8), 124.057: Total exploration time 123.720 sec (122.810 sec minimum, 123.270 sec on average)
pins2lts-mc-linux64( 0/ 8), 124.057: States per second: 3475, Transitions per second: 179804
pins2lts-mc-linux64( 0/ 8), 124.057:
pins2lts-mc-linux64( 0/ 8), 124.057: Progress states detected: 6942423
pins2lts-mc-linux64( 0/ 8), 124.057: Redundant explorations: -93.8068
pins2lts-mc-linux64( 0/ 8), 124.057:
pins2lts-mc-linux64( 0/ 8), 124.057: Queue width: 8B, total height: 7516402, memory: 57.35MB
pins2lts-mc-linux64( 0/ 8), 124.057: Tree memory: 309.0MB, 46.7 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 124.057: Tree fill ratio (roots/leafs): 5.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 124.057: Stored 510 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 124.057: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 124.057: Est. total memory use: 366.3MB (~1081.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17366548097061779455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17366548097061779455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 20:41:52] [INFO ] Applying decomposition
[2022-05-19 20:41:53] [INFO ] Flatten gal took : 548 ms
[2022-05-19 20:41:53] [INFO ] Decomposing Gal with order
[2022-05-19 20:41:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 20:41:58] [INFO ] Removed a total of 296 redundant transitions.
[2022-05-19 20:41:58] [INFO ] Flatten gal took : 899 ms
[2022-05-19 20:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 430 ms.
[2022-05-19 20:41:59] [INFO ] Time to serialize gal into /tmp/LTLFireability4234725996180716896.gal : 74 ms
[2022-05-19 20:41:59] [INFO ] Time to serialize properties into /tmp/LTLFireability4802442433712123927.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4234725996180716896.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4802442433712123927.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(a4.a4_0<1)"))||("(a4.a4_0<1)"))))||(X("(((((((((((((tsidtsid20.n9_20>=1)&&(tsidtsid53.n9_53>=1))&&((tsidtsid86.n9_86...30137
Formula 0 simplified : !X(G(XX("(a4.a4_0<1)" | G"(a4.a4_0<1)") | X"(((((((((((((tsidtsid20.n9_20>=1)&&(tsidtsid53.n9_53>=1))&&((tsidtsid86.n9_86>=1)&&(tsid...30118
Detected timeout of ITS tools.
[2022-05-19 21:06:11] [INFO ] Flatten gal took : 820 ms
[2022-05-19 21:06:14] [INFO ] Input system was already deterministic with 506 transitions.
[2022-05-19 21:06:14] [INFO ] Transformed 3703 places.
[2022-05-19 21:06:14] [INFO ] Transformed 506 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 21:06:15] [INFO ] Time to serialize gal into /tmp/LTLFireability6049275427838514884.gal : 20 ms
[2022-05-19 21:06:15] [INFO ] Time to serialize properties into /tmp/LTLFireability4512759347146425338.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6049275427838514884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4512759347146425338.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G((X(X((G("(a4_0<1)"))||("(a4_0<1)"))))||(X("(((((((((((((n9_20>=1)&&(n9_53>=1))&&((n9_86>=1)&&(n9_119>=1)))&&(((n9_152>=1)&&(n9...16860
Formula 0 simplified : !X(G(XX("(a4_0<1)" | G"(a4_0<1)") | X"(((((((((((((n9_20>=1)&&(n9_53>=1))&&((n9_86>=1)&&(n9_119>=1)))&&(((n9_152>=1)&&(n9_185>=1))&&...16841
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-32, 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 r168-tall-165277017400948"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 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 ;