About the Execution of ITS-Tools for QuasiCertifProtocol-COL-28
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1023.063 | 138079.00 | 166378.00 | 678.50 | FFFFTFTFFFFFFFTF | 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-165277017400940.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-28, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400940
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 7.7K Apr 30 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 13:02 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.7K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 120K 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-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652988915533
Running Version 202205111006
[2022-05-19 19:35:16] [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 19:35:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:35:16] [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 19:35:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 19:35:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 618 ms
[2022-05-19 19:35:17] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 19:35:17] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2022-05-19 19:35:17] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 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 10012 steps, including 252 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 19:35:18] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-19 19:35:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-19 19:35:18] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 19:35:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:35:18] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 19:35:18] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-19 19:35:18] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 96 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=19 )
Parikh walk visited 4 properties in 4 ms.
[2022-05-19 19:35:18] [INFO ] Flatten gal took : 22 ms
[2022-05-19 19:35:18] [INFO ] Flatten gal took : 7 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2022-05-19 19:35:18] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 31 ms.
[2022-05-19 19:35:18] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 2848 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 29 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:18] [INFO ] Computed 2492 place invariants in 192 ms
[2022-05-19 19:35:19] [INFO ] Implicit Places using invariants in 1192 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:20] [INFO ] Computed 2492 place invariants in 72 ms
[2022-05-19 19:35:21] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 3072 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:21] [INFO ] Computed 2492 place invariants in 68 ms
[2022-05-19 19:35:22] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2848 out of 2936 places after structural reductions.
[2022-05-19 19:35:23] [INFO ] Flatten gal took : 232 ms
[2022-05-19 19:35:23] [INFO ] Flatten gal took : 169 ms
[2022-05-19 19:35:24] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:25] [INFO ] Computed 2492 place invariants in 52 ms
[2022-05-19 19:35:27] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 513 ms returned sat
[2022-05-19 19:35:28] [INFO ] After 1876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-19 19:35:29] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 480 ms returned sat
[2022-05-19 19:35:35] [INFO ] After 5584ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2022-05-19 19:35:42] [INFO ] After 12133ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 2248 ms.
[2022-05-19 19:35:44] [INFO ] After 16335ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 11 different solutions.
Finished Parikh walk after 208 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=23 )
Parikh walk visited 11 properties in 34 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&X(p1)))'
Support contains 900 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 302 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:45] [INFO ] Computed 2492 place invariants in 55 ms
[2022-05-19 19:35:48] [INFO ] Implicit Places using invariants in 3438 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:48] [INFO ] Computed 2492 place invariants in 49 ms
[2022-05-19 19:35:55] [INFO ] Implicit Places using invariants and state equation in 6589 ms returned []
Implicit Place search using SMT with State Equation took 10034 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:55] [INFO ] Computed 2492 place invariants in 53 ms
[2022-05-19 19:35:56] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s2876 1)) (OR (LT s0 1) (LT s2875 1)) (OR (LT s0 1) (LT s2874 1)) (OR (LT s0 1) (LT s2873 1)) (OR (LT s0 1) (LT s2872 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-01 finished in 11755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((X(X(p0))&&p1)))&&F(p0)))'
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 172 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:56] [INFO ] Computed 2492 place invariants in 58 ms
[2022-05-19 19:36:00] [INFO ] Implicit Places using invariants in 4042 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:00] [INFO ] Computed 2492 place invariants in 53 ms
[2022-05-19 19:36:08] [INFO ] Implicit Places using invariants and state equation in 7552 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11611 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 171 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s2901 1), p0:(OR (AND (GEQ s0 1) (GEQ s2847 1)) (AND (GEQ s0 1) (GEQ s2846 1)) (AND (GEQ s0 1) (GEQ s2845 1)) (AND (GEQ s0 1) (GEQ s2844 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-03 finished in 12164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p2)&&p1))&&p0)))'
Support contains 901 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 84 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:08] [INFO ] Computed 2492 place invariants in 62 ms
[2022-05-19 19:36:12] [INFO ] Implicit Places using invariants in 3538 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:12] [INFO ] Computed 2492 place invariants in 56 ms
[2022-05-19 19:36:18] [INFO ] Implicit Places using invariants and state equation in 6601 ms returned []
Implicit Place search using SMT with State Equation took 10143 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:19] [INFO ] Computed 2492 place invariants in 51 ms
[2022-05-19 19:36:20] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LT s2934 1), p1:(AND (OR (LT s1691 1) (LT s1720 1) (LT s1749 1) (LT s1778 1) (LT s1807 1) (LT s1836 1) (LT s1865 1) (LT s1894 1) (LT s1923 1) (LT s195...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 36004 reset in 2144 ms.
Product exploration explored 100000 steps with 36614 reset in 2085 ms.
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), true, (X (X (NOT (AND p1 (NOT p2))))), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-06 finished in 16550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((G((p0 U p1)) U !F(p2))&&X(G(p0))))))'
Support contains 1741 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 33 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:25] [INFO ] Computed 2492 place invariants in 47 ms
[2022-05-19 19:36:27] [INFO ] Implicit Places using invariants in 1719 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:27] [INFO ] Computed 2492 place invariants in 47 ms
[2022-05-19 19:36:30] [INFO ] Implicit Places using invariants and state equation in 3532 ms returned []
Implicit Place search using SMT with State Equation took 5260 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:30] [INFO ] Computed 2492 place invariants in 51 ms
[2022-05-19 19:36:31] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 5}, { cond=(OR (NOT p2) p1 p0), acceptance={} source=1 dest: 6}, { cond=(OR p1 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=7 dest: 7}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(LT s2931 1), p1:(OR (AND (GEQ s1691 1) (GEQ s1720 1) (GEQ s1749 1) (GEQ s1778 1) (GEQ s1807 1) (GEQ s1836 1) (GEQ s1865 1) (GEQ s1894 1) (GEQ s1923 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-07 finished in 6674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F((X(p0)||(G(p1)&&p2)))))))'
Support contains 901 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.36 ms
Discarding 30 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 2904 transition count 442
Applied a total of 3 rules in 265 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2022-05-19 19:36:32] [INFO ] Computed 2464 place invariants in 42 ms
[2022-05-19 19:36:35] [INFO ] Implicit Places using invariants in 3351 ms returned []
// Phase 1: matrix 442 rows 2904 cols
[2022-05-19 19:36:35] [INFO ] Computed 2464 place invariants in 50 ms
[2022-05-19 19:36:42] [INFO ] Implicit Places using invariants and state equation in 6469 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 9826 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2875/2936 places, 442/446 transitions.
Applied a total of 0 rules in 130 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2875/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s2725 1)) (AND (GEQ s0 1) (GEQ s2726 1)) (AND (GEQ s0 1) (GEQ s2723 1)) (AND (GEQ s0 1) (GEQ s2724 1)) (AND (GEQ s0 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-08 finished in 10371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||p1)))'
Support contains 871 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.10 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2904 transition count 442
Applied a total of 5 rules in 201 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2022-05-19 19:36:42] [INFO ] Computed 2464 place invariants in 47 ms
[2022-05-19 19:36:45] [INFO ] Implicit Places using invariants in 2700 ms returned []
// Phase 1: matrix 442 rows 2904 cols
[2022-05-19 19:36:45] [INFO ] Computed 2464 place invariants in 42 ms
[2022-05-19 19:36:49] [INFO ] Implicit Places using invariants and state equation in 4559 ms returned [2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 7264 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2875/2936 places, 442/446 transitions.
Applied a total of 0 rules in 124 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2875/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s2873 1), p0:(OR (AND (GEQ s1161 1) (GEQ s1162 1) (GEQ s1163 1) (GEQ s1164 1) (GEQ s1165 1) (GEQ s1166 1) (GEQ s1167 1) (GEQ s1168 1) (GEQ s1169 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 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-09 finished in 7666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((G(p0)&&(p1 U X(p2)))))))'
Support contains 60 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 148 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:50] [INFO ] Computed 2492 place invariants in 58 ms
[2022-05-19 19:36:54] [INFO ] Implicit Places using invariants in 4246 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:54] [INFO ] Computed 2492 place invariants in 46 ms
[2022-05-19 19:37:02] [INFO ] Implicit Places using invariants and state equation in 7909 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12160 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 149 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s2905 1), p1:(OR (GEQ s2826 1) (GEQ s2827 1) (GEQ s2824 1) (GEQ s2825 1) (GEQ s2830 1) (GEQ s2831 1) (GEQ s2828 1) (GEQ s2829 1) (GEQ s2818 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-10 finished in 12693 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1 U G(!p2)))))'
Support contains 872 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 79 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:37:02] [INFO ] Computed 2492 place invariants in 58 ms
[2022-05-19 19:37:06] [INFO ] Implicit Places using invariants in 3312 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:37:06] [INFO ] Computed 2492 place invariants in 53 ms
[2022-05-19 19:37:11] [INFO ] Implicit Places using invariants and state equation in 5657 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 8972 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 80 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 184 ms :[p2, p2, true, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LT s2902 1), p0:(OR (AND (GEQ s12 1) (GEQ s41 1) (GEQ s70 1) (GEQ s99 1) (GEQ s128 1) (GEQ s157 1) (GEQ s186 1) (GEQ s215 1) (GEQ s244 1) (GEQ s273 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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-28-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-12 finished in 9344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||X(F(p2))||X(G(p3))))'
Support contains 90 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 145 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:37:12] [INFO ] Computed 2492 place invariants in 54 ms
[2022-05-19 19:37:16] [INFO ] Implicit Places using invariants in 4173 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:37:16] [INFO ] Computed 2492 place invariants in 56 ms
[2022-05-19 19:37:23] [INFO ] Implicit Places using invariants and state equation in 7104 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11285 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 160 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(OR (GEQ s2902 1) (AND (GEQ s2640 1) (GEQ s2641 1) (GEQ s2642 1) (GEQ s2643 1) (GEQ s2644 1) (GEQ s2645 1) (GEQ s2646 1) (GEQ s2647 1) (GEQ s2648 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-13 finished in 11808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 871 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.8 ms
Discarding 30 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 2904 transition count 442
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2904 transition count 442
Applied a total of 4 rules in 287 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2022-05-19 19:37:24] [INFO ] Computed 2464 place invariants in 45 ms
[2022-05-19 19:37:27] [INFO ] Implicit Places using invariants in 3355 ms returned []
// Phase 1: matrix 442 rows 2904 cols
[2022-05-19 19:37:27] [INFO ] Computed 2464 place invariants in 51 ms
[2022-05-19 19:37:33] [INFO ] Implicit Places using invariants and state equation in 5497 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8867 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 99 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s41 1) (GEQ s70 1) (GEQ s99 1) (GEQ s128 1) (GEQ s157 1) (GEQ s186 1) (GEQ s215 1) (GEQ s244 1) (GEQ s273 1) (GEQ s302 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-15 finished in 9338 ms.
All properties solved by simple procedures.
Total runtime 136554 ms.
BK_STOP 1652989053612
--------------------
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-28"
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-28, 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-165277017400940"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 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 ;