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-165277017400916.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400916
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 6.1K Apr 30 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 13:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 13:21 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.3K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 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 72K 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-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652981658480

Running Version 202205111006
[2022-05-19 17:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 17:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:34:19] [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 17:34:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 17:34:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 573 ms
[2022-05-19 17:34:20] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 17:34:20] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 10 ms.
[2022-05-19 17:34:20] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10003 steps, including 558 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 10001 steps, including 207 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 176 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 210 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 211 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 212 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 208 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 211 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 173 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10003 steps, including 206 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 17:34:21] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-19 17:34:21] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-19 17:34:22] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:9
[2022-05-19 17:34:22] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :4 real:9
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-19 17:34:22] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :4 real:9
[2022-05-19 17:34:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:34:22] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2022-05-19 17:34:22] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-19 17:34:22] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 11 different solutions.
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 13 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2022-05-19 17:34:22] [INFO ] Flatten gal took : 17 ms
[2022-05-19 17:34:22] [INFO ] Flatten gal took : 4 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2022-05-19 17:34:22] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 13 ms.
[2022-05-19 17:34:22] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 502 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 9 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:22] [INFO ] Computed 350 place invariants in 21 ms
[2022-05-19 17:34:22] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:22] [INFO ] Computed 350 place invariants in 24 ms
[2022-05-19 17:34:22] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:22] [INFO ] Computed 350 place invariants in 8 ms
[2022-05-19 17:34:23] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 524/550 places, 176/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 524/550 places, 176/176 transitions.
Support contains 502 out of 524 places after structural reductions.
[2022-05-19 17:34:23] [INFO ] Flatten gal took : 38 ms
[2022-05-19 17:34:23] [INFO ] Flatten gal took : 32 ms
[2022-05-19 17:34:23] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 370 out of 524 places (down from 502) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 689 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1000 steps, including 7 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 9 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 9 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 5 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 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 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 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 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 7 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 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:23] [INFO ] Computed 350 place invariants in 11 ms
[2022-05-19 17:34:24] [INFO ] [Real]Absence check using 0 positive and 350 generalized place invariants in 51 ms returned sat
[2022-05-19 17:34:24] [INFO ] After 225ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:9
[2022-05-19 17:34:24] [INFO ] After 352ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3 real:10
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-05-19 17:34:24] [INFO ] After 806ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :3 real:10
[2022-05-19 17:34:24] [INFO ] [Nat]Absence check using 0 positive and 350 generalized place invariants in 48 ms returned sat
[2022-05-19 17:34:25] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2022-05-19 17:34:25] [INFO ] After 960ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 310 ms.
[2022-05-19 17:34:26] [INFO ] After 1597ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 11 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 12 properties in 13 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 12 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 63 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:26] [INFO ] Computed 350 place invariants in 7 ms
[2022-05-19 17:34:27] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:27] [INFO ] Computed 350 place invariants in 7 ms
[2022-05-19 17:34:27] [INFO ] Implicit Places using invariants and state equation in 554 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 913 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s364 1) (GEQ s365 1) (GEQ s366 1) (GEQ s367 1) (GEQ s368 1) (GEQ s369 1) (GEQ s370 1) (GEQ s371 1) (GEQ s372 1) (GEQ s373 1) (GEQ s374 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-00 finished in 1431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X(X(X(G(p0)))))&&(p0 U F(p1))))&&p0)))'
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:27] [INFO ] Computed 350 place invariants in 7 ms
[2022-05-19 17:34:28] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:28] [INFO ] Computed 350 place invariants in 13 ms
[2022-05-19 17:34:28] [INFO ] Implicit Places using invariants and state equation in 560 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 875 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 2}]], initial=0, aps=[p0:(GEQ s509 1), p1:(GEQ s511 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-02 finished in 1200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 22 out of 524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 512 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.12 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 510 transition count 172
Applied a total of 5 rules in 55 ms. Remains 510 /524 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 510 cols
[2022-05-19 17:34:29] [INFO ] Computed 340 place invariants in 8 ms
[2022-05-19 17:34:29] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 172 rows 510 cols
[2022-05-19 17:34:29] [INFO ] Computed 340 place invariants in 15 ms
[2022-05-19 17:34:29] [INFO ] Implicit Places using invariants and state equation in 528 ms returned [430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 824 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/524 places, 172/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 499/524 places, 172/176 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s411 1) (GEQ s433 1)) (AND (GEQ s414 1) (GEQ s436 1)) (AND (GEQ s415 1) (GEQ s437 1)) (AND (GEQ s418 1) (GEQ s440 1)) (AND (GEQ s410 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 30 steps with 2 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-03 finished in 985 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F(p0) U p1)&&X(F(X(!p0))))))'
Support contains 13 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:30] [INFO ] Computed 350 place invariants in 5 ms
[2022-05-19 17:34:30] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:30] [INFO ] Computed 350 place invariants in 8 ms
[2022-05-19 17:34:30] [INFO ] Implicit Places using invariants and state equation in 491 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 805 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR p0 p1), (OR p0 p1), true, p1, p0, (AND p1 p0), p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LT s507 1), p0:(OR (AND (GEQ s0 1) (GEQ s478 1)) (AND (GEQ s0 1) (GEQ s479 1)) (AND (GEQ s0 1) (GEQ s480 1)) (AND (GEQ s0 1) (GEQ s481 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-04 finished in 1121 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U G((G(p0)&&p1))))&&G(p2))))'
Support contains 45 out of 524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 522 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 522 transition count 174
Applied a total of 3 rules in 48 ms. Remains 522 /524 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 522 cols
[2022-05-19 17:34:31] [INFO ] Computed 350 place invariants in 12 ms
[2022-05-19 17:34:31] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 174 rows 522 cols
[2022-05-19 17:34:31] [INFO ] Computed 350 place invariants in 5 ms
[2022-05-19 17:34:32] [INFO ] Implicit Places using invariants and state equation in 555 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 868 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/524 places, 174/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/524 places, 174/176 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s376 1) (GEQ s453 1)) (AND (GEQ s380 1) (GEQ s457 1)) (AND (GEQ s384 1) (GEQ s461 1)) (AND (GEQ s385 1) (GEQ s462 1)) (AND (GEQ s378 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-05 finished in 1057 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!(!p0 U (X(p0)&&p1)))||G(X(X(p2))))))'
Support contains 35 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:32] [INFO ] Computed 350 place invariants in 5 ms
[2022-05-19 17:34:32] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:34:32] [INFO ] Computed 350 place invariants in 5 ms
[2022-05-19 17:34:33] [INFO ] Implicit Places using invariants and state equation in 521 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 827 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, (AND p0 (NOT p2)), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND (NOT p2) p0 p1), (AND p1 p0), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND p0 p2), acceptance={} source=1 dest: 8}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=3, aps=[p0:(OR (GEQ s484 1) (GEQ s483 1) (GEQ s482 1) (GEQ s481 1) (GEQ s480 1) (GEQ s479 1) (GEQ s478 1) (GEQ s477 1) (GEQ s476 1) (GEQ s475 1) (GEQ s474 1)), p2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6928 reset in 239 ms.
Product exploration explored 100000 steps with 6930 reset in 232 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 886 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 8 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 372 ms :[true, (NOT p2), p0, (AND p0 (NOT p2)), (AND p1 p0), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 690 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:34:35] [INFO ] Computed 340 place invariants in 19 ms
[2022-05-19 17:34:35] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 40 ms returned sat
[2022-05-19 17:34:35] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 17:34:35] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 45 ms returned sat
[2022-05-19 17:34:36] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2022-05-19 17:34:36] [INFO ] After 521ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 180 ms.
[2022-05-19 17:34:36] [INFO ] After 955ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 5 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 7 properties in 5 ms. (steps per millisecond=6 )
Parikh walk visited 7 properties in 4 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND (NOT p2) p1 (NOT p0)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND p2 p1 (NOT p0))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F (AND p2 p0)), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p0), (F p1)]
Knowledge based reduction with 22 factoid took 1436 ms. Reduced automaton from 8 states, 20 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Support contains 35 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:34:38] [INFO ] Computed 340 place invariants in 17 ms
[2022-05-19 17:34:39] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:34:39] [INFO ] Computed 340 place invariants in 15 ms
[2022-05-19 17:34:39] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:34:39] [INFO ] Computed 340 place invariants in 17 ms
[2022-05-19 17:34:39] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 694 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:34:40] [INFO ] Computed 340 place invariants in 16 ms
[2022-05-19 17:34:41] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 42 ms returned sat
[2022-05-19 17:34:41] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 17:34:41] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 41 ms returned sat
[2022-05-19 17:34:41] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 17:34:41] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-05-19 17:34:41] [INFO ] After 606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 644 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Product exploration explored 100000 steps with 6913 reset in 160 ms.
Product exploration explored 100000 steps with 6930 reset in 246 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Support contains 35 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 501 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 73 ms. Remains 501 /513 variables (removed 12) and now considering 175/176 (removed 1) transitions.
[2022-05-19 17:34:44] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 175 rows 501 cols
[2022-05-19 17:34:44] [INFO ] Computed 330 place invariants in 23 ms
[2022-05-19 17:34:44] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/513 places, 175/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/513 places, 175/176 transitions.
Product exploration explored 100000 steps with 6924 reset in 184 ms.
Product exploration explored 100000 steps with 6929 reset in 208 ms.
Built C files in :
/tmp/ltsmin6128350872026981664
[2022-05-19 17:34:44] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6128350872026981664
Running compilation step : cd /tmp/ltsmin6128350872026981664;'/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 489 ms.
Running link step : cd /tmp/ltsmin6128350872026981664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6128350872026981664;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13196248523892086021.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 22 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:34:59] [INFO ] Computed 340 place invariants in 18 ms
[2022-05-19 17:35:00] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:35:00] [INFO ] Computed 340 place invariants in 12 ms
[2022-05-19 17:35:00] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:35:00] [INFO ] Computed 340 place invariants in 15 ms
[2022-05-19 17:35:00] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin16433323268379724025
[2022-05-19 17:35:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16433323268379724025
Running compilation step : cd /tmp/ltsmin16433323268379724025;'/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 395 ms.
Running link step : cd /tmp/ltsmin16433323268379724025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16433323268379724025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2061987477358219412.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 17:35:16] [INFO ] Flatten gal took : 26 ms
[2022-05-19 17:35:16] [INFO ] Flatten gal took : 25 ms
[2022-05-19 17:35:16] [INFO ] Time to serialize gal into /tmp/LTL15043409824172187486.gal : 4 ms
[2022-05-19 17:35:16] [INFO ] Time to serialize properties into /tmp/LTL9010062688443333670.ltl : 0 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/LTL15043409824172187486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9010062688443333670.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/LTL1504340...267
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((s4_10>=1)||(s4_9>=1))||((s4_8>=1)||(s4_7>=1)))||(((s4_6>=1)||(s4_5>=1))||((s4_4>=1)||(s4_3>=1))))||(((s4_2>=1)||(s4...661
Formula 0 simplified : !G(G!(!"(((((s4_10>=1)||(s4_9>=1))||((s4_8>=1)||(s4_7>=1)))||(((s4_6>=1)||(s4_5>=1))||((s4_4>=1)||(s4_3>=1))))||(((s4_2>=1)||(s4_1>=...632
Detected timeout of ITS tools.
[2022-05-19 17:35:31] [INFO ] Flatten gal took : 21 ms
[2022-05-19 17:35:31] [INFO ] Applying decomposition
[2022-05-19 17:35:31] [INFO ] Flatten gal took : 20 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/graph16964863605458185070.txt' '-o' '/tmp/graph16964863605458185070.bin' '-w' '/tmp/graph16964863605458185070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16964863605458185070.bin' '-l' '-1' '-v' '-w' '/tmp/graph16964863605458185070.weights' '-q' '0' '-e' '0.001'
[2022-05-19 17:35:31] [INFO ] Decomposing Gal with order
[2022-05-19 17:35:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 17:35:31] [INFO ] Removed a total of 109 redundant transitions.
[2022-05-19 17:35:31] [INFO ] Flatten gal took : 75 ms
[2022-05-19 17:35:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 16 ms.
[2022-05-19 17:35:31] [INFO ] Time to serialize gal into /tmp/LTL12650391451802360326.gal : 8 ms
[2022-05-19 17:35:31] [INFO ] Time to serialize properties into /tmp/LTL9117531601215222236.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/LTL12650391451802360326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9117531601215222236.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1265039...246
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((i6.i0.u52.s4_10>=1)||(i13.i1.u51.s4_9>=1))||((i2.i0.u50.s4_8>=1)||(i11.i1.u49.s4_7>=1)))||(((i5.u48.s4_6>=1)||(i9.i...1115
Formula 0 simplified : !G(G!(!"(((((i6.i0.u52.s4_10>=1)||(i13.i1.u51.s4_9>=1))||((i2.i0.u50.s4_8>=1)||(i11.i1.u49.s4_7>=1)))||(((i5.u48.s4_6>=1)||(i9.i1.u4...1086
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4077947255711970249
[2022-05-19 17:35:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4077947255711970249
Running compilation step : cd /tmp/ltsmin4077947255711970249;'/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 396 ms.
Running link step : cd /tmp/ltsmin4077947255711970249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4077947255711970249;'/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' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-06 finished in 89319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U X(p0)))'
Support contains 12 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:36:01] [INFO ] Computed 350 place invariants in 8 ms
[2022-05-19 17:36:01] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:36:01] [INFO ] Computed 350 place invariants in 5 ms
[2022-05-19 17:36:02] [INFO ] Implicit Places using invariants and state equation in 474 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 815 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s478 1)) (AND (GEQ s0 1) (GEQ s479 1)) (AND (GEQ s0 1) (GEQ s480 1)) (AND (GEQ s0 1) (GEQ s481 1)) (AND (GEQ s0 1) (GEQ s474 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-10 finished in 927 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U G(X(X(F((F(p1)&&G(!p2)))))))||!p0)))'
Support contains 25 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:36:02] [INFO ] Computed 350 place invariants in 16 ms
[2022-05-19 17:36:02] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:36:02] [INFO ] Computed 350 place invariants in 4 ms
[2022-05-19 17:36:03] [INFO ] Implicit Places using invariants and state equation in 479 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 795 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(GEQ s512 1), p1:(OR (AND (GEQ s0 1) (GEQ s494 1)) (AND (GEQ s0 1) (GEQ s495 1)) (AND (GEQ s0 1) (GEQ s490 1)) (AND (GEQ s0 1) (GEQ s491 1)) (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7522 reset in 231 ms.
Product exploration explored 100000 steps with 7490 reset in 231 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 8 factoid took 205 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-11 finished in 1722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))||F(p1)))'
Support contains 25 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:36:04] [INFO ] Computed 350 place invariants in 7 ms
[2022-05-19 17:36:04] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:36:04] [INFO ] Computed 350 place invariants in 6 ms
[2022-05-19 17:36:05] [INFO ] Implicit Places using invariants and state equation in 469 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 776 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GEQ s509 1), p0:(AND (OR (AND (GEQ s0 1) (GEQ s494 1)) (AND (GEQ s0 1) (GEQ s495 1)) (AND (GEQ s0 1) (GEQ s490 1)) (AND (GEQ s0 1) (GEQ s491 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-12 finished in 1009 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 512 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 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 509 transition count 171
Applied a total of 5 rules in 28 ms. Remains 509 /524 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 509 cols
[2022-05-19 17:36:05] [INFO ] Computed 340 place invariants in 7 ms
[2022-05-19 17:36:05] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 171 rows 509 cols
[2022-05-19 17:36:05] [INFO ] Computed 340 place invariants in 4 ms
[2022-05-19 17:36:06] [INFO ] Implicit Places using invariants and state equation in 464 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 763 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/524 places, 171/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 487/524 places, 171/176 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s472 1)) (AND (GEQ s0 1) (GEQ s473 1)) (AND (GEQ s0 1) (GEQ s468 1)) (AND (GEQ s0 1) (GEQ s469 1)) (AND (GEQ s0 1) (GEQ s470 1...], 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 15 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-13 finished in 852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 157 out of 524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 512 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 511 transition count 173
Applied a total of 2 rules in 23 ms. Remains 511 /524 variables (removed 13) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 511 cols
[2022-05-19 17:36:06] [INFO ] Computed 340 place invariants in 14 ms
[2022-05-19 17:36:06] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 173 rows 511 cols
[2022-05-19 17:36:06] [INFO ] Computed 340 place invariants in 7 ms
[2022-05-19 17:36:06] [INFO ] Implicit Places using invariants and state equation in 415 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 676 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/524 places, 173/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/524 places, 173/176 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s485 1)) (AND (GEQ s0 1) (GEQ s486 1)) (AND (GEQ s0 1) (GEQ s495 1)) (AND (GEQ s0 1) (GEQ s491 1)) (AND (GEQ s0 1) (GEQ s492 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-14 finished in 758 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!X(G(p0)) U p1)))'
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:36:06] [INFO ] Computed 350 place invariants in 9 ms
[2022-05-19 17:36:07] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:36:07] [INFO ] Computed 350 place invariants in 5 ms
[2022-05-19 17:36:07] [INFO ] Implicit Places using invariants and state equation in 537 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 851 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/524 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/524 places, 176/176 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, p1, p1, (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s509 1), p0:(GEQ s511 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6927 reset in 151 ms.
Product exploration explored 100000 steps with 6928 reset in 152 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 297 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:36:08] [INFO ] Computed 340 place invariants in 17 ms
[2022-05-19 17:36:09] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 40 ms returned sat
[2022-05-19 17:36:09] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2022-05-19 17:36:09] [INFO ] After 114ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-19 17:36:09] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:1
[2022-05-19 17:36:09] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 44 ms returned sat
[2022-05-19 17:36:09] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-19 17:36:09] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-19 17:36:09] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 358 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 67 ms :[true, p1, p1]
Support contains 1 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:36:10] [INFO ] Computed 340 place invariants in 12 ms
[2022-05-19 17:36:10] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:36:10] [INFO ] Computed 340 place invariants in 14 ms
[2022-05-19 17:36:10] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:36:10] [INFO ] Computed 340 place invariants in 18 ms
[2022-05-19 17:36:11] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 694 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 248 steps, run visited all 1 properties in 9 ms. (steps per millisecond=27 )
Probabilistic random walk after 248 steps, saw 237 distinct states, run finished after 10 ms. (steps per millisecond=24 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 79 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 70 ms :[true, p1, p1]
Product exploration explored 100000 steps with 6924 reset in 140 ms.
Product exploration explored 100000 steps with 6930 reset in 147 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 85 ms :[true, p1, p1]
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 71 are kept as prefixes of interest. Removing 442 places using SCC suffix rule.1 ms
Discarding 442 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 71 transition count 52
Applied a total of 55 rules in 7 ms. Remains 71 /513 variables (removed 442) and now considering 52/176 (removed 124) transitions.
[2022-05-19 17:36:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 71 cols
[2022-05-19 17:36:12] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-19 17:36:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/513 places, 52/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 71/513 places, 52/176 transitions.
Product exploration explored 100000 steps with 6718 reset in 196 ms.
Product exploration explored 100000 steps with 6717 reset in 210 ms.
Built C files in :
/tmp/ltsmin14016939845950613841
[2022-05-19 17:36:12] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14016939845950613841
Running compilation step : cd /tmp/ltsmin14016939845950613841;'/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 394 ms.
Running link step : cd /tmp/ltsmin14016939845950613841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14016939845950613841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7036835807731566965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:36:27] [INFO ] Computed 340 place invariants in 15 ms
[2022-05-19 17:36:28] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:36:28] [INFO ] Computed 340 place invariants in 16 ms
[2022-05-19 17:36:28] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 17:36:28] [INFO ] Computed 340 place invariants in 10 ms
[2022-05-19 17:36:28] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin6417480868171063439
[2022-05-19 17:36:28] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6417480868171063439
Running compilation step : cd /tmp/ltsmin6417480868171063439;'/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 396 ms.
Running link step : cd /tmp/ltsmin6417480868171063439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6417480868171063439;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17338067315120825792.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 17:36:44] [INFO ] Flatten gal took : 19 ms
[2022-05-19 17:36:44] [INFO ] Flatten gal took : 19 ms
[2022-05-19 17:36:44] [INFO ] Time to serialize gal into /tmp/LTL17312183712783635032.gal : 2 ms
[2022-05-19 17:36:44] [INFO ] Time to serialize properties into /tmp/LTL3138751243103010869.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/LTL17312183712783635032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3138751243103010869.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/LTL1731218...267
Read 1 LTL properties
Checking formula 0 : !((X(!((!(X(G("(a1_0>=1)"))))U("(a3_0>=1)")))))
Formula 0 simplified : !X!(!XG"(a1_0>=1)" U "(a3_0>=1)")
Detected timeout of ITS tools.
[2022-05-19 17:36:59] [INFO ] Flatten gal took : 21 ms
[2022-05-19 17:36:59] [INFO ] Applying decomposition
[2022-05-19 17:36:59] [INFO ] Flatten gal took : 15 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/graph13445889441386108725.txt' '-o' '/tmp/graph13445889441386108725.bin' '-w' '/tmp/graph13445889441386108725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13445889441386108725.bin' '-l' '-1' '-v' '-w' '/tmp/graph13445889441386108725.weights' '-q' '0' '-e' '0.001'
[2022-05-19 17:36:59] [INFO ] Decomposing Gal with order
[2022-05-19 17:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 17:36:59] [INFO ] Removed a total of 109 redundant transitions.
[2022-05-19 17:36:59] [INFO ] Flatten gal took : 43 ms
[2022-05-19 17:36:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 12 ms.
[2022-05-19 17:36:59] [INFO ] Time to serialize gal into /tmp/LTL5151373177103616146.gal : 5 ms
[2022-05-19 17:36:59] [INFO ] Time to serialize properties into /tmp/LTL18323517805330132476.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/LTL5151373177103616146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18323517805330132476.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5151373...246
Read 1 LTL properties
Checking formula 0 : !((X(!((!(X(G("(i12.u68.a1_0>=1)"))))U("(i12.u67.a3_0>=1)")))))
Formula 0 simplified : !X!(!XG"(i12.u68.a1_0>=1)" U "(i12.u67.a3_0>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6704140744292729425
[2022-05-19 17:37:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6704140744292729425
Running compilation step : cd /tmp/ltsmin6704140744292729425;'/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 397 ms.
Running link step : cd /tmp/ltsmin6704140744292729425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6704140744292729425;'/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))) U (LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-15 finished in 82564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!(!p0 U (X(p0)&&p1)))||G(X(X(p2))))))'
Found a SL insensitive property : QuasiCertifProtocol-COL-10-LTLFireability-06
Stuttering acceptance computed with spot in 332 ms :[true, (AND p0 (NOT p2)), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND (NOT p2) p0 p1), (AND p1 p0), (NOT p2)]
Support contains 35 out of 524 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 512 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 511 transition count 173
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 511 transition count 173
Applied a total of 4 rules in 34 ms. Remains 511 /524 variables (removed 13) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 511 cols
[2022-05-19 17:37:29] [INFO ] Computed 340 place invariants in 8 ms
[2022-05-19 17:37:30] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 173 rows 511 cols
[2022-05-19 17:37:30] [INFO ] Computed 340 place invariants in 4 ms
[2022-05-19 17:37:30] [INFO ] Implicit Places using invariants and state equation in 510 ms returned [430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 812 ms to find 11 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 500/524 places, 173/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/524 places, 173/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND p0 p2), acceptance={} source=1 dest: 8}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=3, aps=[p0:(OR (GEQ s473 1) (GEQ s472 1) (GEQ s471 1) (GEQ s470 1) (GEQ s469 1) (GEQ s468 1) (GEQ s467 1) (GEQ s466 1) (GEQ s465 1) (GEQ s464 1) (GEQ s463 1)), p2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6919 reset in 166 ms.
Product exploration explored 100000 steps with 6920 reset in 177 ms.
Computed a total of 500 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 173
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) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 970 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 8 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p2), p0, (AND p0 (NOT p2)), (AND p1 p0), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 690 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:32] [INFO ] Computed 330 place invariants in 11 ms
[2022-05-19 17:37:32] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 44 ms returned sat
[2022-05-19 17:37:32] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 17:37:33] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 43 ms returned sat
[2022-05-19 17:37:33] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2022-05-19 17:37:33] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-05-19 17:37:33] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 7 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 7 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND (NOT p2) p1 (NOT p0)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND p2 p1 (NOT p0))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F (AND p2 p0)), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p0), (F p1)]
Knowledge based reduction with 22 factoid took 1423 ms. Reduced automaton from 8 states, 20 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Support contains 35 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 173/173 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:35] [INFO ] Computed 330 place invariants in 20 ms
[2022-05-19 17:37:36] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:36] [INFO ] Computed 330 place invariants in 12 ms
[2022-05-19 17:37:36] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:36] [INFO ] Computed 330 place invariants in 20 ms
[2022-05-19 17:37:36] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 173/173 transitions.
Computed a total of 500 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 173
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 459 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:37] [INFO ] Computed 330 place invariants in 11 ms
[2022-05-19 17:37:37] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 49 ms returned sat
[2022-05-19 17:37:37] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 17:37:38] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 43 ms returned sat
[2022-05-19 17:37:38] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 17:37:38] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-19 17:37:38] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 27 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 4 properties in 1 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 482 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Product exploration explored 100000 steps with 6930 reset in 154 ms.
Product exploration explored 100000 steps with 6929 reset in 173 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Support contains 35 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 173/173 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2022-05-19 17:37:40] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:40] [INFO ] Computed 330 place invariants in 14 ms
[2022-05-19 17:37:40] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 173/173 transitions.
Product exploration explored 100000 steps with 6924 reset in 147 ms.
Product exploration explored 100000 steps with 6922 reset in 163 ms.
Built C files in :
/tmp/ltsmin8470034437308944494
[2022-05-19 17:37:41] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8470034437308944494
Running compilation step : cd /tmp/ltsmin8470034437308944494;'/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 423 ms.
Running link step : cd /tmp/ltsmin8470034437308944494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8470034437308944494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1544081004113255876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 173/173 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:56] [INFO ] Computed 330 place invariants in 13 ms
[2022-05-19 17:37:56] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:56] [INFO ] Computed 330 place invariants in 11 ms
[2022-05-19 17:37:57] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 17:37:57] [INFO ] Computed 330 place invariants in 12 ms
[2022-05-19 17:37:57] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 173/173 transitions.
Built C files in :
/tmp/ltsmin1357533165367013632
[2022-05-19 17:37:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1357533165367013632
Running compilation step : cd /tmp/ltsmin1357533165367013632;'/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 389 ms.
Running link step : cd /tmp/ltsmin1357533165367013632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1357533165367013632;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased461441733815541464.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 17:38:12] [INFO ] Flatten gal took : 15 ms
[2022-05-19 17:38:12] [INFO ] Flatten gal took : 13 ms
[2022-05-19 17:38:12] [INFO ] Time to serialize gal into /tmp/LTL17712876384971442147.gal : 2 ms
[2022-05-19 17:38:12] [INFO ] Time to serialize properties into /tmp/LTL4598418284578236502.ltl : 0 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/LTL17712876384971442147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4598418284578236502.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/LTL1771287...267
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((s4_10>=1)||(s4_9>=1))||((s4_8>=1)||(s4_7>=1)))||(((s4_6>=1)||(s4_5>=1))||((s4_4>=1)||(s4_3>=1))))||(((s4_2>=1)||(s4...661
Formula 0 simplified : !G(G!(!"(((((s4_10>=1)||(s4_9>=1))||((s4_8>=1)||(s4_7>=1)))||(((s4_6>=1)||(s4_5>=1))||((s4_4>=1)||(s4_3>=1))))||(((s4_2>=1)||(s4_1>=...632
Detected timeout of ITS tools.
[2022-05-19 17:38:27] [INFO ] Flatten gal took : 18 ms
[2022-05-19 17:38:27] [INFO ] Applying decomposition
[2022-05-19 17:38:27] [INFO ] Flatten gal took : 13 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/graph12916292713683275584.txt' '-o' '/tmp/graph12916292713683275584.bin' '-w' '/tmp/graph12916292713683275584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12916292713683275584.bin' '-l' '-1' '-v' '-w' '/tmp/graph12916292713683275584.weights' '-q' '0' '-e' '0.001'
[2022-05-19 17:38:27] [INFO ] Decomposing Gal with order
[2022-05-19 17:38:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 17:38:27] [INFO ] Removed a total of 122 redundant transitions.
[2022-05-19 17:38:27] [INFO ] Flatten gal took : 32 ms
[2022-05-19 17:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 10 ms.
[2022-05-19 17:38:27] [INFO ] Time to serialize gal into /tmp/LTL5357019239456019795.gal : 4 ms
[2022-05-19 17:38:27] [INFO ] Time to serialize properties into /tmp/LTL14547070051251456157.ltl : 0 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/LTL5357019239456019795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14547070051251456157.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5357019...246
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((i8.u44.s4_10>=1)||(i11.u43.s4_9>=1))||((i5.u42.s4_8>=1)||(i4.u3.s4_7>=1)))||(((i3.u2.s4_6>=1)||(i2.u41.s4_5>=1))||(...981
Formula 0 simplified : !G(G!(!"(((((i8.u44.s4_10>=1)||(i11.u43.s4_9>=1))||((i5.u42.s4_8>=1)||(i4.u3.s4_7>=1)))||(((i3.u2.s4_6>=1)||(i2.u41.s4_5>=1))||((i7....952
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18239988316790732660
[2022-05-19 17:38:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18239988316790732660
Running compilation step : cd /tmp/ltsmin18239988316790732660;'/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 397 ms.
Running link step : cd /tmp/ltsmin18239988316790732660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18239988316790732660;'/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' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-06 finished in 88250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!X(G(p0)) U p1)))'
[2022-05-19 17:38:57] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7076829241167316303
[2022-05-19 17:38:57] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2022-05-19 17:38:57] [INFO ] Applying decomposition
[2022-05-19 17:38:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:38:57] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2022-05-19 17:38:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:38:57] [INFO ] Flatten gal took : 19 ms
[2022-05-19 17:38:57] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2022-05-19 17:38:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:38:57] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7076829241167316303
Running compilation step : cd /tmp/ltsmin7076829241167316303;'/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'
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/graph6717408979138623318.txt' '-o' '/tmp/graph6717408979138623318.bin' '-w' '/tmp/graph6717408979138623318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6717408979138623318.bin' '-l' '-1' '-v' '-w' '/tmp/graph6717408979138623318.weights' '-q' '0' '-e' '0.001'
[2022-05-19 17:38:57] [INFO ] Decomposing Gal with order
[2022-05-19 17:38:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 17:38:57] [INFO ] Removed a total of 108 redundant transitions.
[2022-05-19 17:38:57] [INFO ] Flatten gal took : 30 ms
[2022-05-19 17:38:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 7 ms.
[2022-05-19 17:38:57] [INFO ] Time to serialize gal into /tmp/LTLFireability16448438043865221178.gal : 4 ms
[2022-05-19 17:38:57] [INFO ] Time to serialize properties into /tmp/LTLFireability17351147885765389713.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/LTLFireability16448438043865221178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17351147885765389713.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((G((G(!((!("(((((i13.i1.u64.s4_10>=1)||(i8.i0.u55.s4_9>=1))||((i4.i0.u63.s4_8>=1)||(i20.i1.u62.s4_7>=1)))||(((i5.i0.u61.s4_6>=1)||(i...1127
Formula 0 simplified : !G(G!(!"(((((i13.i1.u64.s4_10>=1)||(i8.i0.u55.s4_9>=1))||((i4.i0.u63.s4_8>=1)||(i20.i1.u62.s4_7>=1)))||(((i5.i0.u61.s4_6>=1)||(i3.i0...1098
Compilation finished in 461 ms.
Running link step : cd /tmp/ltsmin7076829241167316303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7076829241167316303;'/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' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: LTL layer: formula: [](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: "[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.078: DFS-FIFO for weak LTL, using special progress label 182
pins2lts-mc-linux64( 0/ 8), 0.078: There are 183 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.078: State length is 525, there are 201 groups
pins2lts-mc-linux64( 0/ 8), 0.078: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.078: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.078: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.078: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.178: ~1 levels ~960 states ~12264 transitions
pins2lts-mc-linux64( 6/ 8), 0.236: ~1 levels ~1920 states ~29200 transitions
pins2lts-mc-linux64( 6/ 8), 0.339: ~1 levels ~3840 states ~63712 transitions
pins2lts-mc-linux64( 6/ 8), 0.502: ~1 levels ~7680 states ~126000 transitions
pins2lts-mc-linux64( 6/ 8), 0.734: ~1 levels ~15360 states ~232176 transitions
pins2lts-mc-linux64( 6/ 8), 1.166: ~1 levels ~30720 states ~503960 transitions
pins2lts-mc-linux64( 7/ 8), 1.874: ~1 levels ~61440 states ~825192 transitions
pins2lts-mc-linux64( 7/ 8), 2.894: ~1 levels ~122880 states ~1543304 transitions
pins2lts-mc-linux64( 7/ 8), 4.588: ~1 levels ~245760 states ~2879208 transitions
pins2lts-mc-linux64( 7/ 8), 7.231: ~1 levels ~491520 states ~5246152 transitions
pins2lts-mc-linux64( 7/ 8), 11.842: ~1 levels ~983040 states ~9188640 transitions
pins2lts-mc-linux64( 7/ 8), 19.844: ~1 levels ~1966080 states ~15437592 transitions
pins2lts-mc-linux64( 7/ 8), 33.353: ~1 levels ~3932160 states ~24770448 transitions
pins2lts-mc-linux64( 7/ 8), 66.871: ~1 levels ~7864320 states ~52649912 transitions
pins2lts-mc-linux64( 7/ 8), 141.868: ~1 levels ~15728640 states ~116904280 transitions
pins2lts-mc-linux64( 7/ 8), 298.763: ~1 levels ~31457280 states ~248940720 transitions
pins2lts-mc-linux64( 0/ 8), 510.695: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 510.793:
pins2lts-mc-linux64( 0/ 8), 510.793: mean standard work distribution: 16.5% (states) 7.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 510.793:
pins2lts-mc-linux64( 0/ 8), 510.793: Explored 45948732 states 427757501 transitions, fanout: 9.309
pins2lts-mc-linux64( 0/ 8), 510.793: Total exploration time 510.700 sec (510.600 sec minimum, 510.640 sec on average)
pins2lts-mc-linux64( 0/ 8), 510.793: States per second: 89972, Transitions per second: 837591
pins2lts-mc-linux64( 0/ 8), 510.793:
pins2lts-mc-linux64( 0/ 8), 510.793: Progress states detected: 64763621
pins2lts-mc-linux64( 0/ 8), 510.793: Redundant explorations: -29.0518
pins2lts-mc-linux64( 0/ 8), 510.793:
pins2lts-mc-linux64( 0/ 8), 510.793: Queue width: 8B, total height: 35471375, memory: 270.63MB
pins2lts-mc-linux64( 0/ 8), 510.793: Tree memory: 750.1MB, 12.1 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 510.793: Tree fill ratio (roots/leafs): 48.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 510.793: Stored 178 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 510.793: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 510.793: Est. total memory use: 1020.7MB (~1294.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7076829241167316303;'/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' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7076829241167316303;'/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' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==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 18:00:32] [INFO ] Applying decomposition
[2022-05-19 18:00:32] [INFO ] Flatten gal took : 178 ms
[2022-05-19 18:00:32] [INFO ] Decomposing Gal with order
[2022-05-19 18:00:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:00:32] [INFO ] Removed a total of 98 redundant transitions.
[2022-05-19 18:00:32] [INFO ] Flatten gal took : 173 ms
[2022-05-19 18:00:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 35 ms.
[2022-05-19 18:00:33] [INFO ] Time to serialize gal into /tmp/LTLFireability12027420724647430638.gal : 23 ms
[2022-05-19 18:00:33] [INFO ] Time to serialize properties into /tmp/LTLFireability8259670368546882678.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/LTLFireability12027420724647430638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8259670368546882678.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G((G(!((!("(((((tsid10.s4_10>=1)||(tsid9.s4_9>=1))||((tsid8.s4_8>=1)||(tsid7.s4_7>=1)))||(((tsid6.s4_6>=1)||(tsid5.s4_5>=1))||((tsi...935
Formula 0 simplified : !G(G!(!"(((((tsid10.s4_10>=1)||(tsid9.s4_9>=1))||((tsid8.s4_8>=1)||(tsid7.s4_7>=1)))||(((tsid6.s4_6>=1)||(tsid5.s4_5>=1))||((tsid4.s...906
Detected timeout of ITS tools.
[2022-05-19 18:22:10] [INFO ] Flatten gal took : 1686 ms
[2022-05-19 18:22:11] [INFO ] Input system was already deterministic with 176 transitions.
[2022-05-19 18:22:11] [INFO ] Transformed 524 places.
[2022-05-19 18:22:11] [INFO ] Transformed 176 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 18:22:11] [INFO ] Time to serialize gal into /tmp/LTLFireability18287987189857783569.gal : 11 ms
[2022-05-19 18:22:11] [INFO ] Time to serialize properties into /tmp/LTLFireability14227045770371156025.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/LTLFireability18287987189857783569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14227045770371156025.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((G(!((!("(((((s4_10>=1)||(s4_9>=1))||((s4_8>=1)||(s4_7>=1)))||(((s4_6>=1)||(s4_5>=1))||((s4_4>=1)||(s4_3>=1))))||(((s4_2>=1)||(s4...661
Formula 0 simplified : !G(G!(!"(((((s4_10>=1)||(s4_9>=1))||((s4_8>=1)||(s4_7>=1)))||(((s4_6>=1)||(s4_5>=1))||((s4_4>=1)||(s4_3>=1))))||(((s4_2>=1)||(s4_1>=...632

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017400916"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;