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-165277017400939.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400939
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652988669111

Running Version 202205111006
[2022-05-19 19:31:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:31:10] [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:31:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 19:31:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 648 ms
[2022-05-19 19:31:11] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 19:31:11] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 10 ms.
[2022-05-19 19:31:11] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-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 13 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 10010 steps, including 254 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 22) seen :8
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 19:31:12] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-19 19:31:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 19:31:13] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2022-05-19 19:31:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:31:13] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2022-05-19 19:31:13] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-19 19:31:13] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
Fused 14 Parikh solutions to 9 different solutions.
Finished Parikh walk after 91 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=91 )
Parikh walk visited 11 properties in 30 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 19:31:13] [INFO ] Flatten gal took : 19 ms
[2022-05-19 19:31:13] [INFO ] Flatten gal took : 6 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2022-05-19 19:31:13] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 25 ms.
[2022-05-19 19:31:13] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Support contains 2880 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2997 transition count 446
Applied a total of 1 rules in 30 ms. Remains 2997 /2998 variables (removed 1) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2997 cols
[2022-05-19 19:31:13] [INFO ] Computed 2552 place invariants in 80 ms
[2022-05-19 19:31:14] [INFO ] Implicit Places using invariants in 1085 ms returned []
// Phase 1: matrix 446 rows 2997 cols
[2022-05-19 19:31:14] [INFO ] Computed 2552 place invariants in 48 ms
[2022-05-19 19:31:16] [INFO ] Implicit Places using invariants and state equation in 2388 ms returned []
Implicit Place search using SMT with State Equation took 3479 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 2997 cols
[2022-05-19 19:31:16] [INFO ] Computed 2552 place invariants in 26 ms
[2022-05-19 19:31:18] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2997/2998 places, 446/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 2997/2998 places, 446/446 transitions.
Support contains 2880 out of 2997 places after structural reductions.
[2022-05-19 19:31:18] [INFO ] Flatten gal took : 206 ms
[2022-05-19 19:31:18] [INFO ] Flatten gal took : 156 ms
[2022-05-19 19:31:18] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 446 rows 2997 cols
[2022-05-19 19:31:19] [INFO ] Computed 2552 place invariants in 13 ms
[2022-05-19 19:31:20] [INFO ] After 1040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 19:31:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-19 19:31:22] [INFO ] [Nat]Absence check using 2 positive and 2550 generalized place invariants in 482 ms returned sat
[2022-05-19 19:31:45] [INFO ] After 22742ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2022-05-19 19:31:45] [INFO ] After 22750ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 19:31:45] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 15 Parikh solutions to 5 different solutions.
Parikh walk visited 11 properties in 36 ms.
Support contains 900 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30143 edges and 2997 vertex of which 2936 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.17 ms
Discarding 61 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Discarding 58 places :
Implicit places reduction removed 58 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 209 rules applied. Total rules applied 210 place count 2878 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 212 place count 2876 transition count 293
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 212 place count 2876 transition count 206
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 86 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 472 place count 2703 transition count 206
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 473 place count 2703 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 474 place count 2702 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 474 place count 2702 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 477 place count 2700 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 478 place count 2699 transition count 203
Applied a total of 478 rules in 534 ms. Remains 2699 /2997 variables (removed 298) and now considering 203/446 (removed 243) transitions.
Finished structural reductions, in 1 iterations. Remains : 2699/2997 places, 203/446 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 412826 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 412826 steps, saw 63289 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 203 rows 2699 cols
[2022-05-19 19:31:49] [INFO ] Computed 2496 place invariants in 18 ms
[2022-05-19 19:31:50] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 19:31:50] [INFO ] [Nat]Absence check using 841 positive place invariants in 162 ms returned sat
[2022-05-19 19:31:51] [INFO ] [Nat]Absence check using 841 positive and 1655 generalized place invariants in 355 ms returned sat
[2022-05-19 19:31:54] [INFO ] After 4642ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2997 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2997 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' '!((p0 U (G(p1) U X(X((X(p2)||p0))))))'
Support contains 61 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2937 transition count 446
Applied a total of 60 rules in 344 ms. Remains 2937 /2997 variables (removed 60) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2022-05-19 19:31:55] [INFO ] Computed 2492 place invariants in 36 ms
[2022-05-19 19:31:59] [INFO ] Implicit Places using invariants in 4240 ms returned []
// Phase 1: matrix 446 rows 2937 cols
[2022-05-19 19:31:59] [INFO ] Computed 2492 place invariants in 58 ms
[2022-05-19 19:32:07] [INFO ] Implicit Places using invariants and state equation in 7767 ms returned [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, 2756]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12014 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2997 places, 446/446 transitions.
Applied a total of 0 rules in 166 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2908/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 1062 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(OR p1 p0), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 8}, { cond=p1, acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 12}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 15}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=13 dest: 11}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=13 dest: 13}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=14 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=15 dest: 16}], [{ cond=(NOT p1), acceptance={} source=16 dest: 6}, { cond=p1, acceptance={} source=16 dest: 16}]], initial=0, aps=[p1:(LEQ s2904 s1), p0:(LEQ (ADD s2873 s2874 s2875 s2876 s2877 s2878 s2879 s2880 s2881 s2882 s2883 s2884 s2885 s2886 s2887 s2888 s2889 s2890 s2891 s2892 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1577 ms.
Product exploration explored 100000 steps with 33333 reset in 1505 ms.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 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 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 11 factoid took 297 ms. Reduced automaton from 17 states, 31 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-01 finished in 17496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 842 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2936 transition count 446
Applied a total of 61 rules in 96 ms. Remains 2936 /2997 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:32:12] [INFO ] Computed 2492 place invariants in 77 ms
[2022-05-19 19:32:14] [INFO ] Implicit Places using invariants in 2180 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:32:14] [INFO ] Computed 2492 place invariants in 55 ms
[2022-05-19 19:32:19] [INFO ] Implicit Places using invariants and state equation in 4250 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 6433 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2997 places, 446/446 transitions.
Applied a total of 0 rules in 85 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2907/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 401 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s2902 (ADD s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 s865 s866 s867 s868 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-02 finished in 7035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(p0))&&(G(X(X(p0)))||p1)))))'
Support contains 60 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2937 transition count 446
Applied a total of 60 rules in 179 ms. Remains 2937 /2997 variables (removed 60) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2022-05-19 19:32:19] [INFO ] Computed 2492 place invariants in 37 ms
[2022-05-19 19:32:24] [INFO ] Implicit Places using invariants in 4302 ms returned []
// Phase 1: matrix 446 rows 2937 cols
[2022-05-19 19:32:24] [INFO ] Computed 2492 place invariants in 43 ms
[2022-05-19 19:32:31] [INFO ] Implicit Places using invariants and state equation in 7387 ms returned [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, 2756]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11693 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2997 places, 446/446 transitions.
Applied a total of 0 rules in 154 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2908/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GT (ADD s2728 s2729 s2730 s2731 s2732 s2733 s2734 s2735 s2736 s2737 s2738 s2739 s2740 s2741 s2742 s2743 s2744 s2745 s2746 s2747 s2748 s2749 s2750...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3023 reset in 724 ms.
Product exploration explored 100000 steps with 3024 reset in 751 ms.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 585 ms. Reduced automaton from 5 states, 15 edges and 2 AP to 8 states, 26 edges and 2 AP.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (AND p1 (NOT p0)), false]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 446 rows 2908 cols
[2022-05-19 19:32:34] [INFO ] Computed 2464 place invariants in 76 ms
[2022-05-19 19:32:35] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 10 factoid took 1052 ms. Reduced automaton from 8 states, 26 edges and 2 AP to 5 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
// Phase 1: matrix 446 rows 2908 cols
[2022-05-19 19:32:36] [INFO ] Computed 2464 place invariants in 62 ms
[2022-05-19 19:32:41] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 3809 ms returned sat
[2022-05-19 19:32:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:32:51] [INFO ] [Real]Absence check using state equation in 10259 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 446 rows 2908 cols
[2022-05-19 19:32:51] [INFO ] Computed 2464 place invariants in 85 ms
[2022-05-19 19:32:56] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 3382 ms returned sat
[2022-05-19 19:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:33:06] [INFO ] [Real]Absence check using state equation in 10645 ms returned unknown
Could not prove EG p1
Support contains 60 out of 2908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2907 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2906 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2906 transition count 444
Applied a total of 4 rules in 598 ms. Remains 2906 /2908 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 2906 cols
[2022-05-19 19:33:07] [INFO ] Computed 2464 place invariants in 70 ms
[2022-05-19 19:33:11] [INFO ] Implicit Places using invariants in 4174 ms returned []
// Phase 1: matrix 444 rows 2906 cols
[2022-05-19 19:33:11] [INFO ] Computed 2464 place invariants in 84 ms
[2022-05-19 19:33:19] [INFO ] Implicit Places using invariants and state equation in 7703 ms returned [2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2698]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11884 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2908 places, 444/446 transitions.
Applied a total of 0 rules in 191 ms. Remains 2877 /2877 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2877/2908 places, 444/446 transitions.
Computed a total of 2877 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2877 transition count 444
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) p1), (X (NOT p0)), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 352 ms. Reduced automaton from 5 states, 14 edges and 2 AP to 5 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Finished random walk after 36 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 493 ms. Reduced automaton from 5 states, 14 edges and 2 AP to 5 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
// Phase 1: matrix 444 rows 2877 cols
[2022-05-19 19:33:21] [INFO ] Computed 2436 place invariants in 70 ms
[2022-05-19 19:33:26] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 4295 ms returned sat
[2022-05-19 19:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:33:36] [INFO ] [Real]Absence check using state equation in 9760 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 444 rows 2877 cols
[2022-05-19 19:33:36] [INFO ] Computed 2436 place invariants in 63 ms
[2022-05-19 19:33:40] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3154 ms returned sat
[2022-05-19 19:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:33:49] [INFO ] [Real]Absence check using state equation in 8994 ms returned sat
[2022-05-19 19:33:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:33:54] [INFO ] [Nat]Absence check using 0 positive and 2436 generalized place invariants in 3294 ms returned sat
[2022-05-19 19:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:34:04] [INFO ] [Nat]Absence check using state equation in 10729 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 2866 reset in 639 ms.
Product exploration explored 100000 steps with 2882 reset in 640 ms.
Built C files in :
/tmp/ltsmin915700711405505986
[2022-05-19 19:34:06] [INFO ] Computing symmetric may disable matrix : 444 transitions.
[2022-05-19 19:34:06] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:34:06] [INFO ] Computing symmetric may enable matrix : 444 transitions.
[2022-05-19 19:34:06] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:34:06] [INFO ] Computing Do-Not-Accords matrix : 444 transitions.
[2022-05-19 19:34:06] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:34:06] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin915700711405505986
Running compilation step : cd /tmp/ltsmin915700711405505986;'/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 2181 ms.
Running link step : cd /tmp/ltsmin915700711405505986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin915700711405505986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10752928921574991954.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 60 out of 2877 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2877/2877 places, 444/444 transitions.
Applied a total of 0 rules in 184 ms. Remains 2877 /2877 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 2877 cols
[2022-05-19 19:34:21] [INFO ] Computed 2436 place invariants in 64 ms
[2022-05-19 19:34:25] [INFO ] Implicit Places using invariants in 4163 ms returned []
// Phase 1: matrix 444 rows 2877 cols
[2022-05-19 19:34:25] [INFO ] Computed 2436 place invariants in 62 ms
[2022-05-19 19:34:33] [INFO ] Implicit Places using invariants and state equation in 7881 ms returned []
Implicit Place search using SMT with State Equation took 12047 ms to find 0 implicit places.
[2022-05-19 19:34:33] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 444 rows 2877 cols
[2022-05-19 19:34:33] [INFO ] Computed 2436 place invariants in 66 ms
[2022-05-19 19:34:34] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2877/2877 places, 444/444 transitions.
Built C files in :
/tmp/ltsmin5830167265898068619
[2022-05-19 19:34:34] [INFO ] Computing symmetric may disable matrix : 444 transitions.
[2022-05-19 19:34:34] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:34:34] [INFO ] Computing symmetric may enable matrix : 444 transitions.
[2022-05-19 19:34:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:34:34] [INFO ] Computing Do-Not-Accords matrix : 444 transitions.
[2022-05-19 19:34:34] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:34:34] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5830167265898068619
Running compilation step : cd /tmp/ltsmin5830167265898068619;'/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 2147 ms.
Running link step : cd /tmp/ltsmin5830167265898068619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5830167265898068619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2559796045267832200.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 19:34:50] [INFO ] Flatten gal took : 92 ms
[2022-05-19 19:34:50] [INFO ] Flatten gal took : 85 ms
[2022-05-19 19:34:50] [INFO ] Time to serialize gal into /tmp/LTL3409172360020425194.gal : 14 ms
[2022-05-19 19:34:50] [INFO ] Time to serialize properties into /tmp/LTL12562450614697338753.ltl : 1 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/LTL3409172360020425194.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12562450614697338753.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/LTL3409172...267
Read 1 LTL properties
Checking formula 0 : !((G(F((X(X("((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sstart_6+Sstart_7)))+(((Sstart_8+Sstart_9)+(Sstart_10...1383
Formula 0 simplified : !GF(XX"((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sstart_6+Sstart_7)))+(((Sstart_8+Sstart_9)+(Sstart_10+Sst...1365
Detected timeout of ITS tools.
[2022-05-19 19:35:05] [INFO ] Flatten gal took : 83 ms
[2022-05-19 19:35:05] [INFO ] Applying decomposition
[2022-05-19 19:35:05] [INFO ] Flatten gal took : 72 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/graph5578973150302343166.txt' '-o' '/tmp/graph5578973150302343166.bin' '-w' '/tmp/graph5578973150302343166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5578973150302343166.bin' '-l' '-1' '-v' '-w' '/tmp/graph5578973150302343166.weights' '-q' '0' '-e' '0.001'
[2022-05-19 19:35:05] [INFO ] Decomposing Gal with order
[2022-05-19 19:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:35:06] [INFO ] Removed a total of 290 redundant transitions.
[2022-05-19 19:35:06] [INFO ] Flatten gal took : 509 ms
[2022-05-19 19:35:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 402 labels/synchronizations in 239 ms.
[2022-05-19 19:35:07] [INFO ] Time to serialize gal into /tmp/LTL4575534749332733085.gal : 27 ms
[2022-05-19 19:35:07] [INFO ] Time to serialize properties into /tmp/LTL11086361628759058682.ltl : 1 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/LTL4575534749332733085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11086361628759058682.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/LTL4575534...267
Read 1 LTL properties
Checking formula 0 : !((G(F((X(X("((((((gu0.Sstart_0+gu0.Sstart_1)+(gu0.Sstart_2+gu0.Sstart_3))+((gu0.Sstart_4+gu0.Sstart_5)+(gu0.Sstart_6+gu0.Sstart_7)))+...1893
Formula 0 simplified : !GF(XX"((((((gu0.Sstart_0+gu0.Sstart_1)+(gu0.Sstart_2+gu0.Sstart_3))+((gu0.Sstart_4+gu0.Sstart_5)+(gu0.Sstart_6+gu0.Sstart_7)))+(((g...1875
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6886851699519392924
[2022-05-19 19:35:22] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6886851699519392924
Running compilation step : cd /tmp/ltsmin6886851699519392924;'/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 1830 ms.
Running link step : cd /tmp/ltsmin6886851699519392924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6886851699519392924;'/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((LTLAPp0==true)))&&([](X(X((LTLAPp0==true))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-03 finished in 197506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(F(p0)))&&G(p1))))'
Support contains 871 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2936 transition count 446
Applied a total of 61 rules in 103 ms. Remains 2936 /2997 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:37] [INFO ] Computed 2492 place invariants in 56 ms
[2022-05-19 19:35:40] [INFO ] Implicit Places using invariants in 2955 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:40] [INFO ] Computed 2492 place invariants in 55 ms
[2022-05-19 19:35:44] [INFO ] Implicit Places using invariants and state equation in 4328 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 7289 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2997 places, 446/446 transitions.
Applied a total of 0 rules in 90 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2907/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s2901 (ADD s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 s865 s866 s867 s868 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-04 finished in 7662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X(X(p0)))))))'
Support contains 116 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2965 transition count 446
Applied a total of 32 rules in 184 ms. Remains 2965 /2997 variables (removed 32) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2965 cols
[2022-05-19 19:35:45] [INFO ] Computed 2521 place invariants in 17 ms
[2022-05-19 19:35:49] [INFO ] Implicit Places using invariants in 4279 ms returned []
// Phase 1: matrix 446 rows 2965 cols
[2022-05-19 19:35:49] [INFO ] Computed 2521 place invariants in 18 ms
[2022-05-19 19:35:58] [INFO ] Implicit Places using invariants and state equation in 8896 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 13184 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2936/2997 places, 446/446 transitions.
Applied a total of 0 rules in 175 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2936/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (LEQ (ADD s2640 s2641 s2642 s2643 s2644 s2645 s2646 s2647 s2648 s2649 s2650 s2651 s2652 s2653 s2654 s2655 s2656 s2657 s2658 s2659 s2660 s2661 s266...], 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-05 finished in 13833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(X(p1))))'
Support contains 59 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2936 transition count 446
Applied a total of 61 rules in 169 ms. Remains 2936 /2997 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:35:58] [INFO ] Computed 2492 place invariants in 55 ms
[2022-05-19 19:36:03] [INFO ] Implicit Places using invariants in 4472 ms returned []
// Phase 1: matrix 446 rows 2936 cols
[2022-05-19 19:36:03] [INFO ] Computed 2492 place invariants in 51 ms
[2022-05-19 19:36:11] [INFO ] Implicit Places using invariants and state equation in 8193 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 12667 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2997 places, 446/446 transitions.
Applied a total of 0 rules in 163 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2907/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT 2 (ADD s2756 s2757 s2758 s2759 s2760 s2761 s2762 s2763 s2764 s2765 s2766 s2767 s2768 s2769 s2770 s2771 s2772 s2773 s2774 s2775 s2776 s2777 s2778 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1758 ms.
Product exploration explored 100000 steps with 50000 reset in 1771 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-06 finished in 17445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(X(p0) U p1)||X(p2))))'
Support contains 872 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2937 transition count 446
Applied a total of 60 rules in 82 ms. Remains 2937 /2997 variables (removed 60) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2022-05-19 19:36:16] [INFO ] Computed 2492 place invariants in 36 ms
[2022-05-19 19:36:19] [INFO ] Implicit Places using invariants in 3477 ms returned []
// Phase 1: matrix 446 rows 2937 cols
[2022-05-19 19:36:19] [INFO ] Computed 2492 place invariants in 32 ms
[2022-05-19 19:36:25] [INFO ] Implicit Places using invariants and state equation in 5346 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 8832 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2997 places, 446/446 transitions.
Applied a total of 0 rules in 82 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2908/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 p0 (NOT p2)), (AND p1 p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1537 ms.
Product exploration explored 100000 steps with 33333 reset in 1554 ms.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 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 p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 8 factoid took 143 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-07 finished in 13469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((p0 U false) U true) U p1))))'
Support contains 872 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30143 edges and 2997 vertex of which 2936 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.19 ms
Discarding 61 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2935 transition count 445
Applied a total of 2 rules in 222 ms. Remains 2935 /2997 variables (removed 62) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 2935 cols
[2022-05-19 19:36:29] [INFO ] Computed 2492 place invariants in 53 ms
[2022-05-19 19:36:33] [INFO ] Implicit Places using invariants in 3510 ms returned []
// Phase 1: matrix 445 rows 2935 cols
[2022-05-19 19:36:33] [INFO ] Computed 2492 place invariants in 71 ms
[2022-05-19 19:36:41] [INFO ] Implicit Places using invariants and state equation in 7877 ms returned [2669, 2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 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 58 places :
Implicit Place search using SMT with State Equation took 11413 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2997 places, 445/446 transitions.
Applied a total of 0 rules in 109 ms. Remains 2877 /2877 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2877/2997 places, 445/446 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ (ADD s2843 s2844 s2845 s2846 s2847 s2848 s2849 s2850 s2851 s2852 s2853 s2854 s2855 s2856 s2857 s2858 s2859 s2860 s2861 s2862 s2863 s2864 s286...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2812 reset in 1259 ms.
Product exploration explored 100000 steps with 2819 reset in 1267 ms.
Computed a total of 2877 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2877 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1095951 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{}
Probabilistic random walk after 1095951 steps, saw 159147 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 445 rows 2877 cols
[2022-05-19 19:36:48] [INFO ] Computed 2436 place invariants in 445 ms
[2022-05-19 19:36:49] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 19:36:50] [INFO ] [Nat]Absence check using 0 positive and 2436 generalized place invariants in 509 ms returned sat
[2022-05-19 19:36:53] [INFO ] After 3707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 19:37:03] [INFO ] After 13151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 19:37:03] [INFO ] After 14175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Support contains 872 out of 2877 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2877/2877 places, 445/445 transitions.
Applied a total of 0 rules in 104 ms. Remains 2877 /2877 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 2877 cols
[2022-05-19 19:37:04] [INFO ] Computed 2436 place invariants in 439 ms
[2022-05-19 19:37:07] [INFO ] Implicit Places using invariants in 3888 ms returned []
// Phase 1: matrix 445 rows 2877 cols
[2022-05-19 19:37:08] [INFO ] Computed 2436 place invariants in 448 ms
[2022-05-19 19:37:16] [INFO ] Implicit Places using invariants and state equation in 8447 ms returned []
Implicit Place search using SMT with State Equation took 12340 ms to find 0 implicit places.
[2022-05-19 19:37:16] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 445 rows 2877 cols
[2022-05-19 19:37:16] [INFO ] Computed 2436 place invariants in 454 ms
[2022-05-19 19:37:17] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2877/2877 places, 445/445 transitions.
Computed a total of 2877 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2877 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1100991 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :{}
Probabilistic random walk after 1100991 steps, saw 159538 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 445 rows 2877 cols
[2022-05-19 19:37:22] [INFO ] Computed 2436 place invariants in 435 ms
[2022-05-19 19:37:23] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 19:37:23] [INFO ] [Nat]Absence check using 0 positive and 2436 generalized place invariants in 485 ms returned sat
[2022-05-19 19:37:27] [INFO ] After 3627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 19:37:37] [INFO ] After 13101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 19:37:37] [INFO ] After 14033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2813 reset in 1268 ms.
Product exploration explored 100000 steps with 2812 reset in 1248 ms.
Built C files in :
/tmp/ltsmin16870097329164425117
[2022-05-19 19:37:40] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2022-05-19 19:37:40] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:37:40] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2022-05-19 19:37:40] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:37:40] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2022-05-19 19:37:40] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:37:40] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16870097329164425117
Running compilation step : cd /tmp/ltsmin16870097329164425117;'/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 2200 ms.
Running link step : cd /tmp/ltsmin16870097329164425117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16870097329164425117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased306737387597026037.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 872 out of 2877 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2877/2877 places, 445/445 transitions.
Applied a total of 0 rules in 105 ms. Remains 2877 /2877 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 2877 cols
[2022-05-19 19:37:55] [INFO ] Computed 2436 place invariants in 454 ms
[2022-05-19 19:37:59] [INFO ] Implicit Places using invariants in 3880 ms returned []
// Phase 1: matrix 445 rows 2877 cols
[2022-05-19 19:37:59] [INFO ] Computed 2436 place invariants in 442 ms
[2022-05-19 19:38:07] [INFO ] Implicit Places using invariants and state equation in 8246 ms returned []
Implicit Place search using SMT with State Equation took 12131 ms to find 0 implicit places.
[2022-05-19 19:38:07] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 445 rows 2877 cols
[2022-05-19 19:38:07] [INFO ] Computed 2436 place invariants in 434 ms
[2022-05-19 19:38:08] [INFO ] Dead Transitions using invariants and state equation in 1464 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2877/2877 places, 445/445 transitions.
Built C files in :
/tmp/ltsmin7680361263552988153
[2022-05-19 19:38:08] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2022-05-19 19:38:08] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:38:08] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2022-05-19 19:38:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:38:08] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2022-05-19 19:38:08] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:38:08] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7680361263552988153
Running compilation step : cd /tmp/ltsmin7680361263552988153;'/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 2212 ms.
Running link step : cd /tmp/ltsmin7680361263552988153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7680361263552988153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5368836102137108525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 19:38:24] [INFO ] Flatten gal took : 75 ms
[2022-05-19 19:38:24] [INFO ] Flatten gal took : 76 ms
[2022-05-19 19:38:24] [INFO ] Time to serialize gal into /tmp/LTL11454123951310478004.gal : 6 ms
[2022-05-19 19:38:24] [INFO ] Time to serialize properties into /tmp/LTL112465585466943225.ltl : 1 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/LTL11454123951310478004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL112465585466943225.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/LTL1145412...266
Read 1 LTL properties
Checking formula 0 : !((X(G(F("(((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+s6_13)+(s6_14+s6_15))))+((((s...7732
Formula 0 simplified : !XGF"(((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+s6_13)+(s6_14+s6_15))))+((((s6_1...7724
Detected timeout of ITS tools.
[2022-05-19 19:38:39] [INFO ] Flatten gal took : 77 ms
[2022-05-19 19:38:39] [INFO ] Applying decomposition
[2022-05-19 19:38:39] [INFO ] Flatten gal took : 70 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/graph6354196376590792668.txt' '-o' '/tmp/graph6354196376590792668.bin' '-w' '/tmp/graph6354196376590792668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6354196376590792668.bin' '-l' '-1' '-v' '-w' '/tmp/graph6354196376590792668.weights' '-q' '0' '-e' '0.001'
[2022-05-19 19:38:40] [INFO ] Decomposing Gal with order
[2022-05-19 19:38:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:38:40] [INFO ] Removed a total of 327 redundant transitions.
[2022-05-19 19:38:40] [INFO ] Flatten gal took : 153 ms
[2022-05-19 19:38:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 444 labels/synchronizations in 39 ms.
[2022-05-19 19:38:40] [INFO ] Time to serialize gal into /tmp/LTL18359433217137545223.gal : 9 ms
[2022-05-19 19:38:40] [INFO ] Time to serialize properties into /tmp/LTL11976718998184763435.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/LTL18359433217137545223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11976718998184763435.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/LTL1835943...268
Read 1 LTL properties
Checking formula 0 : !((X(G(F("(((((((gi28.gi8.gu134.s6_0+gi28.gi8.gu134.s6_1)+(gi28.gi8.gu134.s6_2+gi28.gi8.gu134.s6_3))+((gi28.gi8.gu134.s6_4+gi28.gi8.gu...11550
Formula 0 simplified : !XGF"(((((((gi28.gi8.gu134.s6_0+gi28.gi8.gu134.s6_1)+(gi28.gi8.gu134.s6_2+gi28.gi8.gu134.s6_3))+((gi28.gi8.gu134.s6_4+gi28.gi8.gu134...11542
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5394766045442464065
[2022-05-19 19:38:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5394766045442464065
Running compilation step : cd /tmp/ltsmin5394766045442464065;'/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 1836 ms.
Running link step : cd /tmp/ltsmin5394766045442464065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5394766045442464065;'/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([](((((LTLAPp0==true) U false) U true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-08 finished in 161434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30143 edges and 2997 vertex of which 2907 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.20 ms
Discarding 90 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2904 transition count 441
Applied a total of 5 rules in 405 ms. Remains 2904 /2997 variables (removed 93) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2904 cols
[2022-05-19 19:39:11] [INFO ] Computed 2465 place invariants in 175 ms
[2022-05-19 19:39:15] [INFO ] Implicit Places using invariants in 4358 ms returned []
// Phase 1: matrix 441 rows 2904 cols
[2022-05-19 19:39:15] [INFO ] Computed 2465 place invariants in 164 ms
[2022-05-19 19:39:23] [INFO ] Implicit Places using invariants and state equation in 7871 ms returned [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, 2669, 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, 2727]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 12235 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2997 places, 441/446 transitions.
Applied a total of 0 rules in 194 ms. Remains 2846 /2846 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2846/2997 places, 441/446 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s1)], 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 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-15 finished in 12903 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(p0))&&(G(X(X(p0)))||p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((p0 U false) U true) U p1))))'
[2022-05-19 19:39:24] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5024641069540558814
[2022-05-19 19:39:24] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2022-05-19 19:39:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:39:24] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2022-05-19 19:39:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:39:24] [INFO ] Applying decomposition
[2022-05-19 19:39:24] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2022-05-19 19:39:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:39:24] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5024641069540558814
Running compilation step : cd /tmp/ltsmin5024641069540558814;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-05-19 19:39:24] [INFO ] Flatten gal took : 75 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/graph8965059220662767658.txt' '-o' '/tmp/graph8965059220662767658.bin' '-w' '/tmp/graph8965059220662767658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8965059220662767658.bin' '-l' '-1' '-v' '-w' '/tmp/graph8965059220662767658.weights' '-q' '0' '-e' '0.001'
[2022-05-19 19:39:25] [INFO ] Decomposing Gal with order
[2022-05-19 19:39:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:39:25] [INFO ] Removed a total of 185 redundant transitions.
[2022-05-19 19:39:25] [INFO ] Flatten gal took : 131 ms
[2022-05-19 19:39:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 265 labels/synchronizations in 26 ms.
[2022-05-19 19:39:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality14266766560349586268.gal : 10 ms
[2022-05-19 19:39:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality6513738290395914715.ltl : 1 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/LTLCardinality14266766560349586268.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6513738290395914715.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/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((G(F((X(X("((((((gu84.Sstart_0+gu84.Sstart_1)+(gu84.Sstart_2+gu84.Sstart_3))+((gu84.Sstart_4+gu84.Sstart_5)+(gu84.Sstart_6+gu84.Ssta...2253
Formula 0 simplified : !GF(XX"((((((gu84.Sstart_0+gu84.Sstart_1)+(gu84.Sstart_2+gu84.Sstart_3))+((gu84.Sstart_4+gu84.Sstart_5)+(gu84.Sstart_6+gu84.Sstart_7...2235
Compilation finished in 2900 ms.
Running link step : cd /tmp/ltsmin5024641069540558814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5024641069540558814;'/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((LTLAPp0==true)))&&([](X(X((LTLAPp0==true))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: LTL layer: formula: [](<>((X(X((LTLAPp0==true)))&&([](X(X((LTLAPp0==true))))||(LTLAPp1==true)))))
pins2lts-mc-linux64( 2/ 8), 0.030: "[](<>((X(X((LTLAPp0==true)))&&([](X(X((LTLAPp0==true))))||(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.031: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.187: There are 451 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.187: State length is 2998, there are 465 groups
pins2lts-mc-linux64( 0/ 8), 0.187: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.187: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.187: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.188: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.349: [Blue] ~33 levels ~960 states ~6176 transitions
pins2lts-mc-linux64( 2/ 8), 0.415: [Blue] ~33 levels ~1920 states ~10176 transitions
pins2lts-mc-linux64( 5/ 8), 0.539: [Blue] ~40 levels ~3840 states ~23848 transitions
pins2lts-mc-linux64( 5/ 8), 0.725: [Blue] ~40 levels ~7680 states ~38112 transitions
pins2lts-mc-linux64( 5/ 8), 1.499: [Blue] ~40 levels ~15360 states ~66656 transitions
pins2lts-mc-linux64( 5/ 8), 2.347: [Blue] ~40 levels ~30720 states ~141696 transitions
pins2lts-mc-linux64( 5/ 8), 4.069: [Blue] ~40 levels ~61440 states ~311864 transitions
pins2lts-mc-linux64( 3/ 8), 7.299: [Blue] ~36 levels ~122880 states ~674584 transitions
pins2lts-mc-linux64( 5/ 8), 13.486: [Blue] ~40 levels ~245760 states ~1264736 transitions
pins2lts-mc-linux64( 5/ 8), 30.691: [Blue] ~40 levels ~491520 states ~2747720 transitions
pins2lts-mc-linux64( 3/ 8), 66.322: [Blue] ~37 levels ~983040 states ~6443168 transitions
pins2lts-mc-linux64( 5/ 8), 126.291: [Blue] ~40 levels ~1966080 states ~12338552 transitions
pins2lts-mc-linux64( 5/ 8), 225.374: [Blue] ~40 levels ~3932160 states ~25751632 transitions
pins2lts-mc-linux64( 5/ 8), 426.040: [Blue] ~40 levels ~7864320 states ~55061248 transitions
pins2lts-mc-linux64( 5/ 8), 476.672: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 476.930:
pins2lts-mc-linux64( 0/ 8), 476.930: Explored 8380406 states 65473826 transitions, fanout: 7.813
pins2lts-mc-linux64( 0/ 8), 476.931: Total exploration time 476.730 sec (476.480 sec minimum, 476.569 sec on average)
pins2lts-mc-linux64( 0/ 8), 476.931: States per second: 17579, Transitions per second: 137339
pins2lts-mc-linux64( 0/ 8), 476.931:
pins2lts-mc-linux64( 0/ 8), 476.931: State space has 8384342 states, 2796630 are accepting
pins2lts-mc-linux64( 0/ 8), 476.931: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 476.931: blue states: 8380406 (99.95%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 476.931: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 476.931: all-red states: 2797440 (33.37%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 476.931:
pins2lts-mc-linux64( 0/ 8), 476.931: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 476.931:
pins2lts-mc-linux64( 0/ 8), 476.931: Queue width: 8B, total height: 282, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 476.931: Tree memory: 320.0MB, 40.0 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 476.931: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 476.931: Stored 448 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 476.931: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 476.931: Est. total memory use: 320.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5024641069540558814;'/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((LTLAPp0==true)))&&([](X(X((LTLAPp0==true))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5024641069540558814;'/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((LTLAPp0==true)))&&([](X(X((LTLAPp0==true))))||(LTLAPp1==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:02:11] [INFO ] Applying decomposition
[2022-05-19 20:02:12] [INFO ] Flatten gal took : 582 ms
[2022-05-19 20:02:12] [INFO ] Decomposing Gal with order
[2022-05-19 20:02:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 20:02:13] [INFO ] Removed a total of 239 redundant transitions.
[2022-05-19 20:02:14] [INFO ] Flatten gal took : 1231 ms
[2022-05-19 20:02:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 155 ms.
[2022-05-19 20:02:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality13925831588548516231.gal : 44 ms
[2022-05-19 20:02:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality14749946291044354059.ltl : 7 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/LTLCardinality13925831588548516231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14749946291044354059.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/LTLCardina...290
Read 2 LTL properties
Checking formula 0 : !((G(F((X(X("((((((gtsid0.Sstart_0+gtsid1.Sstart_1)+(gtsid2.Sstart_2+gtsid3.Sstart_3))+((gtsid4.Sstart_4+gtsid5.Sstart_5)+(gtsid6.Ssta...2346
Formula 0 simplified : !GF(XX"((((((gtsid0.Sstart_0+gtsid1.Sstart_1)+(gtsid2.Sstart_2+gtsid3.Sstart_3))+((gtsid4.Sstart_4+gtsid5.Sstart_5)+(gtsid6.Sstart_6...2328
Detected timeout of ITS tools.
[2022-05-19 20:25:04] [INFO ] Flatten gal took : 550 ms
[2022-05-19 20:25:05] [INFO ] Input system was already deterministic with 446 transitions.
[2022-05-19 20:25:05] [INFO ] Transformed 2997 places.
[2022-05-19 20:25:05] [INFO ] Transformed 446 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 20:25:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality12165642102040290719.gal : 7 ms
[2022-05-19 20:25:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality5030076676318623425.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/LTLCardinality12165642102040290719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5030076676318623425.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/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((X(X("((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sstart_6+Sstart_7)))+(((Sstart_8+Sstart_9)+(Sstart_10...1383
Formula 0 simplified : !GF(XX"((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sstart_6+Sstart_7)))+(((Sstart_8+Sstart_9)+(Sstart_10+Sst...1365

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-165277017400939"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;