Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873946000900.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is QuasiCertifProtocol-PT-28, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873946000900
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 749K Mar 5 18:23 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-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679000191709

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 20:56:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 20:56:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:56:33] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-16 20:56:33] [INFO ] Transformed 2998 places.
[2023-03-16 20:56:33] [INFO ] Transformed 446 transitions.
[2023-03-16 20:56:33] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2010 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 134 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 20:56:34] [INFO ] Computed 2492 place invariants in 111 ms
[2023-03-16 20:56:35] [INFO ] Implicit Places using invariants in 1487 ms returned []
[2023-03-16 20:56:35] [INFO ] Invariant cache hit.
[2023-03-16 20:56:39] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 4881 ms to find 0 implicit places.
[2023-03-16 20:56:39] [INFO ] Invariant cache hit.
[2023-03-16 20:56:40] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6096 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2010 out of 2936 places after structural reductions.
[2023-03-16 20:56:40] [INFO ] Flatten gal took : 186 ms
[2023-03-16 20:56:40] [INFO ] Flatten gal took : 114 ms
[2023-03-16 20:56:41] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 27) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-16 20:56:41] [INFO ] Invariant cache hit.
[2023-03-16 20:56:43] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 488 ms returned sat
[2023-03-16 20:56:43] [INFO ] After 1611ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-16 20:56:45] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 514 ms returned sat
[2023-03-16 20:56:50] [INFO ] After 4229ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-16 20:56:54] [INFO ] After 8084ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 2423 ms.
[2023-03-16 20:56:56] [INFO ] After 12846ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 19 Parikh solutions to 17 different solutions.
Finished Parikh walk after 166 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=55 )
Parikh walk visited 17 properties in 74 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.36 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 543 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-16 20:56:57] [INFO ] Computed 2464 place invariants in 75 ms
[2023-03-16 20:57:01] [INFO ] Implicit Places using invariants in 3988 ms returned []
[2023-03-16 20:57:01] [INFO ] Invariant cache hit.
[2023-03-16 20:57:09] [INFO ] Implicit Places using invariants and state equation in 8202 ms returned [1966, 1967, 1969, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2606, 2607, 2608, 2609, 2810, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2824]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 12196 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 296 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13036 ms. Remains : 2845/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s83 1) (GEQ s85 1) (GEQ s86 1) (GEQ s91 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1) (GEQ s97 1) (GEQ s96 1) (GEQ s99 1) (GEQ s98 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-01 finished in 13316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 900 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2095 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.13 ms
Discarding 841 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2037 transition count 331
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2037 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 2036 transition count 330
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 2036 transition count 330
Applied a total of 118 rules in 215 ms. Remains 2036 /2936 variables (removed 900) and now considering 330/446 (removed 116) transitions.
// Phase 1: matrix 330 rows 2036 cols
[2023-03-16 20:57:10] [INFO ] Computed 1708 place invariants in 12 ms
[2023-03-16 20:57:11] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2023-03-16 20:57:11] [INFO ] Invariant cache hit.
[2023-03-16 20:57:17] [INFO ] Implicit Places using invariants and state equation in 5836 ms returned [1070, 1071, 1073, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1705, 1710, 1711, 1712, 1713, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1954]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 7276 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1978/2936 places, 330/446 transitions.
Applied a total of 0 rules in 52 ms. Remains 1978 /1978 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7544 ms. Remains : 1978/2936 places, 330/446 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s149 1) (GEQ s1833 1) (GEQ s1834 1) (GEQ s1835 1) (GEQ s1836 1) (GEQ s1837 1) (GEQ s1838 1) (GEQ s1839 1) (GEQ s1840 1) (GEQ s1841 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 106 steps with 2 reset in 6 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-02 finished in 7797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(!p0)))) U G(p1)))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 206 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 20:57:18] [INFO ] Computed 2492 place invariants in 34 ms
[2023-03-16 20:57:21] [INFO ] Implicit Places using invariants in 3810 ms returned []
[2023-03-16 20:57:21] [INFO ] Invariant cache hit.
[2023-03-16 20:57:28] [INFO ] Implicit Places using invariants and state equation in 6857 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10671 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 209 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11087 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p1), p0, (AND p0 (NOT p1)), p0, p0, true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s17 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3023 reset in 591 ms.
Product exploration explored 100000 steps with 3023 reset in 595 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 290 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND p1 p0), true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 632833 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632833 steps, saw 80994 distinct states, run finished after 3002 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-16 20:57:35] [INFO ] Computed 2464 place invariants in 301 ms
[2023-03-16 20:57:36] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 472 ms returned sat
[2023-03-16 20:57:37] [INFO ] After 2169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 20:57:38] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 507 ms returned sat
[2023-03-16 20:57:47] [INFO ] After 8766ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-16 20:57:57] [INFO ] After 18502ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 4390 ms.
[2023-03-16 20:58:01] [INFO ] After 24058ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 122 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 4 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0))
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-03 finished in 43952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 200 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 20:58:02] [INFO ] Computed 2492 place invariants in 54 ms
[2023-03-16 20:58:05] [INFO ] Implicit Places using invariants in 3863 ms returned []
[2023-03-16 20:58:05] [INFO ] Invariant cache hit.
[2023-03-16 20:58:13] [INFO ] Implicit Places using invariants and state equation in 7225 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11094 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 191 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11485 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s213 1), p0:(OR (AND (GEQ s0 1) (GEQ s85 1)) (AND (GEQ s0 1) (GEQ s83 1)) (AND (GEQ s0 1) (GEQ s92 1)) (AND (GEQ s0 1) (GEQ s93 1)) (AND (GEQ s0 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][false, false, false]]
Product exploration explored 100000 steps with 7423 reset in 486 ms.
Product exploration explored 100000 steps with 7424 reset in 492 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 378 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 5 factoid took 714 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
// Phase 1: matrix 446 rows 2907 cols
[2023-03-16 20:58:16] [INFO ] Computed 2464 place invariants in 307 ms
[2023-03-16 20:58:22] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 4734 ms returned sat
[2023-03-16 20:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:58:31] [INFO ] [Real]Absence check using state equation in 9243 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2907 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2877 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.6 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2875 transition count 442
Applied a total of 5 rules in 409 ms. Remains 2875 /2907 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2875 cols
[2023-03-16 20:58:32] [INFO ] Computed 2436 place invariants in 144 ms
[2023-03-16 20:58:35] [INFO ] Implicit Places using invariants in 3881 ms returned []
[2023-03-16 20:58:35] [INFO ] Invariant cache hit.
[2023-03-16 20:58:44] [INFO ] Implicit Places using invariants and state equation in 8726 ms returned []
Implicit Place search using SMT with State Equation took 12612 ms to find 0 implicit places.
[2023-03-16 20:58:44] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-16 20:58:44] [INFO ] Invariant cache hit.
[2023-03-16 20:58:45] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2875/2907 places, 442/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14082 ms. Remains : 2875/2907 places, 442/446 transitions.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2023-03-16 20:58:46] [INFO ] Invariant cache hit.
[2023-03-16 20:58:51] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 4055 ms returned sat
[2023-03-16 20:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:59:01] [INFO ] [Real]Absence check using state equation in 9907 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7430 reset in 437 ms.
Product exploration explored 100000 steps with 7409 reset in 446 ms.
Built C files in :
/tmp/ltsmin10526850163568867370
[2023-03-16 20:59:02] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2023-03-16 20:59:02] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:59:02] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2023-03-16 20:59:02] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:59:02] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2023-03-16 20:59:02] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:59:02] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10526850163568867370
Running compilation step : cd /tmp/ltsmin10526850163568867370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2157 ms.
Running link step : cd /tmp/ltsmin10526850163568867370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10526850163568867370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8040792001424499566.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 2875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Graph (complete) has 29901 edges and 2875 vertex of which 2034 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.9 ms
Discarding 841 places :
Also discarding 0 output transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1977 transition count 328
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1977 transition count 328
Applied a total of 115 rules in 233 ms. Remains 1977 /2875 variables (removed 898) and now considering 328/442 (removed 114) transitions.
// Phase 1: matrix 328 rows 1977 cols
[2023-03-16 20:59:17] [INFO ] Computed 1652 place invariants in 22 ms
[2023-03-16 20:59:19] [INFO ] Implicit Places using invariants in 2187 ms returned []
[2023-03-16 20:59:19] [INFO ] Invariant cache hit.
[2023-03-16 20:59:23] [INFO ] Implicit Places using invariants and state equation in 3569 ms returned []
Implicit Place search using SMT with State Equation took 5763 ms to find 0 implicit places.
[2023-03-16 20:59:23] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-16 20:59:23] [INFO ] Invariant cache hit.
[2023-03-16 20:59:24] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1977/2875 places, 328/442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6665 ms. Remains : 1977/2875 places, 328/442 transitions.
Built C files in :
/tmp/ltsmin12740206158926037619
[2023-03-16 20:59:24] [INFO ] Computing symmetric may disable matrix : 328 transitions.
[2023-03-16 20:59:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:59:24] [INFO ] Computing symmetric may enable matrix : 328 transitions.
[2023-03-16 20:59:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:59:24] [INFO ] Computing Do-Not-Accords matrix : 328 transitions.
[2023-03-16 20:59:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:59:24] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12740206158926037619
Running compilation step : cd /tmp/ltsmin12740206158926037619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1357 ms.
Running link step : cd /tmp/ltsmin12740206158926037619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12740206158926037619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6853365508362928609.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 20:59:39] [INFO ] Flatten gal took : 58 ms
[2023-03-16 20:59:39] [INFO ] Flatten gal took : 50 ms
[2023-03-16 20:59:39] [INFO ] Time to serialize gal into /tmp/LTL10021559341237468489.gal : 15 ms
[2023-03-16 20:59:39] [INFO ] Time to serialize properties into /tmp/LTL14945598619556657683.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10021559341237468489.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5302620700036868692.hoa' '-atoms' '/tmp/LTL14945598619556657683.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14945598619556657683.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5302620700036868692.hoa
Detected timeout of ITS tools.
[2023-03-16 20:59:54] [INFO ] Flatten gal took : 66 ms
[2023-03-16 20:59:54] [INFO ] Flatten gal took : 63 ms
[2023-03-16 20:59:54] [INFO ] Time to serialize gal into /tmp/LTL1258976949511052911.gal : 11 ms
[2023-03-16 20:59:54] [INFO ] Time to serialize properties into /tmp/LTL464312806595180127.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1258976949511052911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL464312806595180127.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((malicious_reservoir>=1)&&(s4_2>=1))||((malicious_reservoir>=1)&&(s4_0>=1)))||(((malicious_reservoir>=1)&&(s4_10>=1))||((...1256
Formula 0 simplified : F!"(((((((malicious_reservoir>=1)&&(s4_2>=1))||((malicious_reservoir>=1)&&(s4_0>=1)))||(((malicious_reservoir>=1)&&(s4_10>=1))||((ma...1246
Detected timeout of ITS tools.
[2023-03-16 21:00:09] [INFO ] Flatten gal took : 60 ms
[2023-03-16 21:00:09] [INFO ] Applying decomposition
[2023-03-16 21:00:09] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14690853691904961203.txt' '-o' '/tmp/graph14690853691904961203.bin' '-w' '/tmp/graph14690853691904961203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14690853691904961203.bin' '-l' '-1' '-v' '-w' '/tmp/graph14690853691904961203.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:00:10] [INFO ] Decomposing Gal with order
[2023-03-16 21:00:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:00:10] [INFO ] Removed a total of 319 redundant transitions.
[2023-03-16 21:00:10] [INFO ] Flatten gal took : 465 ms
[2023-03-16 21:00:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 140 ms.
[2023-03-16 21:00:10] [INFO ] Time to serialize gal into /tmp/LTL5500036386840709744.gal : 28 ms
[2023-03-16 21:00:10] [INFO ] Time to serialize properties into /tmp/LTL3539132228764830187.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5500036386840709744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3539132228764830187.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((u0.malicious_reservoir>=1)&&(i33.u29.s4_2>=1))||((u0.malicious_reservoir>=1)&&(i52.u118.s4_0>=1)))||(((u0.malicious_rese...1594
Formula 0 simplified : F!"(((((((u0.malicious_reservoir>=1)&&(i33.u29.s4_2>=1))||((u0.malicious_reservoir>=1)&&(i52.u118.s4_0>=1)))||(((u0.malicious_reserv...1584
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7920988802942997860
[2023-03-16 21:00:26] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7920988802942997860
Running compilation step : cd /tmp/ltsmin7920988802942997860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1747 ms.
Running link step : cd /tmp/ltsmin7920988802942997860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7920988802942997860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 159170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.9 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2904 transition count 442
Applied a total of 4 rules in 652 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-16 21:00:41] [INFO ] Computed 2464 place invariants in 30 ms
[2023-03-16 21:00:45] [INFO ] Implicit Places using invariants in 3766 ms returned []
[2023-03-16 21:00:45] [INFO ] Invariant cache hit.
[2023-03-16 21:00:52] [INFO ] Implicit Places using invariants and state equation in 7205 ms returned [1967, 1968, 1970, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2607, 2608, 2609, 2610, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2825]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 10974 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 210 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11839 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s140 1) (LT s2742 1)) (OR (LT s154 1) (LT s2732 1)) (OR (LT s156 1) (LT s2758 1)) (OR (LT s165 1) (LT s2751 1)) (OR (LT s139 1) (LT s2733 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5335 reset in 729 ms.
Product exploration explored 100000 steps with 5232 reset in 719 ms.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 316 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 442 rows 2846 cols
[2023-03-16 21:00:55] [INFO ] Computed 2408 place invariants in 512 ms
[2023-03-16 21:00:56] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 488 ms returned sat
[2023-03-16 21:00:56] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:00:57] [INFO ] [Nat]Absence check using 0 positive and 2408 generalized place invariants in 486 ms returned sat
[2023-03-16 21:00:58] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:00:58] [INFO ] After 1036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-16 21:00:58] [INFO ] After 1887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 439 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-16 21:00:59] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 299 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-05 finished in 19698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(!p1 U (p2||G(!p1)))))))'
Support contains 929 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 97 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 21:01:00] [INFO ] Computed 2492 place invariants in 36 ms
[2023-03-16 21:01:03] [INFO ] Implicit Places using invariants in 3008 ms returned []
[2023-03-16 21:01:03] [INFO ] Invariant cache hit.
[2023-03-16 21:01:09] [INFO ] Implicit Places using invariants and state equation in 5631 ms returned []
Implicit Place search using SMT with State Equation took 8641 ms to find 0 implicit places.
[2023-03-16 21:01:09] [INFO ] Invariant cache hit.
[2023-03-16 21:01:10] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9794 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-06 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=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s1837 1) (GEQ s1838 1) (GEQ s1839 1) (GEQ s1841 1) (GEQ s1842 1) (GEQ s1843 1) (GEQ s1844 1) (GEQ s1845 1) (GEQ s1846 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 72 steps with 2 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-06 finished in 10000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 30 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.10 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
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 2903 transition count 441
Applied a total of 5 rules in 433 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-16 21:01:11] [INFO ] Computed 2464 place invariants in 33 ms
[2023-03-16 21:01:15] [INFO ] Implicit Places using invariants in 4120 ms returned []
[2023-03-16 21:01:15] [INFO ] Invariant cache hit.
[2023-03-16 21:01:22] [INFO ] Implicit Places using invariants and state equation in 7446 ms returned [1966, 1967, 1969, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2606, 2607, 2608, 2609, 2810, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2824]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11569 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 201 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12205 ms. Remains : 2845/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-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 s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s17 1)) (A...], 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 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-07 finished in 12291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(X(F(p1)))))))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 204 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 21:01:23] [INFO ] Computed 2492 place invariants in 42 ms
[2023-03-16 21:01:27] [INFO ] Implicit Places using invariants in 4269 ms returned []
[2023-03-16 21:01:27] [INFO ] Invariant cache hit.
[2023-03-16 21:01:35] [INFO ] Implicit Places using invariants and state equation in 7632 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11907 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 200 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12311 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 7}]], initial=8, aps=[p1:(GEQ s104 1), p0:(LT s86 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]]
Product exploration explored 100000 steps with 3023 reset in 316 ms.
Product exploration explored 100000 steps with 3019 reset in 320 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 300 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 905708 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 905708 steps, saw 115282 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-16 21:01:40] [INFO ] Computed 2464 place invariants in 286 ms
[2023-03-16 21:01:41] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 477 ms returned sat
[2023-03-16 21:01:42] [INFO ] After 922ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-16 21:01:42] [INFO ] After 1129ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-16 21:01:43] [INFO ] After 2224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-16 21:01:43] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 509 ms returned sat
[2023-03-16 21:01:45] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:01:45] [INFO ] After 1479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-16 21:01:45] [INFO ] After 2783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 65 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 329 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 195 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-16 21:01:46] [INFO ] Invariant cache hit.
[2023-03-16 21:01:50] [INFO ] Implicit Places using invariants in 4001 ms returned []
[2023-03-16 21:01:50] [INFO ] Invariant cache hit.
[2023-03-16 21:01:58] [INFO ] Implicit Places using invariants and state equation in 7709 ms returned []
Implicit Place search using SMT with State Equation took 11712 ms to find 0 implicit places.
[2023-03-16 21:01:58] [INFO ] Invariant cache hit.
[2023-03-16 21:01:59] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12955 ms. Remains : 2907/2907 places, 446/446 transitions.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 985104 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 985104 steps, saw 125215 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 21:02:03] [INFO ] Invariant cache hit.
[2023-03-16 21:02:04] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 502 ms returned sat
[2023-03-16 21:02:05] [INFO ] After 928ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-16 21:02:05] [INFO ] After 1125ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-16 21:02:05] [INFO ] After 2210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-16 21:02:06] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 512 ms returned sat
[2023-03-16 21:02:07] [INFO ] After 1099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:02:08] [INFO ] After 1482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-16 21:02:08] [INFO ] After 2781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3024 reset in 281 ms.
Product exploration explored 100000 steps with 3021 reset in 303 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2036 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.12 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1979 transition count 330
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1979 transition count 330
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 1979 transition count 332
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 117 rules in 464 ms. Remains 1979 /2907 variables (removed 928) and now considering 332/446 (removed 114) transitions.
[2023-03-16 21:02:10] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 332 rows 1979 cols
[2023-03-16 21:02:10] [INFO ] Computed 1652 place invariants in 12 ms
[2023-03-16 21:02:11] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1979/2907 places, 332/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1182 ms. Remains : 1979/2907 places, 332/446 transitions.
Built C files in :
/tmp/ltsmin13168254829928120709
[2023-03-16 21:02:11] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13168254829928120709
Running compilation step : cd /tmp/ltsmin13168254829928120709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1763 ms.
Running link step : cd /tmp/ltsmin13168254829928120709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13168254829928120709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6900711750170269903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 136 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-16 21:02:27] [INFO ] Computed 2464 place invariants in 287 ms
[2023-03-16 21:02:30] [INFO ] Implicit Places using invariants in 4201 ms returned []
[2023-03-16 21:02:30] [INFO ] Invariant cache hit.
[2023-03-16 21:02:37] [INFO ] Implicit Places using invariants and state equation in 6966 ms returned []
Implicit Place search using SMT with State Equation took 11171 ms to find 0 implicit places.
[2023-03-16 21:02:37] [INFO ] Invariant cache hit.
[2023-03-16 21:02:38] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12338 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin13147713610398204243
[2023-03-16 21:02:39] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13147713610398204243
Running compilation step : cd /tmp/ltsmin13147713610398204243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1772 ms.
Running link step : cd /tmp/ltsmin13147713610398204243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13147713610398204243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17484973092734572442.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 21:02:54] [INFO ] Flatten gal took : 58 ms
[2023-03-16 21:02:54] [INFO ] Flatten gal took : 56 ms
[2023-03-16 21:02:54] [INFO ] Time to serialize gal into /tmp/LTL2080932266127160524.gal : 9 ms
[2023-03-16 21:02:54] [INFO ] Time to serialize properties into /tmp/LTL12583867596092712233.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2080932266127160524.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18014569801552065278.hoa' '-atoms' '/tmp/LTL12583867596092712233.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12583867596092712233.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18014569801552065278.hoa
Detected timeout of ITS tools.
[2023-03-16 21:03:09] [INFO ] Flatten gal took : 56 ms
[2023-03-16 21:03:09] [INFO ] Flatten gal took : 56 ms
[2023-03-16 21:03:09] [INFO ] Time to serialize gal into /tmp/LTL5683937385279885603.gal : 9 ms
[2023-03-16 21:03:09] [INFO ] Time to serialize properties into /tmp/LTL7496934964660854081.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5683937385279885603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7496934964660854081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(s4_1<1)"))||(X(X(X(X(F("(s4_14>=1)"))))))))
Formula 0 simplified : F!"(s4_1<1)" & XXXXG!"(s4_14>=1)"
Detected timeout of ITS tools.
[2023-03-16 21:03:24] [INFO ] Flatten gal took : 62 ms
[2023-03-16 21:03:24] [INFO ] Applying decomposition
[2023-03-16 21:03:24] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7864582559731868737.txt' '-o' '/tmp/graph7864582559731868737.bin' '-w' '/tmp/graph7864582559731868737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7864582559731868737.bin' '-l' '-1' '-v' '-w' '/tmp/graph7864582559731868737.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:03:24] [INFO ] Decomposing Gal with order
[2023-03-16 21:03:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:03:25] [INFO ] Removed a total of 289 redundant transitions.
[2023-03-16 21:03:25] [INFO ] Flatten gal took : 166 ms
[2023-03-16 21:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 65 ms.
[2023-03-16 21:03:25] [INFO ] Time to serialize gal into /tmp/LTL2049507334166224343.gal : 23 ms
[2023-03-16 21:03:25] [INFO ] Time to serialize properties into /tmp/LTL11762322509663846180.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2049507334166224343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11762322509663846180.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(i37.i0.u32.s4_1<1)"))||(X(X(X(X(F("(i22.i0.u41.s4_14>=1)"))))))))
Formula 0 simplified : F!"(i37.i0.u32.s4_1<1)" & XXXXG!"(i22.i0.u41.s4_14>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15701459220314860620
[2023-03-16 21:03:40] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15701459220314860620
Running compilation step : cd /tmp/ltsmin15701459220314860620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1707 ms.
Running link step : cd /tmp/ltsmin15701459220314860620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15701459220314860620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X(X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 152371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||F(p1)))))'
Support contains 62 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 140 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 21:03:55] [INFO ] Computed 2492 place invariants in 35 ms
[2023-03-16 21:03:59] [INFO ] Implicit Places using invariants in 4067 ms returned []
[2023-03-16 21:03:59] [INFO ] Invariant cache hit.
[2023-03-16 21:04:06] [INFO ] Implicit Places using invariants and state equation in 6791 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 10861 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2936 places, 446/446 transitions.
Applied a total of 0 rules in 141 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11143 ms. Remains : 2908/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (AND (GEQ s67 1) (GEQ s1909 1) (GEQ s1948 1) (GEQ s1972 1) (GEQ s2000 1) (GEQ s2031 1) (GEQ s2062 1) (GEQ s2098 1) (GEQ s2135 1) (GEQ s2162 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-09 finished in 11354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 144 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-16 21:04:06] [INFO ] Invariant cache hit.
[2023-03-16 21:04:10] [INFO ] Implicit Places using invariants in 3881 ms returned []
[2023-03-16 21:04:10] [INFO ] Invariant cache hit.
[2023-03-16 21:04:17] [INFO ] Implicit Places using invariants and state equation in 6574 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10458 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 147 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10750 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s0 1) (LT s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 469 steps with 14 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-10 finished in 10927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(X(G(p2)))))&&p0)))'
Support contains 4 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 143 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-16 21:04:17] [INFO ] Invariant cache hit.
[2023-03-16 21:04:21] [INFO ] Implicit Places using invariants in 3962 ms returned []
[2023-03-16 21:04:21] [INFO ] Invariant cache hit.
[2023-03-16 21:04:29] [INFO ] Implicit Places using invariants and state equation in 7418 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11385 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 149 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11677 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=4, aps=[p0:(AND (GEQ s0 1) (GEQ s41 1)), p1:(GEQ s213 1), p2:(GEQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-11 finished in 11890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((p1&&(p2 U p3)))))'
Support contains 34 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2936 transition count 446
Applied a total of 2 rules in 328 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 21:04:29] [INFO ] Computed 2492 place invariants in 35 ms
[2023-03-16 21:04:33] [INFO ] Implicit Places using invariants in 3949 ms returned []
[2023-03-16 21:04:33] [INFO ] Invariant cache hit.
[2023-03-16 21:04:40] [INFO ] Implicit Places using invariants and state equation in 6391 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10345 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 168 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10841 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s213 1) (AND (GEQ s0 1) (GEQ s152 1))), p3:(AND (GEQ s217 1) (GEQ s2876 1) (GEQ s2879 1) (GEQ s2880 1) (GEQ s2881 1) (GEQ s2882 1) (GEQ s2883 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-14 finished in 10999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 143 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 21:04:40] [INFO ] Computed 2492 place invariants in 40 ms
[2023-03-16 21:04:44] [INFO ] Implicit Places using invariants in 4189 ms returned []
[2023-03-16 21:04:44] [INFO ] Invariant cache hit.
[2023-03-16 21:04:52] [INFO ] Implicit Places using invariants and state equation in 7215 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11407 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 144 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11695 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s212 1), p1:(GEQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-15 finished in 11801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-28-LTLFireability-04
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.13 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2904 transition count 442
Applied a total of 5 rules in 319 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-16 21:04:52] [INFO ] Computed 2464 place invariants in 32 ms
[2023-03-16 21:04:56] [INFO ] Implicit Places using invariants in 3917 ms returned []
[2023-03-16 21:04:56] [INFO ] Invariant cache hit.
[2023-03-16 21:05:05] [INFO ] Implicit Places using invariants and state equation in 8351 ms returned [1966, 1967, 1969, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12274 ms to find 29 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2875/2936 places, 442/446 transitions.
Applied a total of 0 rules in 160 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12753 ms. Remains : 2875/2936 places, 442/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s211 1), p0:(OR (AND (GEQ s0 1) (GEQ s85 1)) (AND (GEQ s0 1) (GEQ s83 1)) (AND (GEQ s0 1) (GEQ s92 1)) (AND (GEQ s0 1) (GEQ s93 1)) (AND (GEQ s0 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7414 reset in 462 ms.
Product exploration explored 100000 steps with 7466 reset in 483 ms.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 335 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
// Phase 1: matrix 442 rows 2875 cols
[2023-03-16 21:05:07] [INFO ] Computed 2436 place invariants in 140 ms
[2023-03-16 21:05:12] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 4088 ms returned sat
[2023-03-16 21:05:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 21:05:22] [INFO ] [Real]Absence check using state equation in 9862 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2875 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Applied a total of 0 rules in 158 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-16 21:05:22] [INFO ] Invariant cache hit.
[2023-03-16 21:05:26] [INFO ] Implicit Places using invariants in 3845 ms returned []
[2023-03-16 21:05:26] [INFO ] Invariant cache hit.
[2023-03-16 21:05:35] [INFO ] Implicit Places using invariants and state equation in 8549 ms returned []
Implicit Place search using SMT with State Equation took 12396 ms to find 0 implicit places.
[2023-03-16 21:05:35] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-16 21:05:35] [INFO ] Invariant cache hit.
[2023-03-16 21:05:36] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13564 ms. Remains : 2875/2875 places, 442/442 transitions.
Computed a total of 2875 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2875 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
[2023-03-16 21:05:37] [INFO ] Invariant cache hit.
[2023-03-16 21:05:42] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 4373 ms returned sat
[2023-03-16 21:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 21:05:52] [INFO ] [Real]Absence check using state equation in 9587 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7405 reset in 423 ms.
Product exploration explored 100000 steps with 7450 reset in 434 ms.
Built C files in :
/tmp/ltsmin12146484142488702440
[2023-03-16 21:05:53] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2023-03-16 21:05:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:05:53] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2023-03-16 21:05:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:05:53] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2023-03-16 21:05:53] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:05:53] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12146484142488702440
Running compilation step : cd /tmp/ltsmin12146484142488702440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2054 ms.
Running link step : cd /tmp/ltsmin12146484142488702440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12146484142488702440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13571075316582239946.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 2875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2875/2875 places, 442/442 transitions.
Graph (complete) has 29901 edges and 2875 vertex of which 2034 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.9 ms
Discarding 841 places :
Also discarding 0 output transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1977 transition count 328
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1977 transition count 328
Applied a total of 115 rules in 166 ms. Remains 1977 /2875 variables (removed 898) and now considering 328/442 (removed 114) transitions.
// Phase 1: matrix 328 rows 1977 cols
[2023-03-16 21:06:08] [INFO ] Computed 1652 place invariants in 18 ms
[2023-03-16 21:06:10] [INFO ] Implicit Places using invariants in 2155 ms returned []
[2023-03-16 21:06:10] [INFO ] Invariant cache hit.
[2023-03-16 21:06:13] [INFO ] Implicit Places using invariants and state equation in 3558 ms returned []
Implicit Place search using SMT with State Equation took 5715 ms to find 0 implicit places.
[2023-03-16 21:06:13] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-16 21:06:13] [INFO ] Invariant cache hit.
[2023-03-16 21:06:14] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1977/2875 places, 328/442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6553 ms. Remains : 1977/2875 places, 328/442 transitions.
Built C files in :
/tmp/ltsmin4951838243135365898
[2023-03-16 21:06:14] [INFO ] Computing symmetric may disable matrix : 328 transitions.
[2023-03-16 21:06:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:06:14] [INFO ] Computing symmetric may enable matrix : 328 transitions.
[2023-03-16 21:06:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:06:14] [INFO ] Computing Do-Not-Accords matrix : 328 transitions.
[2023-03-16 21:06:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:06:14] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4951838243135365898
Running compilation step : cd /tmp/ltsmin4951838243135365898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1355 ms.
Running link step : cd /tmp/ltsmin4951838243135365898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4951838243135365898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6856835776526853581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 21:06:29] [INFO ] Flatten gal took : 42 ms
[2023-03-16 21:06:29] [INFO ] Flatten gal took : 38 ms
[2023-03-16 21:06:29] [INFO ] Time to serialize gal into /tmp/LTL11453401589090322142.gal : 5 ms
[2023-03-16 21:06:29] [INFO ] Time to serialize properties into /tmp/LTL15075358859005447030.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11453401589090322142.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5571684744542527646.hoa' '-atoms' '/tmp/LTL15075358859005447030.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15075358859005447030.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5571684744542527646.hoa
Detected timeout of ITS tools.
[2023-03-16 21:06:44] [INFO ] Flatten gal took : 53 ms
[2023-03-16 21:06:44] [INFO ] Flatten gal took : 53 ms
[2023-03-16 21:06:44] [INFO ] Time to serialize gal into /tmp/LTL16602499165489504788.gal : 7 ms
[2023-03-16 21:06:44] [INFO ] Time to serialize properties into /tmp/LTL11507747785145264310.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16602499165489504788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11507747785145264310.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((malicious_reservoir>=1)&&(s4_2>=1))||((malicious_reservoir>=1)&&(s4_0>=1)))||(((malicious_reservoir>=1)&&(s4_10>=1))||((...1256
Formula 0 simplified : F!"(((((((malicious_reservoir>=1)&&(s4_2>=1))||((malicious_reservoir>=1)&&(s4_0>=1)))||(((malicious_reservoir>=1)&&(s4_10>=1))||((ma...1246
Detected timeout of ITS tools.
[2023-03-16 21:07:00] [INFO ] Flatten gal took : 56 ms
[2023-03-16 21:07:00] [INFO ] Applying decomposition
[2023-03-16 21:07:00] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16022772241515323860.txt' '-o' '/tmp/graph16022772241515323860.bin' '-w' '/tmp/graph16022772241515323860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16022772241515323860.bin' '-l' '-1' '-v' '-w' '/tmp/graph16022772241515323860.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:07:00] [INFO ] Decomposing Gal with order
[2023-03-16 21:07:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:07:00] [INFO ] Removed a total of 319 redundant transitions.
[2023-03-16 21:07:00] [INFO ] Flatten gal took : 154 ms
[2023-03-16 21:07:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 49 ms.
[2023-03-16 21:07:00] [INFO ] Time to serialize gal into /tmp/LTL4327771071000942684.gal : 16 ms
[2023-03-16 21:07:00] [INFO ] Time to serialize properties into /tmp/LTL15306947093533833806.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4327771071000942684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15306947093533833806.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((u0.malicious_reservoir>=1)&&(i36.u115.s4_2>=1))||((u0.malicious_reservoir>=1)&&(i31.u29.s4_0>=1)))||(((u0.malicious_rese...1590
Formula 0 simplified : F!"(((((((u0.malicious_reservoir>=1)&&(i36.u115.s4_2>=1))||((u0.malicious_reservoir>=1)&&(i31.u29.s4_0>=1)))||(((u0.malicious_reserv...1580
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13401804961309235478
[2023-03-16 21:07:15] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13401804961309235478
Running compilation step : cd /tmp/ltsmin13401804961309235478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1705 ms.
Running link step : cd /tmp/ltsmin13401804961309235478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13401804961309235478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 158307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(X(F(p1)))))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-28-LTLFireability-08
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.10 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2007 transition count 329
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2007 transition count 329
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 119 place count 2005 transition count 327
Applied a total of 119 rules in 250 ms. Remains 2005 /2936 variables (removed 931) and now considering 327/446 (removed 119) transitions.
// Phase 1: matrix 327 rows 2005 cols
[2023-03-16 21:07:31] [INFO ] Computed 1680 place invariants in 17 ms
[2023-03-16 21:07:33] [INFO ] Implicit Places using invariants in 2112 ms returned []
[2023-03-16 21:07:33] [INFO ] Invariant cache hit.
[2023-03-16 21:07:39] [INFO ] Implicit Places using invariants and state equation in 5581 ms returned [1068, 1069, 1071, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1708, 1709, 1710, 1711, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1926]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 7696 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1947/2936 places, 327/446 transitions.
Applied a total of 0 rules in 87 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8033 ms. Remains : 1947/2936 places, 327/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 7}]], initial=8, aps=[p1:(GEQ s47 1), p0:(LT s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2815 reset in 301 ms.
Product exploration explored 100000 steps with 2814 reset in 321 ms.
Computed a total of 1947 stabilizing places and 327 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1947 transition count 327
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 p0), true, (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 237 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1224571 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :{}
Probabilistic random walk after 1224571 steps, saw 157015 distinct states, run finished after 3003 ms. (steps per millisecond=407 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 327 rows 1947 cols
[2023-03-16 21:07:43] [INFO ] Computed 1624 place invariants in 24 ms
[2023-03-16 21:07:44] [INFO ] [Real]Absence check using 0 positive and 1624 generalized place invariants in 297 ms returned sat
[2023-03-16 21:07:44] [INFO ] After 564ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-16 21:07:44] [INFO ] After 699ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-16 21:07:45] [INFO ] After 1403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-16 21:07:45] [INFO ] [Nat]Absence check using 0 positive and 1624 generalized place invariants in 285 ms returned sat
[2023-03-16 21:07:46] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:07:46] [INFO ] After 878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-16 21:07:46] [INFO ] After 1711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 4 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 1021 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1947/1947 places, 327/327 transitions.
Applied a total of 0 rules in 72 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-16 21:07:48] [INFO ] Invariant cache hit.
[2023-03-16 21:07:50] [INFO ] Implicit Places using invariants in 2040 ms returned []
[2023-03-16 21:07:50] [INFO ] Invariant cache hit.
[2023-03-16 21:07:53] [INFO ] Implicit Places using invariants and state equation in 3323 ms returned []
Implicit Place search using SMT with State Equation took 5364 ms to find 0 implicit places.
[2023-03-16 21:07:53] [INFO ] Invariant cache hit.
[2023-03-16 21:07:54] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6029 ms. Remains : 1947/1947 places, 327/327 transitions.
Computed a total of 1947 stabilizing places and 327 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1947 transition count 327
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), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1210635 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :{}
Probabilistic random walk after 1210635 steps, saw 155175 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 21:07:57] [INFO ] Invariant cache hit.
[2023-03-16 21:07:58] [INFO ] [Real]Absence check using 0 positive and 1624 generalized place invariants in 294 ms returned sat
[2023-03-16 21:07:59] [INFO ] After 552ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-16 21:07:59] [INFO ] After 685ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-16 21:07:59] [INFO ] After 1387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-16 21:07:59] [INFO ] [Nat]Absence check using 0 positive and 1624 generalized place invariants in 291 ms returned sat
[2023-03-16 21:08:00] [INFO ] After 627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:08:00] [INFO ] After 897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-16 21:08:01] [INFO ] After 1720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2812 reset in 317 ms.
Product exploration explored 100000 steps with 2813 reset in 333 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1947/1947 places, 327/327 transitions.
Applied a total of 0 rules in 89 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-16 21:08:03] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-16 21:08:03] [INFO ] Invariant cache hit.
[2023-03-16 21:08:03] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 742 ms. Remains : 1947/1947 places, 327/327 transitions.
Built C files in :
/tmp/ltsmin9864863257233408422
[2023-03-16 21:08:03] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9864863257233408422
Running compilation step : cd /tmp/ltsmin9864863257233408422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1151 ms.
Running link step : cd /tmp/ltsmin9864863257233408422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9864863257233408422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6280246838586865529.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1947/1947 places, 327/327 transitions.
Applied a total of 0 rules in 72 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-16 21:08:18] [INFO ] Invariant cache hit.
[2023-03-16 21:08:21] [INFO ] Implicit Places using invariants in 2072 ms returned []
[2023-03-16 21:08:21] [INFO ] Invariant cache hit.
[2023-03-16 21:08:25] [INFO ] Implicit Places using invariants and state equation in 3997 ms returned []
Implicit Place search using SMT with State Equation took 6070 ms to find 0 implicit places.
[2023-03-16 21:08:25] [INFO ] Invariant cache hit.
[2023-03-16 21:08:25] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6748 ms. Remains : 1947/1947 places, 327/327 transitions.
Built C files in :
/tmp/ltsmin14926168803764865833
[2023-03-16 21:08:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14926168803764865833
Running compilation step : cd /tmp/ltsmin14926168803764865833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1159 ms.
Running link step : cd /tmp/ltsmin14926168803764865833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14926168803764865833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17245584846292837454.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 21:08:40] [INFO ] Flatten gal took : 36 ms
[2023-03-16 21:08:40] [INFO ] Flatten gal took : 36 ms
[2023-03-16 21:08:40] [INFO ] Time to serialize gal into /tmp/LTL17413439317002260306.gal : 5 ms
[2023-03-16 21:08:40] [INFO ] Time to serialize properties into /tmp/LTL16671941908888968130.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17413439317002260306.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6229217343723840606.hoa' '-atoms' '/tmp/LTL16671941908888968130.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16671941908888968130.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6229217343723840606.hoa
Detected timeout of ITS tools.
[2023-03-16 21:08:55] [INFO ] Flatten gal took : 37 ms
[2023-03-16 21:08:55] [INFO ] Flatten gal took : 36 ms
[2023-03-16 21:08:55] [INFO ] Time to serialize gal into /tmp/LTL15295596865718575852.gal : 8 ms
[2023-03-16 21:08:55] [INFO ] Time to serialize properties into /tmp/LTL17427089438879550119.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15295596865718575852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17427089438879550119.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(s4_1<1)"))||(X(X(X(X(F("(s4_14>=1)"))))))))
Formula 0 simplified : F!"(s4_1<1)" & XXXXG!"(s4_14>=1)"
Detected timeout of ITS tools.
[2023-03-16 21:09:11] [INFO ] Flatten gal took : 41 ms
[2023-03-16 21:09:11] [INFO ] Applying decomposition
[2023-03-16 21:09:11] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8738194027478258260.txt' '-o' '/tmp/graph8738194027478258260.bin' '-w' '/tmp/graph8738194027478258260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8738194027478258260.bin' '-l' '-1' '-v' '-w' '/tmp/graph8738194027478258260.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:09:11] [INFO ] Decomposing Gal with order
[2023-03-16 21:09:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:09:11] [INFO ] Removed a total of 262 redundant transitions.
[2023-03-16 21:09:11] [INFO ] Flatten gal took : 70 ms
[2023-03-16 21:09:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 18 ms.
[2023-03-16 21:09:11] [INFO ] Time to serialize gal into /tmp/LTL5798882458133090901.gal : 10 ms
[2023-03-16 21:09:11] [INFO ] Time to serialize properties into /tmp/LTL3317300143943670000.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5798882458133090901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3317300143943670000.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(i5.u4.s4_1<1)"))||(X(X(X(X(F("(i10.u15.s4_14>=1)"))))))))
Formula 0 simplified : F!"(i5.u4.s4_1<1)" & XXXXG!"(i10.u15.s4_14>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18209643578981384386
[2023-03-16 21:09:26] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18209643578981384386
Running compilation step : cd /tmp/ltsmin18209643578981384386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1168 ms.
Running link step : cd /tmp/ltsmin18209643578981384386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18209643578981384386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X(X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 130850 ms.
[2023-03-16 21:09:41] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15647592449731338201
[2023-03-16 21:09:41] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2023-03-16 21:09:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:09:41] [INFO ] Applying decomposition
[2023-03-16 21:09:41] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2023-03-16 21:09:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:09:41] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2023-03-16 21:09:41] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:09:41] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15647592449731338201
Running compilation step : cd /tmp/ltsmin15647592449731338201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 21:09:41] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9377543800090369695.txt' '-o' '/tmp/graph9377543800090369695.bin' '-w' '/tmp/graph9377543800090369695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9377543800090369695.bin' '-l' '-1' '-v' '-w' '/tmp/graph9377543800090369695.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:09:41] [INFO ] Decomposing Gal with order
[2023-03-16 21:09:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:09:42] [INFO ] Removed a total of 289 redundant transitions.
[2023-03-16 21:09:42] [INFO ] Flatten gal took : 165 ms
[2023-03-16 21:09:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 59 ms.
[2023-03-16 21:09:42] [INFO ] Time to serialize gal into /tmp/LTLFireability10495945470555668091.gal : 31 ms
[2023-03-16 21:09:42] [INFO ] Time to serialize properties into /tmp/LTLFireability6139804475583698796.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10495945470555668091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6139804475583698796.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((G("(((((((u0.malicious_reservoir>=1)&&(i57.i1.u172.s4_2>=1))||((u0.malicious_reservoir>=1)&&(i49.i1.u64.s4_0>=1)))||(((u0.maliciou...1657
Formula 0 simplified : F!"(((((((u0.malicious_reservoir>=1)&&(i57.i1.u172.s4_2>=1))||((u0.malicious_reservoir>=1)&&(i49.i1.u64.s4_0>=1)))||(((u0.malicious_...1647
Compilation finished in 2109 ms.
Running link step : cd /tmp/ltsmin15647592449731338201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15647592449731338201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: LTL layer: formula: ([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))
pins2lts-mc-linux64( 4/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.050: "([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.055: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.092: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.384: DFS-FIFO for weak LTL, using special progress label 451
pins2lts-mc-linux64( 0/ 8), 0.384: There are 452 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.384: State length is 2937, there are 451 groups
pins2lts-mc-linux64( 0/ 8), 0.384: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.384: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.384: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.384: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.503: ~18 levels ~960 states ~3624 transitions
pins2lts-mc-linux64( 3/ 8), 0.560: ~18 levels ~1920 states ~5000 transitions
pins2lts-mc-linux64( 7/ 8), 0.657: ~18 levels ~3840 states ~8224 transitions
pins2lts-mc-linux64( 7/ 8), 0.873: ~18 levels ~7680 states ~14528 transitions
pins2lts-mc-linux64( 1/ 8), 1.163: ~18 levels ~15360 states ~29920 transitions
pins2lts-mc-linux64( 1/ 8), 1.937: ~18 levels ~30720 states ~62392 transitions
pins2lts-mc-linux64( 1/ 8), 3.518: ~18 levels ~61440 states ~142344 transitions
pins2lts-mc-linux64( 1/ 8), 6.687: ~18 levels ~122880 states ~303968 transitions
pins2lts-mc-linux64( 6/ 8), 12.704: ~18 levels ~245760 states ~671632 transitions
pins2lts-mc-linux64( 6/ 8), 24.755: ~18 levels ~491520 states ~1431840 transitions
pins2lts-mc-linux64( 6/ 8), 48.659: ~18 levels ~983040 states ~3115416 transitions
pins2lts-mc-linux64( 6/ 8), 96.935: ~18 levels ~1966080 states ~6884640 transitions
pins2lts-mc-linux64( 1/ 8), 193.759: ~18 levels ~3932160 states ~14715488 transitions
pins2lts-mc-linux64( 3/ 8), 392.526: ~18 levels ~7864320 states ~32147008 transitions
pins2lts-mc-linux64( 5/ 8), 419.182: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 419.382:
pins2lts-mc-linux64( 0/ 8), 419.382: mean standard work distribution: 5.6% (states) 5.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 419.382:
pins2lts-mc-linux64( 0/ 8), 419.382: Explored 8154514 states 33152248 transitions, fanout: 4.066
pins2lts-mc-linux64( 0/ 8), 419.382: Total exploration time 418.980 sec (418.790 sec minimum, 418.856 sec on average)
pins2lts-mc-linux64( 0/ 8), 419.382: States per second: 19463, Transitions per second: 79126
pins2lts-mc-linux64( 0/ 8), 419.382:
pins2lts-mc-linux64( 0/ 8), 419.382: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 419.382: Redundant explorations: -0.0230
pins2lts-mc-linux64( 0/ 8), 419.382:
pins2lts-mc-linux64( 0/ 8), 419.382: Queue width: 8B, total height: 152, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 419.382: Tree memory: 318.2MB, 40.9 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 419.382: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 419.382: Stored 448 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 419.382: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 419.382: Est. total memory use: 318.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15647592449731338201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15647592449731338201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 21:34:30] [INFO ] Flatten gal took : 533 ms
[2023-03-16 21:34:31] [INFO ] Time to serialize gal into /tmp/LTLFireability13160066972360075903.gal : 59 ms
[2023-03-16 21:34:31] [INFO ] Time to serialize properties into /tmp/LTLFireability16907164279091137141.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13160066972360075903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16907164279091137141.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !(((G("(((((((malicious_reservoir>=1)&&(s4_2>=1))||((malicious_reservoir>=1)&&(s4_0>=1)))||(((malicious_reservoir>=1)&&(s4_10>=1))||((...1256
Formula 0 simplified : F!"(((((((malicious_reservoir>=1)&&(s4_2>=1))||((malicious_reservoir>=1)&&(s4_0>=1)))||(((malicious_reservoir>=1)&&(s4_10>=1))||((ma...1246
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 135852 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12683072 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-28"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;