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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 43K Apr 30 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 295K Apr 30 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 30 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 30 13:26 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 19K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 360K 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-PT-18-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652996024151

Running Version 202205111006
[2022-05-19 21:33:45] [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 21:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 21:33:45] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2022-05-19 21:33:45] [INFO ] Transformed 1398 places.
[2022-05-19 21:33:45] [INFO ] Transformed 296 transitions.
[2022-05-19 21:33:45] [INFO ] Parsed PT model containing 1398 places and 296 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 524 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 96 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 21:33:45] [INFO ] Computed 1062 place invariants in 104 ms
[2022-05-19 21:33:46] [INFO ] Implicit Places using invariants in 1154 ms returned []
// Phase 1: matrix 296 rows 1356 cols
[2022-05-19 21:33:47] [INFO ] Computed 1062 place invariants in 51 ms
[2022-05-19 21:33:48] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2656 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1398 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1337/1398 places, 296/296 transitions.
Support contains 524 out of 1337 places after structural reductions.
[2022-05-19 21:33:48] [INFO ] Flatten gal took : 113 ms
[2022-05-19 21:33:48] [INFO ] Flatten gal took : 77 ms
[2022-05-19 21:33:49] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 441 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:33:49] [INFO ] Computed 1044 place invariants in 156 ms
[2022-05-19 21:33:51] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 176 ms returned sat
[2022-05-19 21:33:51] [INFO ] After 1084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-19 21:33:52] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 172 ms returned sat
[2022-05-19 21:33:55] [INFO ] After 2903ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :16
[2022-05-19 21:33:57] [INFO ] After 4202ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :16
Attempting to minimize the solution found.
Minimization took 1114 ms.
[2022-05-19 21:33:58] [INFO ] After 7098ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :16
Fused 20 Parikh solutions to 14 different solutions.
Finished Parikh walk after 138 steps, including 0 resets, run visited all 9 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 16 properties in 14 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-03 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 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 14 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:33:58] [INFO ] Computed 1044 place invariants in 91 ms
[2022-05-19 21:33:59] [INFO ] Implicit Places using invariants in 1038 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:33:59] [INFO ] Computed 1044 place invariants in 91 ms
[2022-05-19 21:34:01] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 2620 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:34:01] [INFO ] Computed 1044 place invariants in 100 ms
[2022-05-19 21:34:01] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 285 ms :[p1, p1, true]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s125 1) (GEQ s1236 1) (GEQ s1237 1) (GEQ s1238 1) (GEQ s1239 1) (GEQ s1240 1) (GEQ s1241 1) (GEQ s1242 1) (GEQ s1243 1) (GEQ s1244 1) (GEQ s1...], 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 561 ms.
Product exploration explored 100000 steps with 50000 reset in 499 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 129 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-00 finished in 4947 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 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 969 are kept as prefixes of interest. Removing 368 places using SCC suffix rule.16 ms
Discarding 368 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 969 transition count 283
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 939 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 939 transition count 223
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 1 with 2 rules applied. Total rules applied 69 place count 938 transition count 222
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 938 transition count 222
Applied a total of 70 rules in 324 ms. Remains 938 /1337 variables (removed 399) and now considering 222/296 (removed 74) transitions.
// Phase 1: matrix 222 rows 938 cols
[2022-05-19 21:34:04] [INFO ] Computed 720 place invariants in 6 ms
[2022-05-19 21:34:04] [INFO ] Implicit Places using invariants in 744 ms returned []
// Phase 1: matrix 222 rows 938 cols
[2022-05-19 21:34:04] [INFO ] Computed 720 place invariants in 11 ms
[2022-05-19 21:34:06] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2022-05-19 21:34:06] [INFO ] Redundant transitions in 30 ms returned [186]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 221 rows 938 cols
[2022-05-19 21:34:06] [INFO ] Computed 720 place invariants in 6 ms
[2022-05-19 21:34:06] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 938/1337 places, 221/296 transitions.
Graph (complete) has 8535 edges and 938 vertex of which 215 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.2 ms
Discarding 723 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 197 transition count 165
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 197 transition count 165
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 179 transition count 129
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 179 transition count 129
Applied a total of 73 rules in 24 ms. Remains 179 /938 variables (removed 759) and now considering 129/221 (removed 92) transitions.
// Phase 1: matrix 129 rows 179 cols
[2022-05-19 21:34:06] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-19 21:34:06] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 129 rows 179 cols
[2022-05-19 21:34:06] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-19 21:34:07] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 179/1337 places, 129/296 transitions.
Finished structural reductions, in 2 iterations. Remains : 179/1337 places, 129/296 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p1), true, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s63 1), p0:(AND (GEQ s51 1) (GEQ s78 1) (GEQ s79 1) (GEQ s80 1) (GEQ s81 1) (GEQ s82 1) (GEQ s83 1) (GEQ s84 1) (GEQ s85 1) (GEQ s86 1) (GEQ s87 1...], 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 4536 reset in 315 ms.
Product exploration explored 100000 steps with 4528 reset in 278 ms.
Computed a total of 179 stabilizing places and 129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 179 transition count 129
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 316 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 70 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 388 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 129 rows 179 cols
[2022-05-19 21:34:08] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-19 21:34:08] [INFO ] [Real]Absence check using 0 positive and 54 generalized place invariants in 6 ms returned sat
[2022-05-19 21:34:08] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-19 21:34:08] [INFO ] After 160ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-19 21:34:08] [INFO ] After 235ms 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 3 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 388 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 72 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), true, p0]
// Phase 1: matrix 129 rows 179 cols
[2022-05-19 21:34:09] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:09] [INFO ] [Real]Absence check using 0 positive and 54 generalized place invariants in 8 ms returned sat
[2022-05-19 21:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:34:09] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-19 21:34:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:34:09] [INFO ] [Nat]Absence check using 0 positive and 54 generalized place invariants in 8 ms returned sat
[2022-05-19 21:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:34:09] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-19 21:34:09] [INFO ] Computed and/alt/rep : 101/139/101 causal constraints (skipped 7 transitions) in 10 ms.
[2022-05-19 21:34:09] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 21 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 179 cols
[2022-05-19 21:34:09] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:09] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 129 rows 179 cols
[2022-05-19 21:34:09] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:09] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2022-05-19 21:34:10] [INFO ] Redundant transitions in 24 ms returned [125]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 128 rows 179 cols
[2022-05-19 21:34:10] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:10] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/179 places, 128/129 transitions.
Graph (complete) has 689 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 5 ms. Remains 178 /179 variables (removed 1) and now considering 127/128 (removed 1) transitions.
// Phase 1: matrix 127 rows 178 cols
[2022-05-19 21:34:10] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:10] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 127 rows 178 cols
[2022-05-19 21:34:10] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-19 21:34:10] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/179 places, 127/129 transitions.
Finished structural reductions, in 2 iterations. Remains : 178/179 places, 127/129 transitions.
Computed a total of 178 stabilizing places and 127 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 127
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 393 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 69 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 389 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 127 rows 178 cols
[2022-05-19 21:34:11] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:11] [INFO ] [Real]Absence check using 0 positive and 54 generalized place invariants in 7 ms returned sat
[2022-05-19 21:34:11] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-19 21:34:11] [INFO ] After 82ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-19 21:34:11] [INFO ] After 175ms 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 71 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=23 )
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 404 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 69 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), true, p0]
// Phase 1: matrix 127 rows 178 cols
[2022-05-19 21:34:11] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-19 21:34:11] [INFO ] [Real]Absence check using 0 positive and 54 generalized place invariants in 8 ms returned sat
[2022-05-19 21:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:34:11] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-19 21:34:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:34:11] [INFO ] [Nat]Absence check using 0 positive and 54 generalized place invariants in 8 ms returned sat
[2022-05-19 21:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:34:12] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-19 21:34:12] [INFO ] Computed and/alt/rep : 99/137/99 causal constraints (skipped 7 transitions) in 9 ms.
[2022-05-19 21:34:12] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 497 ms :[(NOT p1), true, p0]
Product exploration explored 100000 steps with 4517 reset in 226 ms.
Product exploration explored 100000 steps with 4527 reset in 231 ms.
Built C files in :
/tmp/ltsmin14502828749928905405
[2022-05-19 21:34:13] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2022-05-19 21:34:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:34:13] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2022-05-19 21:34:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:34:13] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2022-05-19 21:34:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:34:13] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14502828749928905405
Running compilation step : cd /tmp/ltsmin14502828749928905405;'/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 385 ms.
Running link step : cd /tmp/ltsmin14502828749928905405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14502828749928905405;'/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/stateBased4668482122969813788.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 21 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 127/127 transitions.
Applied a total of 0 rules in 10 ms. Remains 178 /178 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 178 cols
[2022-05-19 21:34:28] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:28] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 127 rows 178 cols
[2022-05-19 21:34:28] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:28] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2022-05-19 21:34:28] [INFO ] Redundant transitions in 19 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 126 rows 178 cols
[2022-05-19 21:34:28] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 21:34:28] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 178/178 places, 126/127 transitions.
Graph (complete) has 688 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 177 /178 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 21:34:28] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-19 21:34:28] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 125 rows 177 cols
[2022-05-19 21:34:28] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-19 21:34:28] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/178 places, 125/127 transitions.
Finished structural reductions, in 2 iterations. Remains : 177/178 places, 125/127 transitions.
Built C files in :
/tmp/ltsmin7029770646257114253
[2022-05-19 21:34:28] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-19 21:34:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:34:28] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-19 21:34:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:34:28] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-19 21:34:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:34:28] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7029770646257114253
Running compilation step : cd /tmp/ltsmin7029770646257114253;'/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 275 ms.
Running link step : cd /tmp/ltsmin7029770646257114253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7029770646257114253;'/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/stateBased744267107561238908.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 21:34:43] [INFO ] Flatten gal took : 9 ms
[2022-05-19 21:34:43] [INFO ] Flatten gal took : 8 ms
[2022-05-19 21:34:43] [INFO ] Time to serialize gal into /tmp/LTL5430519574717779258.gal : 2 ms
[2022-05-19 21:34:43] [INFO ] Time to serialize properties into /tmp/LTL3860968112446481665.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/LTL5430519574717779258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3860968112446481665.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/LTL5430519...266
Read 1 LTL properties
Checking formula 0 : !(((!(F("((((((a5>=1)&&(n6_14>=1))&&((n6_13>=1)&&(n6_12>=1)))&&(((n6_11>=1)&&(n6_10>=1))&&((n6_9>=1)&&(n6_8>=1))))&&((((n6_7>=1)&&(n6_...311
Formula 0 simplified : !(!F"((((((a5>=1)&&(n6_14>=1))&&((n6_13>=1)&&(n6_12>=1)))&&(((n6_11>=1)&&(n6_10>=1))&&((n6_9>=1)&&(n6_8>=1))))&&((((n6_7>=1)&&(n6_6>...305
Detected timeout of ITS tools.
[2022-05-19 21:34:59] [INFO ] Flatten gal took : 8 ms
[2022-05-19 21:34:59] [INFO ] Applying decomposition
[2022-05-19 21:34:59] [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/graph503131589802341279.txt' '-o' '/tmp/graph503131589802341279.bin' '-w' '/tmp/graph503131589802341279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph503131589802341279.bin' '-l' '-1' '-v' '-w' '/tmp/graph503131589802341279.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:34:59] [INFO ] Decomposing Gal with order
[2022-05-19 21:34:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:34:59] [INFO ] Removed a total of 132 redundant transitions.
[2022-05-19 21:34:59] [INFO ] Flatten gal took : 301 ms
[2022-05-19 21:34:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 20 ms.
[2022-05-19 21:34:59] [INFO ] Time to serialize gal into /tmp/LTL18150545195029244174.gal : 4 ms
[2022-05-19 21:34:59] [INFO ] Time to serialize properties into /tmp/LTL8835311174395437649.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/LTL18150545195029244174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8835311174395437649.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/LTL1815054...246
Read 1 LTL properties
Checking formula 0 : !(((!(F("((((((i2.u10.a5>=1)&&(i17.u23.n6_14>=1))&&((i9.u35.n6_13>=1)&&(i10.u24.n6_12>=1)))&&(((i8.u37.n6_11>=1)&&(i13.u36.n6_10>=1))&...469
Formula 0 simplified : !(!F"((((((i2.u10.a5>=1)&&(i17.u23.n6_14>=1))&&((i9.u35.n6_13>=1)&&(i10.u24.n6_12>=1)))&&(((i8.u37.n6_11>=1)&&(i13.u36.n6_10>=1))&&(...463
Reverse transition relation is NOT exact ! Due to transitions t160, t168, t171, t172, t174, t180, t185, t186, t192, t193, t203, t204, t205, t206, t207, t20...363
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
1047 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,10.5049,337012,1,0,910738,19406,2371,655107,178,92547,1020557
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-05 finished in 68519 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 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1314 transition count 291
Applied a total of 5 rules in 64 ms. Remains 1314 /1337 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1314 cols
[2022-05-19 21:35:12] [INFO ] Computed 1026 place invariants in 21 ms
[2022-05-19 21:35:13] [INFO ] Implicit Places using invariants in 981 ms returned []
// Phase 1: matrix 291 rows 1314 cols
[2022-05-19 21:35:13] [INFO ] Computed 1026 place invariants in 21 ms
[2022-05-19 21:35:14] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned [1153, 1154, 1155, 1156, 1157, 1158, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1274, 1275, 1276, 1277, 1280]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2591 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1337 places, 291/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1295/1337 places, 291/296 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s13 1) (GEQ s375 1) (GEQ s377 1) (GEQ s378 1) (GEQ s383 1) (GEQ s384 1) (GEQ s385 1) (GEQ s386 1) (GEQ s387 1) (GEQ s388 1) (GEQ s389 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-07 finished in 2815 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p0)) U p1)&&G((p2&&X(p0))))))'
Support contains 22 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 40 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:15] [INFO ] Computed 1044 place invariants in 96 ms
[2022-05-19 21:35:16] [INFO ] Implicit Places using invariants in 1260 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:16] [INFO ] Computed 1044 place invariants in 100 ms
[2022-05-19 21:35:18] [INFO ] Implicit Places using invariants and state equation in 2125 ms returned []
Implicit Place search using SMT with State Equation took 3407 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:18] [INFO ] Computed 1044 place invariants in 113 ms
[2022-05-19 21:35:19] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 784 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s128 1), p2:(GEQ s1268 1), p0:(AND (GEQ s125 1) (GEQ s1236 1) (GEQ s1237 1) (GEQ s1238 1) (GEQ s1239 1) (GEQ s1240 1) (GEQ s1241 1) (GEQ s1242 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-08 finished in 4805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U !p2)&&G(p1)&&p0))))'
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1315 transition count 292
Applied a total of 3 rules in 121 ms. Remains 1315 /1337 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2022-05-19 21:35:20] [INFO ] Computed 1026 place invariants in 51 ms
[2022-05-19 21:35:21] [INFO ] Implicit Places using invariants in 1233 ms returned []
// Phase 1: matrix 292 rows 1315 cols
[2022-05-19 21:35:21] [INFO ] Computed 1026 place invariants in 72 ms
[2022-05-19 21:35:23] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned [1154, 1155, 1156, 1157, 1158, 1159, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1275, 1276, 1277, 1278, 1281]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3230 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1337 places, 292/296 transitions.
Applied a total of 0 rules in 46 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1296/1337 places, 292/296 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1) p2), p2]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s29 1)), p0:(AND (GEQ s0 1) (GEQ s29 1)), p2:(GEQ s127 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-09 finished in 3550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((F(G(p1))&&X(p2)))||p0))))'
Support contains 23 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:23] [INFO ] Computed 1044 place invariants in 120 ms
[2022-05-19 21:35:24] [INFO ] Implicit Places using invariants in 1308 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:24] [INFO ] Computed 1044 place invariants in 114 ms
[2022-05-19 21:35:26] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 3526 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:27] [INFO ] Computed 1044 place invariants in 110 ms
[2022-05-19 21:35:27] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s132 1) (LT s1167 1)), p2:(LT s128 1), p1:(OR (LT s127 1) (LT s1305 1) (LT s1306 1) (LT s1307 1) (LT s1308 1) (LT s1309 1) (LT s1310 1) (LT s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4416 reset in 236 ms.
Product exploration explored 100000 steps with 4419 reset in 241 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 p0 p2 p1), true, (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 331 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:29] [INFO ] Computed 1044 place invariants in 97 ms
[2022-05-19 21:35:29] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 184 ms returned sat
[2022-05-19 21:35:29] [INFO ] After 345ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 21:35:29] [INFO ] After 397ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-19 21:35:29] [INFO ] After 794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p2 p1), true, (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 1045 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 3 out of 1337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 44 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:31] [INFO ] Computed 1044 place invariants in 96 ms
[2022-05-19 21:35:32] [INFO ] Implicit Places using invariants in 1274 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:32] [INFO ] Computed 1044 place invariants in 104 ms
[2022-05-19 21:35:34] [INFO ] Implicit Places using invariants and state equation in 2094 ms returned []
Implicit Place search using SMT with State Equation took 3392 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:34] [INFO ] Computed 1044 place invariants in 112 ms
[2022-05-19 21:35:35] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
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 p0 p2), true, (F (G p0)), (F (G p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:35] [INFO ] Computed 1044 place invariants in 124 ms
[2022-05-19 21:35:36] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 183 ms returned sat
[2022-05-19 21:35:36] [INFO ] After 345ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 21:35:36] [INFO ] After 403ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-19 21:35:36] [INFO ] After 847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p2), true, (F (G p0)), (F (G p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 6367 reset in 232 ms.
Product exploration explored 100000 steps with 6321 reset in 251 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 956 are kept as prefixes of interest. Removing 381 places using SCC suffix rule.5 ms
Discarding 381 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 919 transition count 220
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 919 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 919 transition count 221
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 76 rules in 194 ms. Remains 919 /1337 variables (removed 418) and now considering 221/296 (removed 75) transitions.
[2022-05-19 21:35:38] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 221 rows 919 cols
[2022-05-19 21:35:38] [INFO ] Computed 702 place invariants in 6 ms
[2022-05-19 21:35:38] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 919/1337 places, 221/296 transitions.
Finished structural reductions, in 1 iterations. Remains : 919/1337 places, 221/296 transitions.
Product exploration explored 100000 steps with 6360 reset in 444 ms.
Product exploration explored 100000 steps with 6340 reset in 402 ms.
Built C files in :
/tmp/ltsmin16440445124137029841
[2022-05-19 21:35:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16440445124137029841
Running compilation step : cd /tmp/ltsmin16440445124137029841;'/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 941 ms.
Running link step : cd /tmp/ltsmin16440445124137029841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16440445124137029841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4732340565119731795.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 40 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:54] [INFO ] Computed 1044 place invariants in 115 ms
[2022-05-19 21:35:56] [INFO ] Implicit Places using invariants in 1615 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:56] [INFO ] Computed 1044 place invariants in 94 ms
[2022-05-19 21:35:58] [INFO ] Implicit Places using invariants and state equation in 2304 ms returned []
Implicit Place search using SMT with State Equation took 3922 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:35:58] [INFO ] Computed 1044 place invariants in 95 ms
[2022-05-19 21:35:59] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin7857010404746638040
[2022-05-19 21:35:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7857010404746638040
Running compilation step : cd /tmp/ltsmin7857010404746638040;'/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 899 ms.
Running link step : cd /tmp/ltsmin7857010404746638040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7857010404746638040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7615710129020427826.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 21:36:14] [INFO ] Flatten gal took : 68 ms
[2022-05-19 21:36:14] [INFO ] Flatten gal took : 36 ms
[2022-05-19 21:36:14] [INFO ] Time to serialize gal into /tmp/LTL6315159970130694602.gal : 5 ms
[2022-05-19 21:36:14] [INFO ] Time to serialize properties into /tmp/LTL6268098221002751142.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/LTL6315159970130694602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6268098221002751142.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/LTL6315159...266
Read 1 LTL properties
Checking formula 0 : !((G(X(((X((F(G("((((((a3<1)||(n4_14<1))||((n4_13<1)||(n4_16<1)))||(((n4_15<1)||(n4_18<1))||((n4_17<1)||(n4_6<1))))||((((n4_5<1)||(n4_...341
Formula 0 simplified : !GX("(Sstart_11<1)" | "(n1_11<1)" | X(FG"((((((a3<1)||(n4_14<1))||((n4_13<1)||(n4_16<1)))||(((n4_15<1)||(n4_18<1))||((n4_17<1)||(n4_...322
Detected timeout of ITS tools.
[2022-05-19 21:36:29] [INFO ] Flatten gal took : 36 ms
[2022-05-19 21:36:29] [INFO ] Applying decomposition
[2022-05-19 21:36:29] [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/graph10908909687680487898.txt' '-o' '/tmp/graph10908909687680487898.bin' '-w' '/tmp/graph10908909687680487898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10908909687680487898.bin' '-l' '-1' '-v' '-w' '/tmp/graph10908909687680487898.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:36:29] [INFO ] Decomposing Gal with order
[2022-05-19 21:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:36:29] [INFO ] Removed a total of 189 redundant transitions.
[2022-05-19 21:36:29] [INFO ] Flatten gal took : 113 ms
[2022-05-19 21:36:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 41 ms.
[2022-05-19 21:36:30] [INFO ] Time to serialize gal into /tmp/LTL12320607532663589850.gal : 13 ms
[2022-05-19 21:36:30] [INFO ] Time to serialize properties into /tmp/LTL16989398144822516484.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/LTL12320607532663589850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16989398144822516484.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/LTL1232060...247
Read 1 LTL properties
Checking formula 0 : !((G(X(((X((F(G("((((((i26.i0.u45.a3<1)||(i20.i1.u114.n4_14<1))||((i22.i0.u103.n4_13<1)||(i28.i1.u104.n4_16<1)))||(((i21.i1.u115.n4_15...598
Formula 0 simplified : !GX("(i24.i0.u38.n1_11<1)" | "(i24.i0.u48.Sstart_11<1)" | X(FG"((((((i26.i0.u45.a3<1)||(i20.i1.u114.n4_14<1))||((i22.i0.u103.n4_13<1...579
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2169659255662217323
[2022-05-19 21:36:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2169659255662217323
Running compilation step : cd /tmp/ltsmin2169659255662217323;'/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 1001 ms.
Running link step : cd /tmp/ltsmin2169659255662217323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2169659255662217323;'/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((<>([]((LTLAPp1==true)))&&X((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-10 finished in 96845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(!p0)&&(G(p1)||G(p2)))))'
Support contains 4 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.7 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1316 transition count 293
Applied a total of 2 rules in 86 ms. Remains 1316 /1337 variables (removed 21) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1316 cols
[2022-05-19 21:37:00] [INFO ] Computed 1026 place invariants in 29 ms
[2022-05-19 21:37:01] [INFO ] Implicit Places using invariants in 1279 ms returned []
// Phase 1: matrix 293 rows 1316 cols
[2022-05-19 21:37:01] [INFO ] Computed 1026 place invariants in 25 ms
[2022-05-19 21:37:03] [INFO ] Implicit Places using invariants and state equation in 2255 ms returned [1155, 1156, 1157, 1158, 1159, 1160, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1276, 1277, 1278, 1279, 1282]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3540 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1297/1337 places, 293/296 transitions.
Applied a total of 0 rules in 48 ms. Remains 1297 /1297 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1297/1337 places, 293/296 transitions.
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 7}]], initial=7, aps=[p2:(LT s128 1), p1:(LT s126 1), p0:(OR (LT s0 1) (LT s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 4214 reset in 318 ms.
Product exploration explored 100000 steps with 4214 reset in 331 ms.
Computed a total of 1297 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1297 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 p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (AND p1 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 51 factoid took 2456 ms. Reduced automaton from 8 states, 27 edges and 3 AP to 8 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 421 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 533163 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533163 steps, saw 79177 distinct states, run finished after 3004 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:37:11] [INFO ] Computed 1008 place invariants in 127 ms
[2022-05-19 21:37:12] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 183 ms returned sat
[2022-05-19 21:37:12] [INFO ] After 355ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:19
[2022-05-19 21:37:12] [INFO ] After 450ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :2 real:19
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-05-19 21:37:12] [INFO ] After 1492ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :2 real:19
[2022-05-19 21:37:13] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 163 ms returned sat
[2022-05-19 21:37:15] [INFO ] After 1259ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :20
[2022-05-19 21:37:16] [INFO ] After 2519ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :20
Attempting to minimize the solution found.
Minimization took 920 ms.
[2022-05-19 21:37:17] [INFO ] After 4653ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :20
Fused 23 Parikh solutions to 15 different solutions.
Finished Parikh walk after 51 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 20 properties in 6 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (AND p1 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (G p2)), (F (G p1)), (F (G p0)), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p0 p1))), (F (AND p2 (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (NOT (AND p2 p1))), (F (NOT p2)), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p2 p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 p0))), (F (AND (NOT p2) p0 p1)), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 54 factoid took 2045 ms. Reduced automaton from 8 states, 27 edges and 3 AP to 8 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p2), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p2), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 1297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1297/1297 places, 293/293 transitions.
Applied a total of 0 rules in 36 ms. Remains 1297 /1297 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:37:20] [INFO ] Computed 1008 place invariants in 113 ms
[2022-05-19 21:37:21] [INFO ] Implicit Places using invariants in 1336 ms returned []
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:37:21] [INFO ] Computed 1008 place invariants in 109 ms
[2022-05-19 21:37:23] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:37:23] [INFO ] Computed 1008 place invariants in 111 ms
[2022-05-19 21:37:24] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1297/1297 places, 293/293 transitions.
Computed a total of 1297 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1297 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 p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 p2))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (AND p1 p2)), (X (AND p0 p2)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (AND p1 p2))), (X (X (AND p0 p2))), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 2249 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 8 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p2), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 422 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 625217 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625217 steps, saw 92829 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:37:30] [INFO ] Computed 1008 place invariants in 116 ms
[2022-05-19 21:37:31] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 173 ms returned sat
[2022-05-19 21:37:31] [INFO ] After 387ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:11
[2022-05-19 21:37:31] [INFO ] After 532ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:11
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-19 21:37:31] [INFO ] After 1301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:11
[2022-05-19 21:37:32] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 172 ms returned sat
[2022-05-19 21:37:33] [INFO ] After 1051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-19 21:37:34] [INFO ] After 1879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 794 ms.
[2022-05-19 21:37:35] [INFO ] After 3564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 11 different solutions.
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 14 properties in 5 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 p2))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (AND p1 p2)), (X (AND p0 p2)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (AND p1 p2))), (X (X (AND p0 p2))), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 p0 p1))), (F (NOT (AND p2 p0))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p2 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 32 factoid took 2897 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 8 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p2), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p2), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p2), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4211 reset in 303 ms.
Product exploration explored 100000 steps with 4204 reset in 299 ms.
Applying partial POR strategy [true, true, true, true, true, true, false, false]
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p2), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 1297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1297/1297 places, 293/293 transitions.
Applied a total of 0 rules in 60 ms. Remains 1297 /1297 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2022-05-19 21:37:40] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:37:40] [INFO ] Computed 1008 place invariants in 124 ms
[2022-05-19 21:37:40] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1297/1297 places, 293/293 transitions.
Product exploration explored 100000 steps with 4212 reset in 278 ms.
Product exploration explored 100000 steps with 4218 reset in 308 ms.
Built C files in :
/tmp/ltsmin9819894074422432805
[2022-05-19 21:37:42] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9819894074422432805
Running compilation step : cd /tmp/ltsmin9819894074422432805;'/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 887 ms.
Running link step : cd /tmp/ltsmin9819894074422432805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9819894074422432805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12647981936546280597.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1297/1297 places, 293/293 transitions.
Applied a total of 0 rules in 33 ms. Remains 1297 /1297 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:37:57] [INFO ] Computed 1008 place invariants in 131 ms
[2022-05-19 21:37:59] [INFO ] Implicit Places using invariants in 1301 ms returned []
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:37:59] [INFO ] Computed 1008 place invariants in 124 ms
[2022-05-19 21:38:01] [INFO ] Implicit Places using invariants and state equation in 2367 ms returned []
Implicit Place search using SMT with State Equation took 3669 ms to find 0 implicit places.
// Phase 1: matrix 293 rows 1297 cols
[2022-05-19 21:38:01] [INFO ] Computed 1008 place invariants in 108 ms
[2022-05-19 21:38:02] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1297/1297 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin7295552855280981673
[2022-05-19 21:38:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7295552855280981673
Running compilation step : cd /tmp/ltsmin7295552855280981673;'/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 855 ms.
Running link step : cd /tmp/ltsmin7295552855280981673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7295552855280981673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9505525432699573140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 21:38:17] [INFO ] Flatten gal took : 40 ms
[2022-05-19 21:38:17] [INFO ] Flatten gal took : 27 ms
[2022-05-19 21:38:17] [INFO ] Time to serialize gal into /tmp/LTL14954149790993171381.gal : 4 ms
[2022-05-19 21:38:17] [INFO ] Time to serialize properties into /tmp/LTL18108583381108266946.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/LTL14954149790993171381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18108583381108266946.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/LTL1495414...268
Read 1 LTL properties
Checking formula 0 : !(((G("((malicious_reservoir<1)||(s3_7<1))"))||((F("((malicious_reservoir>=1)&&(s3_7>=1))"))&&((G("(a3<1)"))||(G("(a4<1)"))))))
Formula 0 simplified : !(G"((malicious_reservoir<1)||(s3_7<1))" | (F"((malicious_reservoir>=1)&&(s3_7>=1))" & (G"(a3<1)" | G"(a4<1)")))
Detected timeout of ITS tools.
[2022-05-19 21:38:32] [INFO ] Flatten gal took : 39 ms
[2022-05-19 21:38:32] [INFO ] Applying decomposition
[2022-05-19 21:38:32] [INFO ] Flatten gal took : 27 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/graph12736451494697006256.txt' '-o' '/tmp/graph12736451494697006256.bin' '-w' '/tmp/graph12736451494697006256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12736451494697006256.bin' '-l' '-1' '-v' '-w' '/tmp/graph12736451494697006256.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:38:32] [INFO ] Decomposing Gal with order
[2022-05-19 21:38:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:38:32] [INFO ] Removed a total of 189 redundant transitions.
[2022-05-19 21:38:32] [INFO ] Flatten gal took : 99 ms
[2022-05-19 21:38:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 18 ms.
[2022-05-19 21:38:32] [INFO ] Time to serialize gal into /tmp/LTL16177193440122075870.gal : 7 ms
[2022-05-19 21:38:32] [INFO ] Time to serialize properties into /tmp/LTL11887176076581401498.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/LTL16177193440122075870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11887176076581401498.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/LTL1617719...247
Read 1 LTL properties
Checking formula 0 : !(((G("((u0.malicious_reservoir<1)||(i19.u21.s3_7<1))"))||((F("((u0.malicious_reservoir>=1)&&(i19.u21.s3_7>=1))"))&&((G("(i20.u36.a3<1...186
Formula 0 simplified : !(G"((u0.malicious_reservoir<1)||(i19.u21.s3_7<1))" | (F"((u0.malicious_reservoir>=1)&&(i19.u21.s3_7>=1))" & (G"(i20.u36.a3<1)" | G"...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10379939488367517900
[2022-05-19 21:38:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10379939488367517900
Running compilation step : cd /tmp/ltsmin10379939488367517900;'/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 864 ms.
Running link step : cd /tmp/ltsmin10379939488367517900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10379939488367517900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||(<>(!(LTLAPp0==true))&&([]((LTLAPp1==true))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-11 finished in 122596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U X((p1 U X(p2))))||F(p1)))))'
Support contains 4 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:39:03] [INFO ] Computed 1044 place invariants in 110 ms
[2022-05-19 21:39:04] [INFO ] Implicit Places using invariants in 1275 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:39:04] [INFO ] Computed 1044 place invariants in 106 ms
[2022-05-19 21:39:06] [INFO ] Implicit Places using invariants and state equation in 2331 ms returned []
Implicit Place search using SMT with State Equation took 3612 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:39:06] [INFO ] Computed 1044 place invariants in 96 ms
[2022-05-19 21:39:07] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s41 1)), p2:(GEQ s1268 1), p0:(GEQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 2 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-12 finished in 4538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))||p1)))'
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1315 transition count 292
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1315 transition count 292
Applied a total of 4 rules in 125 ms. Remains 1315 /1337 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1315 cols
[2022-05-19 21:39:07] [INFO ] Computed 1026 place invariants in 64 ms
[2022-05-19 21:39:08] [INFO ] Implicit Places using invariants in 1242 ms returned []
// Phase 1: matrix 292 rows 1315 cols
[2022-05-19 21:39:08] [INFO ] Computed 1026 place invariants in 49 ms
[2022-05-19 21:39:11] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned [1154, 1155, 1156, 1157, 1158, 1159, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1275, 1276, 1277, 1278, 1281]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3497 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1337 places, 292/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1296/1337 places, 292/296 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s9 1)), p0:(LT s126 1)], 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 4209 reset in 231 ms.
Product exploration explored 100000 steps with 4213 reset in 245 ms.
Computed a total of 1296 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1296 transition count 292
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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 10 factoid took 245 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-14 finished in 4698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U (!G(p1) U G(p0)))&&F(p2)))))'
Support contains 4 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:39:12] [INFO ] Computed 1044 place invariants in 103 ms
[2022-05-19 21:39:13] [INFO ] Implicit Places using invariants in 1357 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:39:13] [INFO ] Computed 1044 place invariants in 98 ms
[2022-05-19 21:39:15] [INFO ] Implicit Places using invariants and state equation in 2165 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2022-05-19 21:39:15] [INFO ] Computed 1044 place invariants in 92 ms
[2022-05-19 21:39:16] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s31 1)), p0:(GEQ s30 1), p1:(AND (GEQ s0 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-15 finished in 4369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((F(G(p1))&&X(p2)))||p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(!p0)&&(G(p1)||G(p2)))))'
[2022-05-19 21:39:16] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9689322740563811409
[2022-05-19 21:39:16] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2022-05-19 21:39:16] [INFO ] Applying decomposition
[2022-05-19 21:39:16] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:39:16] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2022-05-19 21:39:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:39:16] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2022-05-19 21:39:16] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:39:16] [INFO ] Flatten gal took : 28 ms
[2022-05-19 21:39:16] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9689322740563811409
Running compilation step : cd /tmp/ltsmin9689322740563811409;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12600600277198048508.txt' '-o' '/tmp/graph12600600277198048508.bin' '-w' '/tmp/graph12600600277198048508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12600600277198048508.bin' '-l' '-1' '-v' '-w' '/tmp/graph12600600277198048508.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:39:16] [INFO ] Decomposing Gal with order
[2022-05-19 21:39:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:39:16] [INFO ] Removed a total of 188 redundant transitions.
[2022-05-19 21:39:16] [INFO ] Flatten gal took : 96 ms
[2022-05-19 21:39:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 17 ms.
[2022-05-19 21:39:17] [INFO ] Time to serialize gal into /tmp/LTLFireability5823320679084321369.gal : 7 ms
[2022-05-19 21:39:17] [INFO ] Time to serialize properties into /tmp/LTLFireability15985977892022493588.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/LTLFireability5823320679084321369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15985977892022493588.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(X(((X((F(G("((((((i12.i1.u49.a3<1)||(i32.u97.n4_14<1))||((i19.u98.n4_13<1)||(i37.i1.u99.n4_16<1)))||(((i23.i1.u100.n4_15<1)||(i38...580
Formula 0 simplified : !GX("(i20.u40.n1_11<1)" | "(i20.u83.Sstart_11<1)" | X(FG"((((((i12.i1.u49.a3<1)||(i32.u97.n4_14<1))||((i19.u98.n4_13<1)||(i37.i1.u99...561
Compilation finished in 1052 ms.
Running link step : cd /tmp/ltsmin9689322740563811409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9689322740563811409;'/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((<>([]((LTLAPp1==true)))&&X((LTLAPp2==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( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: LTL layer: formula: [](X((X((<>([]((LTLAPp1==true)))&&X((LTLAPp2==true))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 6/ 8), 0.008: "[](X((X((<>([]((LTLAPp1==true)))&&X((LTLAPp2==true))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.083: There are 303 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.083: State length is 1338, there are 307 groups
pins2lts-mc-linux64( 0/ 8), 0.083: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.083: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.083: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.083: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.167: [Blue] ~21 levels ~960 states ~4608 transitions
pins2lts-mc-linux64( 7/ 8), 0.200: [Blue] ~22 levels ~1920 states ~9176 transitions
pins2lts-mc-linux64( 7/ 8), 0.270: [Blue] ~22 levels ~3840 states ~19280 transitions
pins2lts-mc-linux64( 7/ 8), 0.369: [Blue] ~22 levels ~7680 states ~36176 transitions
pins2lts-mc-linux64( 7/ 8), 0.585: [Blue] ~22 levels ~15360 states ~79632 transitions
pins2lts-mc-linux64( 7/ 8), 0.982: [Blue] ~22 levels ~30720 states ~155096 transitions
pins2lts-mc-linux64( 7/ 8), 1.711: [Blue] ~22 levels ~61440 states ~330792 transitions
pins2lts-mc-linux64( 7/ 8), 2.895: [Blue] ~22 levels ~122880 states ~657104 transitions
pins2lts-mc-linux64( 7/ 8), 4.999: [Blue] ~22 levels ~245760 states ~1322784 transitions
pins2lts-mc-linux64( 7/ 8), 9.948: [Blue] ~23 levels ~491520 states ~2781808 transitions
pins2lts-mc-linux64( 7/ 8), 19.388: [Blue] ~23 levels ~983040 states ~6301536 transitions
pins2lts-mc-linux64( 7/ 8), 36.849: [Blue] ~23 levels ~1966080 states ~12639336 transitions
pins2lts-mc-linux64( 7/ 8), 72.174: [Blue] ~23 levels ~3932160 states ~26105720 transitions
pins2lts-mc-linux64( 7/ 8), 145.261: [Blue] ~24 levels ~7864320 states ~55830608 transitions
pins2lts-mc-linux64( 7/ 8), 298.713: [Blue] ~24 levels ~15728640 states ~116969672 transitions
pins2lts-mc-linux64( 4/ 8), 321.167: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 321.224:
pins2lts-mc-linux64( 0/ 8), 321.224: Explored 15533203 states 118131557 transitions, fanout: 7.605
pins2lts-mc-linux64( 0/ 8), 321.224: Total exploration time 321.120 sec (321.080 sec minimum, 321.099 sec on average)
pins2lts-mc-linux64( 0/ 8), 321.224: States per second: 48372, Transitions per second: 367874
pins2lts-mc-linux64( 0/ 8), 321.224:
pins2lts-mc-linux64( 0/ 8), 321.224: State space has 15531538 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 321.224: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 321.224: blue states: 15533203 (100.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 321.224: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 321.224: all-red states: 5352 (0.03%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 321.224:
pins2lts-mc-linux64( 0/ 8), 321.224: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 321.224:
pins2lts-mc-linux64( 0/ 8), 321.224: Queue width: 8B, total height: 198, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 321.224: Tree memory: 374.5MB, 25.3 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 321.224: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 321.224: Stored 299 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 321.224: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 321.224: Est. total memory use: 374.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9689322740563811409;'/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((<>([]((LTLAPp1==true)))&&X((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9689322740563811409;'/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((<>([]((LTLAPp1==true)))&&X((LTLAPp2==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 22:02:07] [INFO ] Flatten gal took : 349 ms
[2022-05-19 22:02:07] [INFO ] Time to serialize gal into /tmp/LTLFireability1633043636096828344.gal : 48 ms
[2022-05-19 22:02:07] [INFO ] Time to serialize properties into /tmp/LTLFireability3981780837340429081.ltl : 19 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/LTLFireability1633043636096828344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3981780837340429081.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/LTLFireabi...288
Read 2 LTL properties
Checking formula 0 : !((G(X(((X((F(G("((((((a3<1)||(n4_14<1))||((n4_13<1)||(n4_16<1)))||(((n4_15<1)||(n4_18<1))||((n4_17<1)||(n4_6<1))))||((((n4_5<1)||(n4_...341
Formula 0 simplified : !GX("(Sstart_11<1)" | "(n1_11<1)" | X(FG"((((((a3<1)||(n4_14<1))||((n4_13<1)||(n4_16<1)))||(((n4_15<1)||(n4_18<1))||((n4_17<1)||(n4_...322
Detected timeout of ITS tools.
[2022-05-19 22:24:15] [INFO ] Flatten gal took : 322 ms
[2022-05-19 22:24:16] [INFO ] Input system was already deterministic with 296 transitions.
[2022-05-19 22:24:16] [INFO ] Transformed 1337 places.
[2022-05-19 22:24:16] [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 22:24:16] [INFO ] Time to serialize gal into /tmp/LTLFireability3068858875379462455.gal : 14 ms
[2022-05-19 22:24:16] [INFO ] Time to serialize properties into /tmp/LTLFireability13403309545562253251.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/LTLFireability3068858875379462455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13403309545562253251.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...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(((X((F(G("((((((a3<1)||(n4_14<1))||((n4_13<1)||(n4_16<1)))||(((n4_15<1)||(n4_18<1))||((n4_17<1)||(n4_6<1))))||((((n4_5<1)||(n4_...341
Formula 0 simplified : !GX("(Sstart_11<1)" | "(n1_11<1)" | X(FG"((((((a3<1)||(n4_14<1))||((n4_13<1)||(n4_16<1)))||(((n4_15<1)||(n4_18<1))||((n4_17<1)||(n4_...322

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-PT-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-PT-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-165277017500980"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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