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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 7.4K Apr 30 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 93K 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-18-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652983975848

Running Version 202205111006
[2022-05-19 18:12:56] [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 18:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 18:12:57] [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 18:12:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 18:12:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2022-05-19 18:12:57] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 20 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 18:12:57] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2022-05-19 18:12:57] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 9 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 10000 steps, including 370 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 18:12:58] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-19 18:12:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-19 18:12:58] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :2 sat :4 real:2
[2022-05-19 18:12:58] [INFO ] After 61ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :4 real:2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-19 18:12:58] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :4 real:2
[2022-05-19 18:12:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 18:12:58] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2022-05-19 18:12:59] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-19 18:12:59] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Finished Parikh walk after 111 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=37 )
Parikh walk visited 5 properties in 3 ms.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 18:12:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 18:12:59] [INFO ] Flatten gal took : 20 ms
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 18:12:59] [INFO ] Flatten gal took : 7 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2022-05-19 18:12:59] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 24 ms.
[2022-05-19 18:12:59] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 899 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 58 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:12:59] [INFO ] Computed 1062 place invariants in 93 ms
[2022-05-19 18:13:00] [INFO ] Implicit Places using invariants in 783 ms returned []
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:13:00] [INFO ] Computed 1062 place invariants in 57 ms
[2022-05-19 18:13:01] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:13:01] [INFO ] Computed 1062 place invariants in 16 ms
[2022-05-19 18:13:01] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1356/1398 places, 296/296 transitions.
Finished structural reductions, in 1 iterations. Remains : 1356/1398 places, 296/296 transitions.
Support contains 899 out of 1356 places after structural reductions.
[2022-05-19 18:13:01] [INFO ] Flatten gal took : 96 ms
[2022-05-19 18:13:01] [INFO ] Flatten gal took : 90 ms
[2022-05-19 18:13:02] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:13:02] [INFO ] Computed 1062 place invariants in 20 ms
[2022-05-19 18:13:03] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 159 ms returned sat
[2022-05-19 18:13:03] [INFO ] After 947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 18:13:04] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 194 ms returned sat
[2022-05-19 18:13:06] [INFO ] After 1624ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2022-05-19 18:13:08] [INFO ] After 3897ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 1290 ms.
[2022-05-19 18:13:10] [INFO ] After 6477ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 13 different solutions.
Finished Parikh walk after 138 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=34 )
Parikh walk visited 14 properties in 7 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(p1)))'
Support contains 400 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 63 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:13:10] [INFO ] Computed 1062 place invariants in 15 ms
[2022-05-19 18:13:11] [INFO ] Implicit Places using invariants in 1022 ms returned []
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:13:11] [INFO ] Computed 1062 place invariants in 22 ms
[2022-05-19 18:13:13] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2686 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 210 ms :[p1, p1, true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1084 1) (GEQ s1085 1) (GEQ s1086 1) (GEQ s1087 1) (GEQ s1088 1) (GEQ s1089 1) (GEQ s1090 1) (GEQ s1091 1) (GEQ s1092 1) (GEQ s1093 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1203 ms.
Product exploration explored 100000 steps with 50000 reset in 1223 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 8 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-00 finished in 5832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U p1))'
Support contains 21 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 178 are kept as prefixes of interest. Removing 1178 places using SCC suffix rule.13 ms
Discarding 1178 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 178 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 177 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 177 transition count 125
Applied a total of 79 rules in 53 ms. Remains 177 /1356 variables (removed 1179) and now considering 125/296 (removed 171) transitions.
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:16] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:16] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:16] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-19 18:13:16] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2022-05-19 18:13:16] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:16] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:16] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1356 places, 125/296 transitions.
Finished structural reductions, in 1 iterations. Remains : 177/1356 places, 125/296 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), true, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s175 1), p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4514 reset in 248 ms.
Product exploration explored 100000 steps with 4504 reset in 293 ms.
Computed a total of 177 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 transition count 125
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 (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 379 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 390 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:18] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:18] [INFO ] [Real]Absence check using 0 positive and 54 generalized place invariants in 10 ms returned sat
[2022-05-19 18:13:18] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-19 18:13:18] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-19 18:13:18] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 386 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), true, p0]
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:18] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:18] [INFO ] [Real]Absence check using 0 positive and 54 generalized place invariants in 7 ms returned sat
[2022-05-19 18:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 18:13:18] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-19 18:13:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 18:13:18] [INFO ] [Nat]Absence check using 0 positive and 54 generalized place invariants in 10 ms returned sat
[2022-05-19 18:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 18:13:19] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-19 18:13:19] [INFO ] Computed and/alt/rep : 99/137/99 causal constraints (skipped 5 transitions) in 9 ms.
[2022-05-19 18:13:19] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 21 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 177 /177 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:19] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:19] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:19] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-19 18:13:19] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2022-05-19 18:13:19] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:19] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-19 18:13:19] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 177/177 places, 125/125 transitions.
Computed a total of 177 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 transition count 125
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 (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 475 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 391 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:20] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:20] [INFO ] [Real]Absence check using 0 positive and 54 generalized place invariants in 21 ms returned sat
[2022-05-19 18:13:20] [INFO ] After 98ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-19 18:13:20] [INFO ] After 122ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-19 18:13:20] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 390 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), true, p0]
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:20] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:21] [INFO ] [Real]Absence check using 0 positive and 54 generalized place invariants in 7 ms returned sat
[2022-05-19 18:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 18:13:21] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-19 18:13:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 18:13:21] [INFO ] [Nat]Absence check using 0 positive and 54 generalized place invariants in 7 ms returned sat
[2022-05-19 18:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 18:13:21] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-19 18:13:21] [INFO ] Computed and/alt/rep : 99/137/99 causal constraints (skipped 5 transitions) in 11 ms.
[2022-05-19 18:13:21] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), true, p0]
Product exploration explored 100000 steps with 4515 reset in 202 ms.
Product exploration explored 100000 steps with 4515 reset in 215 ms.
Built C files in :
/tmp/ltsmin1844205685122605410
[2022-05-19 18:13:21] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-19 18:13:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:13:21] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-19 18:13:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:13:21] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-19 18:13:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:13:21] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1844205685122605410
Running compilation step : cd /tmp/ltsmin1844205685122605410;'/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/ltsmin1844205685122605410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1844205685122605410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18214281004031804905.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 21 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 177 /177 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:36] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:37] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:37] [INFO ] Computed 54 place invariants in 3 ms
[2022-05-19 18:13:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2022-05-19 18:13:37] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 18:13:37] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:13:37] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 177/177 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin4548183106423750181
[2022-05-19 18:13:37] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-19 18:13:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:13:37] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-19 18:13:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:13:37] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-19 18:13:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:13:37] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4548183106423750181
Running compilation step : cd /tmp/ltsmin4548183106423750181;'/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 277 ms.
Running link step : cd /tmp/ltsmin4548183106423750181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4548183106423750181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5349808965935915180.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:13:52] [INFO ] Flatten gal took : 9 ms
[2022-05-19 18:13:52] [INFO ] Flatten gal took : 9 ms
[2022-05-19 18:13:52] [INFO ] Time to serialize gal into /tmp/LTL12819338430930948835.gal : 2 ms
[2022-05-19 18:13:52] [INFO ] Time to serialize properties into /tmp/LTL6987004467663026686.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/LTL12819338430930948835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6987004467663026686.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/LTL1281933...267
Read 1 LTL properties
Checking formula 0 : !(((!(F("((((((n6_0>=1)&&(n6_1>=1))&&((n6_2>=1)&&(n6_3>=1)))&&(((n6_4>=1)&&(n6_5>=1))&&((n6_6>=1)&&(n6_7>=1))))&&((((n6_8>=1)&&(n6_9>=...315
Formula 0 simplified : !(!F"((((((n6_0>=1)&&(n6_1>=1))&&((n6_2>=1)&&(n6_3>=1)))&&(((n6_4>=1)&&(n6_5>=1))&&((n6_6>=1)&&(n6_7>=1))))&&((((n6_8>=1)&&(n6_9>=1)...309
Detected timeout of ITS tools.
[2022-05-19 18:14:07] [INFO ] Flatten gal took : 9 ms
[2022-05-19 18:14:07] [INFO ] Applying decomposition
[2022-05-19 18:14:07] [INFO ] Flatten gal took : 8 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/graph15134060253688097420.txt' '-o' '/tmp/graph15134060253688097420.bin' '-w' '/tmp/graph15134060253688097420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15134060253688097420.bin' '-l' '-1' '-v' '-w' '/tmp/graph15134060253688097420.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:14:07] [INFO ] Decomposing Gal with order
[2022-05-19 18:14:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:14:07] [INFO ] Removed a total of 114 redundant transitions.
[2022-05-19 18:14:07] [INFO ] Flatten gal took : 38 ms
[2022-05-19 18:14:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 14 ms.
[2022-05-19 18:14:07] [INFO ] Time to serialize gal into /tmp/LTL8259326919497422317.gal : 4 ms
[2022-05-19 18:14:07] [INFO ] Time to serialize properties into /tmp/LTL15952008600519494081.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/LTL8259326919497422317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15952008600519494081.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/LTL8259326...246
Read 1 LTL properties
Checking formula 0 : !(((!(F("((((((i9.u1.n6_0>=1)&&(i1.i0.u11.n6_1>=1))&&((i14.u2.n6_2>=1)&&(i4.u3.n6_3>=1)))&&(((i5.u12.n6_4>=1)&&(i2.u13.n6_5>=1))&&((i1...472
Formula 0 simplified : !(!F"((((((i9.u1.n6_0>=1)&&(i1.i0.u11.n6_1>=1))&&((i14.u2.n6_2>=1)&&(i4.u3.n6_3>=1)))&&(((i5.u12.n6_4>=1)&&(i2.u13.n6_5>=1))&&((i10....466
Reverse transition relation is NOT exact ! Due to transitions t78, t79, t91, t92, t94, t95, t96, t99, t100, t103, t104, t105, t120, t121, t125, t126, t127,...350
Computing Next relation with stutter on 3.40804e+08 deadlock states
15 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 items max in DFS search stack
322 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.24632,172616,1,0,503403,265,2159,339794,167,1043,539181
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-05 finished in 55727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(X(p0))))))'
Support contains 380 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.17 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1333 transition count 291
Applied a total of 5 rules in 92 ms. Remains 1333 /1356 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2022-05-19 18:14:12] [INFO ] Computed 1044 place invariants in 16 ms
[2022-05-19 18:14:13] [INFO ] Implicit Places using invariants in 1008 ms returned []
// Phase 1: matrix 291 rows 1333 cols
[2022-05-19 18:14:13] [INFO ] Computed 1044 place invariants in 22 ms
[2022-05-19 18:14:14] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 2697 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1356 places, 291/296 transitions.
Applied a total of 0 rules in 48 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1295/1356 places, 291/296 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-07 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 s4 1) (GEQ s23 1) (GEQ s42 1) (GEQ s61 1) (GEQ s80 1) (GEQ s99 1) (GEQ s118 1) (GEQ s137 1) (GEQ s156 1) (GEQ s175 1) (GEQ s194 1) (GEQ s...], 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 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-07 finished in 2922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(X(p1))&&(p2 U X(p3))))))'
Support contains 60 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:14:15] [INFO ] Computed 1062 place invariants in 22 ms
[2022-05-19 18:14:16] [INFO ] Implicit Places using invariants in 1240 ms returned []
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:14:16] [INFO ] Computed 1062 place invariants in 28 ms
[2022-05-19 18:14:18] [INFO ] Implicit Places using invariants and state equation in 2281 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3523 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p3), (NOT p1), (NOT p3), (NOT p1), (NOT p3), (NOT p3), true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p2 p0), acceptance={} source=1 dest: 7}], [{ cond=(NOT p3), acceptance={} source=2 dest: 8}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={0} source=4 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(GEQ s1332 1), p0:(AND (OR (AND (GEQ s0 1) (GEQ s1298 1)) (AND (GEQ s0 1) (GEQ s1299 1)) (AND (GEQ s0 1) (GEQ s1300 1)) (AND (GEQ s0 1) (GEQ s1301 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-08 finished in 3986 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X((!(false U X(p1))&&p0))))))'
Support contains 40 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.5 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1335 transition count 293
Applied a total of 3 rules in 103 ms. Remains 1335 /1356 variables (removed 21) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1335 cols
[2022-05-19 18:14:19] [INFO ] Computed 1044 place invariants in 21 ms
[2022-05-19 18:14:20] [INFO ] Implicit Places using invariants in 1269 ms returned []
// Phase 1: matrix 293 rows 1335 cols
[2022-05-19 18:14:20] [INFO ] Computed 1044 place invariants in 23 ms
[2022-05-19 18:14:22] [INFO ] Implicit Places using invariants and state equation in 2336 ms returned [1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3608 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1316/1356 places, 293/296 transitions.
Applied a total of 0 rules in 67 ms. Remains 1316 /1316 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1316/1356 places, 293/296 transitions.
Stuttering acceptance computed with spot in 39 ms :[(OR (NOT p0) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1293 1) (LT s1294 1) (LT s1299 1) (LT s1300 1) (LT s1301 1) (LT s1302 1) (LT s1295 1) (LT s1296 1) (LT s1297 1) (LT s1298 1) (LT s1307 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4416 reset in 390 ms.
Product exploration explored 100000 steps with 4418 reset in 359 ms.
Computed a total of 1316 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1316 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 608 steps, run visited all 2 properties in 13 ms. (steps per millisecond=46 )
Probabilistic random walk after 608 steps, saw 591 distinct states, run finished after 13 ms. (steps per millisecond=46 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (OR (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 28 ms :[(OR (NOT p0) p1)]
Support contains 40 out of 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 293/293 transitions.
Applied a total of 0 rules in 50 ms. Remains 1316 /1316 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 1316 cols
[2022-05-19 18:14:24] [INFO ] Computed 1026 place invariants in 77 ms
[2022-05-19 18:14:25] [INFO ] Implicit Places using invariants in 1290 ms returned []
// Phase 1: matrix 293 rows 1316 cols
[2022-05-19 18:14:26] [INFO ] Computed 1026 place invariants in 79 ms
[2022-05-19 18:14:28] [INFO ] Implicit Places using invariants and state equation in 2369 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
[2022-05-19 18:14:28] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 293 rows 1316 cols
[2022-05-19 18:14:28] [INFO ] Computed 1026 place invariants in 62 ms
[2022-05-19 18:14:28] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1316/1316 places, 293/293 transitions.
Computed a total of 1316 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1316 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 237 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 608 steps, run visited all 2 properties in 11 ms. (steps per millisecond=55 )
Probabilistic random walk after 608 steps, saw 591 distinct states, run finished after 11 ms. (steps per millisecond=55 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (OR (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 28 ms :[(OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p0) p1)]
Product exploration explored 100000 steps with 4419 reset in 349 ms.
Product exploration explored 100000 steps with 4421 reset in 352 ms.
Built C files in :
/tmp/ltsmin7740979422267485153
[2022-05-19 18:14:30] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2022-05-19 18:14:30] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:14:30] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2022-05-19 18:14:30] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:14:30] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2022-05-19 18:14:30] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:14:30] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7740979422267485153
Running compilation step : cd /tmp/ltsmin7740979422267485153;'/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 1100 ms.
Running link step : cd /tmp/ltsmin7740979422267485153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7740979422267485153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18191619204454901250.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 40 out of 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 293/293 transitions.
Applied a total of 0 rules in 56 ms. Remains 1316 /1316 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 1316 cols
[2022-05-19 18:14:45] [INFO ] Computed 1026 place invariants in 67 ms
[2022-05-19 18:14:46] [INFO ] Implicit Places using invariants in 1269 ms returned []
// Phase 1: matrix 293 rows 1316 cols
[2022-05-19 18:14:47] [INFO ] Computed 1026 place invariants in 65 ms
[2022-05-19 18:14:49] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 3429 ms to find 0 implicit places.
[2022-05-19 18:14:49] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 293 rows 1316 cols
[2022-05-19 18:14:49] [INFO ] Computed 1026 place invariants in 65 ms
[2022-05-19 18:14:49] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1316/1316 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin7117231232592289593
[2022-05-19 18:14:49] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2022-05-19 18:14:49] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:14:49] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2022-05-19 18:14:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:14:49] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2022-05-19 18:14:49] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:14:49] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7117231232592289593
Running compilation step : cd /tmp/ltsmin7117231232592289593;'/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 1073 ms.
Running link step : cd /tmp/ltsmin7117231232592289593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7117231232592289593;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12260628640826142099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:15:04] [INFO ] Flatten gal took : 44 ms
[2022-05-19 18:15:04] [INFO ] Flatten gal took : 38 ms
[2022-05-19 18:15:04] [INFO ] Time to serialize gal into /tmp/LTL5451124930518990473.gal : 6 ms
[2022-05-19 18:15:04] [INFO ] Time to serialize properties into /tmp/LTL1591127630050949492.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/LTL5451124930518990473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1591127630050949492.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/LTL5451124...266
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X((((((!(X("((a4_0>=1)||((((((n2_0>=1)&&(n2_1>=1))&&((n2_2>=1)&&(n2_3>=1)))&&(((n2_4>=1)&&(n2_5>=1))&&((n2_6>=1)&&(n2_7>=1)))...581
Formula 0 simplified : !XFGX("((((s6_3<1)&&(s6_4<1))&&((s6_5<1)&&(s6_14<1)))&&(((s6_15<1)&&(s6_16<1))&&((s6_17<1)&&(s6_10<1))))" & "(((s6_7<1)&&(s6_8<1))&&...554
Detected timeout of ITS tools.
[2022-05-19 18:15:19] [INFO ] Flatten gal took : 38 ms
[2022-05-19 18:15:19] [INFO ] Applying decomposition
[2022-05-19 18:15:20] [INFO ] Flatten gal took : 35 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/graph2448883697238587460.txt' '-o' '/tmp/graph2448883697238587460.bin' '-w' '/tmp/graph2448883697238587460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2448883697238587460.bin' '-l' '-1' '-v' '-w' '/tmp/graph2448883697238587460.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:15:20] [INFO ] Decomposing Gal with order
[2022-05-19 18:15:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:15:20] [INFO ] Removed a total of 190 redundant transitions.
[2022-05-19 18:15:20] [INFO ] Flatten gal took : 114 ms
[2022-05-19 18:15:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 52 ms.
[2022-05-19 18:15:20] [INFO ] Time to serialize gal into /tmp/LTL17266694048485212142.gal : 30 ms
[2022-05-19 18:15:20] [INFO ] Time to serialize properties into /tmp/LTL16759348618998389212.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/LTL17266694048485212142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16759348618998389212.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/LTL1726669...247
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X((((((!(X("((i1.i1.u95.a4_0>=1)||((((((i11.u32.n2_0>=1)&&(i1.i0.u21.n2_1>=1))&&((i12.u33.n2_2>=1)&&(i2.u22.n2_3>=1)))&&(((i1...823
Formula 0 simplified : !XFGX("((((u79.s6_3<1)&&(u80.s6_4<1))&&((u81.s6_5<1)&&(u90.s6_14<1)))&&(((u91.s6_15<1)&&(u92.s6_16<1))&&((u93.s6_17<1)&&(u86.s6_10<1...796
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8861608549607350734
[2022-05-19 18:15:35] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8861608549607350734
Running compilation step : cd /tmp/ltsmin8861608549607350734;'/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 839 ms.
Running link step : cd /tmp/ltsmin8861608549607350734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8861608549607350734;'/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((!(false U X((LTLAPp1==true)))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-10 finished in 91571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((p0 U X(p1)) U !(!(F(p2) U p0)&&p3))))'
Support contains 60 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:15:50] [INFO ] Computed 1062 place invariants in 22 ms
[2022-05-19 18:15:51] [INFO ] Implicit Places using invariants in 1270 ms returned []
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:15:52] [INFO ] Computed 1062 place invariants in 24 ms
[2022-05-19 18:15:54] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3462 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p3) p0), (OR (NOT p3) p0), true, p0, (OR (AND p1 (NOT p3)) (AND p0 p1)), (AND p0 p2), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p3) p0), acceptance={} source=1 dest: 2}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p3) p1) (AND p0 p1)), acceptance={} source=4 dest: 2}, { cond=(AND p3 p2 (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 2}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(GEQ s1331 1), p0:(GEQ s1336 1), p2:(OR (AND (GEQ s1114 1) (GEQ s1266 1)) (AND (GEQ s1117 1) (GEQ s1269 1)) (AND (GEQ s1119 1) (GEQ s1271 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-11 finished in 3825 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (F(p1)||p2))))'
Support contains 22 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 40 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:15:54] [INFO ] Computed 1062 place invariants in 20 ms
[2022-05-19 18:15:55] [INFO ] Implicit Places using invariants in 1284 ms returned []
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 18:15:55] [INFO ] Computed 1062 place invariants in 20 ms
[2022-05-19 18:15:58] [INFO ] Implicit Places using invariants and state equation in 2309 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3595 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1160 1) (GEQ s1161 1) (GEQ s1162 1) (GEQ s1163 1) (GEQ s1164 1) (GEQ s1165 1) (GEQ s1166 1) (GEQ s1167 1) (GEQ s1168 1) (GEQ s1169 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-13 finished in 3929 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(F(X(X(!(G(p0) U F(!p0))))))))))'
Support contains 1 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 178 are kept as prefixes of interest. Removing 1178 places using SCC suffix rule.4 ms
Discarding 1178 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 176 transition count 124
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 176 transition count 124
Applied a total of 79 rules in 16 ms. Remains 176 /1356 variables (removed 1180) and now considering 124/296 (removed 172) transitions.
// Phase 1: matrix 124 rows 176 cols
[2022-05-19 18:15:58] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 18:15:58] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 124 rows 176 cols
[2022-05-19 18:15:58] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-19 18:15:58] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 238 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/1356 places, 124/296 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 157/1356 places, 124/296 transitions.
Stuttering acceptance computed with spot in 468 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s153 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-15 finished in 738 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X((!(false U X(p1))&&p0))))))'
[2022-05-19 18:15:59] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15038367403723906315
[2022-05-19 18:15:59] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2022-05-19 18:15:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:15:59] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2022-05-19 18:15:59] [INFO ] Applying decomposition
[2022-05-19 18:15:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:15:59] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2022-05-19 18:15:59] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:15:59] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15038367403723906315
Running compilation step : cd /tmp/ltsmin15038367403723906315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 18:15:59] [INFO ] Flatten gal took : 33 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/graph8570529468985745173.txt' '-o' '/tmp/graph8570529468985745173.bin' '-w' '/tmp/graph8570529468985745173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8570529468985745173.bin' '-l' '-1' '-v' '-w' '/tmp/graph8570529468985745173.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:15:59] [INFO ] Decomposing Gal with order
[2022-05-19 18:15:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:15:59] [INFO ] Removed a total of 189 redundant transitions.
[2022-05-19 18:15:59] [INFO ] Flatten gal took : 100 ms
[2022-05-19 18:15:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 22 ms.
[2022-05-19 18:15:59] [INFO ] Time to serialize gal into /tmp/LTLFireability11668280924949734659.gal : 10 ms
[2022-05-19 18:15:59] [INFO ] Time to serialize properties into /tmp/LTLFireability15710678336916494757.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/LTLFireability11668280924949734659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15710678336916494757.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 1 LTL properties
Checking formula 0 : !((X(F(G(X((((((!(X("((i12.i1.u129.a4_0>=1)||((((((i11.i0.u79.n2_0>=1)&&(i1.u43.n2_1>=1))&&((i7.u80.n2_2>=1)&&(i13.i1.u81.n2_3>=1)))&&...957
Formula 0 simplified : !XFGX("((((i35.u113.s6_3<1)&&(i16.u114.s6_4<1))&&((i36.u115.s6_5<1)&&(i33.u124.s6_14<1)))&&(((i19.u125.s6_15<1)&&(i6.u126.s6_16<1))&...930
Compilation finished in 1063 ms.
Running link step : cd /tmp/ltsmin15038367403723906315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15038367403723906315;'/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((!(false U X((LTLAPp1==true)))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: LTL layer: formula: X(<>([](X((!(false U X((LTLAPp1==true)))&&(LTLAPp0==true))))))
pins2lts-mc-linux64( 2/ 8), 0.009: "X(<>([](X((!(false U X((LTLAPp1==true)))&&(LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: There are 299 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.086: State length is 1357, there are 302 groups
pins2lts-mc-linux64( 0/ 8), 0.086: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.086: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.086: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.086: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.166: [Blue] ~22 levels ~960 states ~4232 transitions
pins2lts-mc-linux64( 3/ 8), 0.201: [Blue] ~22 levels ~1920 states ~8360 transitions
pins2lts-mc-linux64( 3/ 8), 0.267: [Blue] ~22 levels ~3840 states ~17576 transitions
pins2lts-mc-linux64( 4/ 8), 0.410: [Blue] ~22 levels ~7680 states ~38056 transitions
pins2lts-mc-linux64( 1/ 8), 0.637: [Blue] ~22 levels ~15360 states ~76288 transitions
pins2lts-mc-linux64( 1/ 8), 1.032: [Blue] ~22 levels ~30720 states ~153608 transitions
pins2lts-mc-linux64( 7/ 8), 1.717: [Blue] ~22 levels ~61440 states ~305568 transitions
pins2lts-mc-linux64( 3/ 8), 3.069: [Blue] ~23 levels ~122880 states ~685008 transitions
pins2lts-mc-linux64( 4/ 8), 5.515: [Blue] ~23 levels ~245760 states ~1395640 transitions
pins2lts-mc-linux64( 4/ 8), 10.363: [Blue] ~23 levels ~491520 states ~2905872 transitions
pins2lts-mc-linux64( 4/ 8), 19.453: [Blue] ~23 levels ~983040 states ~5942152 transitions
pins2lts-mc-linux64( 7/ 8), 37.489: [Blue] ~23 levels ~1966080 states ~12892896 transitions
pins2lts-mc-linux64( 1/ 8), 73.662: [Blue] ~24 levels ~3932160 states ~26914168 transitions
pins2lts-mc-linux64( 5/ 8), 145.459: [Blue] ~25 levels ~7864320 states ~55217496 transitions
pins2lts-mc-linux64( 3/ 8), 295.958: [Blue] ~25 levels ~15728640 states ~120340600 transitions
pins2lts-mc-linux64( 0/ 8), 452.193: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 452.251:
pins2lts-mc-linux64( 0/ 8), 452.251: Explored 22943600 states 179533278 transitions, fanout: 7.825
pins2lts-mc-linux64( 0/ 8), 452.251: Total exploration time 452.150 sec (452.100 sec minimum, 452.115 sec on average)
pins2lts-mc-linux64( 0/ 8), 452.251: States per second: 50743, Transitions per second: 397066
pins2lts-mc-linux64( 0/ 8), 452.251:
pins2lts-mc-linux64( 0/ 8), 452.251: State space has 22939602 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 452.251: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 452.251: blue states: 22943600 (100.02%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 452.251: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 452.251: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 452.251:
pins2lts-mc-linux64( 0/ 8), 452.251: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 452.251:
pins2lts-mc-linux64( 0/ 8), 452.251: Queue width: 8B, total height: 201, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 452.251: Tree memory: 431.0MB, 19.7 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 452.251: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 452.251: Stored 298 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 452.251: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 452.251: Est. total memory use: 431.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15038367403723906315;'/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((!(false U X((LTLAPp1==true)))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15038367403723906315;'/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((!(false U X((LTLAPp1==true)))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 18:37:15] [INFO ] Applying decomposition
[2022-05-19 18:37:16] [INFO ] Flatten gal took : 458 ms
[2022-05-19 18:37:16] [INFO ] Decomposing Gal with order
[2022-05-19 18:37:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:37:17] [INFO ] Removed a total of 170 redundant transitions.
[2022-05-19 18:37:17] [INFO ] Flatten gal took : 323 ms
[2022-05-19 18:37:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 68 ms.
[2022-05-19 18:37:17] [INFO ] Time to serialize gal into /tmp/LTLFireability3160572743452169343.gal : 21 ms
[2022-05-19 18:37:17] [INFO ] Time to serialize properties into /tmp/LTLFireability15439233311392685051.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/LTLFireability3160572743452169343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15439233311392685051.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 1 LTL properties
Checking formula 0 : !((X(F(G(X((((((!(X("((a4.a4_0>=1)||((((((tsid0.n2_0>=1)&&(tsid1.n2_1>=1))&&((tsid2.n2_2>=1)&&(tsid3.n2_3>=1)))&&(((tsid4.n2_4>=1)&&(t...833
Formula 0 simplified : !XFGX("((((tsid3.s6_3<1)&&(tsid4.s6_4<1))&&((tsid5.s6_5<1)&&(tsid14.s6_14<1)))&&(((tsid15.s6_15<1)&&(tsid16.s6_16<1))&&((tsid17.s6_1...806
Detected timeout of ITS tools.
[2022-05-19 18:59:48] [INFO ] Flatten gal took : 432 ms
[2022-05-19 18:59:50] [INFO ] Input system was already deterministic with 296 transitions.
[2022-05-19 18:59:50] [INFO ] Transformed 1356 places.
[2022-05-19 18:59:50] [INFO ] Transformed 296 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:59:51] [INFO ] Time to serialize gal into /tmp/LTLFireability16856911210992974593.gal : 19 ms
[2022-05-19 18:59:51] [INFO ] Time to serialize properties into /tmp/LTLFireability15817779623979838510.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/LTLFireability16856911210992974593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15817779623979838510.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 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(G(X((((((!(X("((a4_0>=1)||((((((n2_0>=1)&&(n2_1>=1))&&((n2_2>=1)&&(n2_3>=1)))&&(((n2_4>=1)&&(n2_5>=1))&&((n2_6>=1)&&(n2_7>=1)))...581
Formula 0 simplified : !XFGX("((((s6_3<1)&&(s6_4<1))&&((s6_5<1)&&(s6_14<1)))&&(((s6_15<1)&&(s6_16<1))&&((s6_17<1)&&(s6_10<1))))" & "(((s6_7<1)&&(s6_8<1))&&...554

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-18"
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-18, 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-165277017400924"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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 ;