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.r297-tall-167873951100900.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 ltsminxred
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 r297-tall-167873951100900
=====================================================================

--------------------
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 1679675884927

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 16:38:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 16:38:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 16:38:06] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-24 16:38:06] [INFO ] Transformed 2998 places.
[2023-03-24 16:38:06] [INFO ] Transformed 446 transitions.
[2023-03-24 16:38:06] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 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 144 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 16:38:07] [INFO ] Computed 2492 place invariants in 115 ms
[2023-03-24 16:38:10] [INFO ] Implicit Places using invariants in 2728 ms returned []
[2023-03-24 16:38:10] [INFO ] Invariant cache hit.
[2023-03-24 16:38:14] [INFO ] Implicit Places using invariants and state equation in 3876 ms returned []
Implicit Place search using SMT with State Equation took 6647 ms to find 0 implicit places.
[2023-03-24 16:38:14] [INFO ] Invariant cache hit.
[2023-03-24 16:38:15] [INFO ] Dead Transitions using invariants and state equation in 1313 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 8111 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2010 out of 2936 places after structural reductions.
[2023-03-24 16:38:15] [INFO ] Flatten gal took : 186 ms
[2023-03-24 16:38:15] [INFO ] Flatten gal took : 124 ms
[2023-03-24 16:38:16] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 27) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 25 ms. (steps per millisecond=40 ) 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 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 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 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 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 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 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 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 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
Running SMT prover for 19 properties.
[2023-03-24 16:38:17] [INFO ] Invariant cache hit.
[2023-03-24 16:38:19] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 677 ms returned sat
[2023-03-24 16:38:19] [INFO ] After 2062ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-24 16:38:21] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 602 ms returned sat
[2023-03-24 16:38:26] [INFO ] After 4407ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-24 16:38:30] [INFO ] After 8450ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 2579 ms.
[2023-03-24 16:38:33] [INFO ] After 13696ms 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 167 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Parikh walk visited 17 properties in 80 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.33 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 578 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-24 16:38:34] [INFO ] Computed 2464 place invariants in 63 ms
[2023-03-24 16:38:38] [INFO ] Implicit Places using invariants in 4560 ms returned []
[2023-03-24 16:38:38] [INFO ] Invariant cache hit.
[2023-03-24 16:38:47] [INFO ] Implicit Places using invariants and state equation in 9249 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 13813 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 194 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 14585 ms. Remains : 2845/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 287 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 34 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-01 finished in 14949 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.11 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 0 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 242 ms. Remains 2036 /2936 variables (removed 900) and now considering 330/446 (removed 116) transitions.
// Phase 1: matrix 330 rows 2036 cols
[2023-03-24 16:38:48] [INFO ] Computed 1708 place invariants in 12 ms
[2023-03-24 16:38:50] [INFO ] Implicit Places using invariants in 1731 ms returned []
[2023-03-24 16:38:50] [INFO ] Invariant cache hit.
[2023-03-24 16:38:56] [INFO ] Implicit Places using invariants and state equation in 5671 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 7405 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 68 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 7716 ms. Remains : 1978/2936 places, 330/446 transitions.
Stuttering acceptance computed with spot in 175 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 68 steps with 1 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-02 finished in 7920 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 196 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 16:38:56] [INFO ] Computed 2492 place invariants in 36 ms
[2023-03-24 16:39:01] [INFO ] Implicit Places using invariants in 4653 ms returned []
[2023-03-24 16:39:01] [INFO ] Invariant cache hit.
[2023-03-24 16:39:09] [INFO ] Implicit Places using invariants and state equation in 7788 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 12460 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 230 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 12887 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 324 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 3021 reset in 665 ms.
Product exploration explored 100000 steps with 3029 reset in 643 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 294 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 145 ms :[(NOT p1), (AND p1 p0), true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 565467 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 565467 steps, saw 72910 distinct states, run finished after 3002 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-24 16:39:15] [INFO ] Computed 2464 place invariants in 339 ms
[2023-03-24 16:39:17] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 581 ms returned sat
[2023-03-24 16:39:18] [INFO ] After 2532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 16:39:19] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 603 ms returned sat
[2023-03-24 16:39:29] [INFO ] After 9202ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-24 16:39:38] [INFO ] After 19104ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 4486 ms.
[2023-03-24 16:39:43] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 123 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=15 )
Parikh walk visited 4 properties in 7 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 161 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 47308 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 202 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 16:39:43] [INFO ] Computed 2492 place invariants in 55 ms
[2023-03-24 16:39:48] [INFO ] Implicit Places using invariants in 4623 ms returned []
[2023-03-24 16:39:48] [INFO ] Invariant cache hit.
[2023-03-24 16:39:56] [INFO ] Implicit Places using invariants and state equation in 7963 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 12596 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 202 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 13002 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 104 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 7393 reset in 625 ms.
Product exploration explored 100000 steps with 7427 reset in 590 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 346 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 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
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 398 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 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
// Phase 1: matrix 446 rows 2907 cols
[2023-03-24 16:39:59] [INFO ] Computed 2464 place invariants in 339 ms
[2023-03-24 16:40:06] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 5438 ms returned sat
[2023-03-24 16:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:40:14] [INFO ] [Real]Absence check using state equation in 8323 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.8 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 455 ms. Remains 2875 /2907 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2875 cols
[2023-03-24 16:40:15] [INFO ] Computed 2436 place invariants in 151 ms
[2023-03-24 16:40:19] [INFO ] Implicit Places using invariants in 4374 ms returned []
[2023-03-24 16:40:19] [INFO ] Invariant cache hit.
[2023-03-24 16:40:29] [INFO ] Implicit Places using invariants and state equation in 9678 ms returned []
Implicit Place search using SMT with State Equation took 14061 ms to find 0 implicit places.
[2023-03-24 16:40:29] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-24 16:40:29] [INFO ] Invariant cache hit.
[2023-03-24 16:40:30] [INFO ] Dead Transitions using invariants and state equation in 1244 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 15826 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 145 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 30 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 159 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 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
[2023-03-24 16:40:31] [INFO ] Invariant cache hit.
[2023-03-24 16:40:37] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 4371 ms returned sat
[2023-03-24 16:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:40:46] [INFO ] [Real]Absence check using state equation in 9519 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7452 reset in 540 ms.
Product exploration explored 100000 steps with 7411 reset in 563 ms.
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.6 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 226 ms. Remains 1977 /2875 variables (removed 898) and now considering 328/442 (removed 114) transitions.
// Phase 1: matrix 328 rows 1977 cols
[2023-03-24 16:40:48] [INFO ] Computed 1652 place invariants in 22 ms
[2023-03-24 16:40:50] [INFO ] Implicit Places using invariants in 2773 ms returned []
[2023-03-24 16:40:50] [INFO ] Invariant cache hit.
[2023-03-24 16:40:55] [INFO ] Implicit Places using invariants and state equation in 4427 ms returned []
Implicit Place search using SMT with State Equation took 7203 ms to find 0 implicit places.
[2023-03-24 16:40:55] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-24 16:40:55] [INFO ] Invariant cache hit.
[2023-03-24 16:40:56] [INFO ] Dead Transitions using invariants and state equation in 783 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 8253 ms. Remains : 1977/2875 places, 328/442 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 72601 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.6 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 0 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 651 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-24 16:40:56] [INFO ] Computed 2464 place invariants in 26 ms
[2023-03-24 16:41:01] [INFO ] Implicit Places using invariants in 4467 ms returned []
[2023-03-24 16:41:01] [INFO ] Invariant cache hit.
[2023-03-24 16:41:09] [INFO ] Implicit Places using invariants and state equation in 7901 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 12372 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 208 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 13233 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 109 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 5217 reset in 859 ms.
Product exploration explored 100000 steps with 5260 reset in 796 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 359 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 98 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 280 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 442 rows 2846 cols
[2023-03-24 16:41:12] [INFO ] Computed 2408 place invariants in 540 ms
[2023-03-24 16:41:13] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 574 ms returned sat
[2023-03-24 16:41:13] [INFO ] After 951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 16:41:14] [INFO ] [Nat]Absence check using 0 positive and 2408 generalized place invariants in 561 ms returned sat
[2023-03-24 16:41:15] [INFO ] After 1004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 16:41:15] [INFO ] After 1137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-24 16:41:16] [INFO ] After 2180ms 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 1 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 409 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 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-24 16:41:16] [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 364 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 22146 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 108 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 16:41:18] [INFO ] Computed 2492 place invariants in 36 ms
[2023-03-24 16:41:21] [INFO ] Implicit Places using invariants in 3266 ms returned []
[2023-03-24 16:41:21] [INFO ] Invariant cache hit.
[2023-03-24 16:41:27] [INFO ] Implicit Places using invariants and state equation in 6086 ms returned []
Implicit Place search using SMT with State Equation took 9353 ms to find 0 implicit places.
[2023-03-24 16:41:27] [INFO ] Invariant cache hit.
[2023-03-24 16:41:29] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10737 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 127 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 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-06 finished in 10895 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.8 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 417 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-24 16:41:29] [INFO ] Computed 2464 place invariants in 32 ms
[2023-03-24 16:41:34] [INFO ] Implicit Places using invariants in 4589 ms returned []
[2023-03-24 16:41:34] [INFO ] Invariant cache hit.
[2023-03-24 16:41:42] [INFO ] Implicit Places using invariants and state equation in 7767 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 12364 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 207 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 12988 ms. Remains : 2845/2936 places, 441/446 transitions.
Stuttering acceptance computed with spot in 78 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 13080 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 202 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 16:41:42] [INFO ] Computed 2492 place invariants in 39 ms
[2023-03-24 16:41:47] [INFO ] Implicit Places using invariants in 4590 ms returned []
[2023-03-24 16:41:47] [INFO ] Invariant cache hit.
[2023-03-24 16:41:55] [INFO ] Implicit Places using invariants and state equation in 7899 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 12492 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 12896 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 301 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 363 ms.
Product exploration explored 100000 steps with 3026 reset in 355 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 256 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 227 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 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 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 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 815627 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 815627 steps, saw 104051 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-24 16:42:00] [INFO ] Computed 2464 place invariants in 291 ms
[2023-03-24 16:42:01] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 582 ms returned sat
[2023-03-24 16:42:03] [INFO ] After 1071ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-24 16:42:03] [INFO ] After 1269ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-24 16:42:03] [INFO ] After 2439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-24 16:42:04] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 581 ms returned sat
[2023-03-24 16:42:05] [INFO ] After 1241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 16:42:06] [INFO ] After 1633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-24 16:42:06] [INFO ] After 3088ms 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 321 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 283 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 212 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 214 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-24 16:42:07] [INFO ] Invariant cache hit.
[2023-03-24 16:42:12] [INFO ] Implicit Places using invariants in 4771 ms returned []
[2023-03-24 16:42:12] [INFO ] Invariant cache hit.
[2023-03-24 16:42:20] [INFO ] Implicit Places using invariants and state equation in 8528 ms returned []
Implicit Place search using SMT with State Equation took 13309 ms to find 0 implicit places.
[2023-03-24 16:42:20] [INFO ] Invariant cache hit.
[2023-03-24 16:42:22] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14804 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 167 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 222 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 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 878431 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 878431 steps, saw 111573 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-24 16:42:26] [INFO ] Invariant cache hit.
[2023-03-24 16:42:27] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 601 ms returned sat
[2023-03-24 16:42:28] [INFO ] After 1105ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-24 16:42:28] [INFO ] After 1308ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-24 16:42:28] [INFO ] After 2601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-24 16:42:29] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 578 ms returned sat
[2023-03-24 16:42:31] [INFO ] After 1209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 16:42:31] [INFO ] After 1598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 234 ms.
[2023-03-24 16:42:31] [INFO ] After 3038ms 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 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 4 properties in 3 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 341 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 222 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))]
Stuttering acceptance computed with spot in 221 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 320 ms.
Product exploration explored 100000 steps with 3024 reset in 329 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 232 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.5 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 566 ms. Remains 1979 /2907 variables (removed 928) and now considering 332/446 (removed 114) transitions.
[2023-03-24 16:42:34] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 332 rows 1979 cols
[2023-03-24 16:42:34] [INFO ] Computed 1652 place invariants in 17 ms
[2023-03-24 16:42:35] [INFO ] Dead Transitions using invariants and state equation in 831 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 1444 ms. Remains : 1979/2907 places, 332/446 transitions.
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 169 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2023-03-24 16:42:35] [INFO ] Computed 2464 place invariants in 318 ms
[2023-03-24 16:42:40] [INFO ] Implicit Places using invariants in 4581 ms returned []
[2023-03-24 16:42:40] [INFO ] Invariant cache hit.
[2023-03-24 16:42:47] [INFO ] Implicit Places using invariants and state equation in 7462 ms returned []
Implicit Place search using SMT with State Equation took 12048 ms to find 0 implicit places.
[2023-03-24 16:42:47] [INFO ] Invariant cache hit.
[2023-03-24 16:42:48] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13457 ms. Remains : 2907/2907 places, 446/446 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 66483 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 167 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 16:42:49] [INFO ] Computed 2492 place invariants in 28 ms
[2023-03-24 16:42:53] [INFO ] Implicit Places using invariants in 4369 ms returned []
[2023-03-24 16:42:53] [INFO ] Invariant cache hit.
[2023-03-24 16:43:00] [INFO ] Implicit Places using invariants and state equation in 7447 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 11822 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 131 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 12120 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 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-09 finished in 12323 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 134 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-24 16:43:01] [INFO ] Invariant cache hit.
[2023-03-24 16:43:05] [INFO ] Implicit Places using invariants in 4543 ms returned []
[2023-03-24 16:43:05] [INFO ] Invariant cache hit.
[2023-03-24 16:43:13] [INFO ] Implicit Places using invariants and state equation in 7394 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 11940 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 129 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 12203 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 146 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 134 steps with 4 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-10 finished in 12375 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 135 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-24 16:43:13] [INFO ] Invariant cache hit.
[2023-03-24 16:43:18] [INFO ] Implicit Places using invariants in 4492 ms returned []
[2023-03-24 16:43:18] [INFO ] Invariant cache hit.
[2023-03-24 16:43:25] [INFO ] Implicit Places using invariants and state equation in 7439 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 11934 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 133 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 12203 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 185 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 12423 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 302 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 16:43:26] [INFO ] Computed 2492 place invariants in 36 ms
[2023-03-24 16:43:30] [INFO ] Implicit Places using invariants in 4501 ms returned []
[2023-03-24 16:43:30] [INFO ] Invariant cache hit.
[2023-03-24 16:43:38] [INFO ] Implicit Places using invariants and state equation in 7508 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 12021 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 175 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 12500 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 133 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 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-14 finished in 12654 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 151 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-24 16:43:38] [INFO ] Computed 2492 place invariants in 39 ms
[2023-03-24 16:43:43] [INFO ] Implicit Places using invariants in 4804 ms returned []
[2023-03-24 16:43:43] [INFO ] Invariant cache hit.
[2023-03-24 16:43:51] [INFO ] Implicit Places using invariants and state equation in 7932 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 12739 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 133 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 13023 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 81 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 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-15 finished in 13119 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 94 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.11 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 2904 transition count 442
Applied a total of 5 rules in 307 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2023-03-24 16:43:52] [INFO ] Computed 2464 place invariants in 36 ms
[2023-03-24 16:43:56] [INFO ] Implicit Places using invariants in 4723 ms returned []
[2023-03-24 16:43:56] [INFO ] Invariant cache hit.
[2023-03-24 16:44:05] [INFO ] Implicit Places using invariants and state equation in 8921 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 13645 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 147 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 14099 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 7401 reset in 598 ms.
Product exploration explored 100000 steps with 7454 reset in 665 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 371 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 78 ms :[(NOT p1), (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 : [(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 353 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 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
// Phase 1: matrix 442 rows 2875 cols
[2023-03-24 16:44:08] [INFO ] Computed 2436 place invariants in 166 ms
[2023-03-24 16:44:14] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 4614 ms returned sat
[2023-03-24 16:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:44:23] [INFO ] [Real]Absence check using state equation in 9200 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 145 ms. Remains 2875 /2875 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-24 16:44:24] [INFO ] Invariant cache hit.
[2023-03-24 16:44:28] [INFO ] Implicit Places using invariants in 4400 ms returned []
[2023-03-24 16:44:28] [INFO ] Invariant cache hit.
[2023-03-24 16:44:37] [INFO ] Implicit Places using invariants and state equation in 9263 ms returned []
Implicit Place search using SMT with State Equation took 13666 ms to find 0 implicit places.
[2023-03-24 16:44:37] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-24 16:44:37] [INFO ] Invariant cache hit.
[2023-03-24 16:44:38] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15045 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 153 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 35 ms :[(NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 170 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 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
[2023-03-24 16:44:39] [INFO ] Invariant cache hit.
[2023-03-24 16:44:44] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3800 ms returned sat
[2023-03-24 16:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:44:54] [INFO ] [Real]Absence check using state equation in 10193 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7442 reset in 538 ms.
Product exploration explored 100000 steps with 7450 reset in 558 ms.
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.13 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 157 ms. Remains 1977 /2875 variables (removed 898) and now considering 328/442 (removed 114) transitions.
// Phase 1: matrix 328 rows 1977 cols
[2023-03-24 16:44:56] [INFO ] Computed 1652 place invariants in 14 ms
[2023-03-24 16:44:58] [INFO ] Implicit Places using invariants in 2426 ms returned []
[2023-03-24 16:44:58] [INFO ] Invariant cache hit.
[2023-03-24 16:45:03] [INFO ] Implicit Places using invariants and state equation in 4486 ms returned []
Implicit Place search using SMT with State Equation took 6918 ms to find 0 implicit places.
[2023-03-24 16:45:03] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-24 16:45:03] [INFO ] Invariant cache hit.
[2023-03-24 16:45:03] [INFO ] Dead Transitions using invariants and state equation in 744 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 7854 ms. Remains : 1977/2875 places, 328/442 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 72131 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 343 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.6 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 1 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 243 ms. Remains 2005 /2936 variables (removed 931) and now considering 327/446 (removed 119) transitions.
// Phase 1: matrix 327 rows 2005 cols
[2023-03-24 16:45:04] [INFO ] Computed 1680 place invariants in 18 ms
[2023-03-24 16:45:07] [INFO ] Implicit Places using invariants in 2691 ms returned []
[2023-03-24 16:45:07] [INFO ] Invariant cache hit.
[2023-03-24 16:45:13] [INFO ] Implicit Places using invariants and state equation in 6505 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 9197 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 79 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 9521 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 2813 reset in 335 ms.
Product exploration explored 100000 steps with 2813 reset in 356 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 308 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 194 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 280 resets, run finished after 241 ms. (steps per millisecond=41 ) 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 13 ms. (steps per millisecond=769 ) 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 1366640 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :{}
Probabilistic random walk after 1366640 steps, saw 175895 distinct states, run finished after 3001 ms. (steps per millisecond=455 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 327 rows 1947 cols
[2023-03-24 16:45:18] [INFO ] Computed 1624 place invariants in 14 ms
[2023-03-24 16:45:19] [INFO ] [Real]Absence check using 0 positive and 1624 generalized place invariants in 341 ms returned sat
[2023-03-24 16:45:20] [INFO ] After 625ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-24 16:45:20] [INFO ] After 756ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-24 16:45:20] [INFO ] After 1580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-24 16:45:20] [INFO ] [Nat]Absence check using 0 positive and 1624 generalized place invariants in 339 ms returned sat
[2023-03-24 16:45:21] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 16:45:21] [INFO ] After 962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-24 16:45:22] [INFO ] After 1905ms 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 4 properties in 4 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 3 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 292 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 210 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 207 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 65 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-24 16:45:22] [INFO ] Invariant cache hit.
[2023-03-24 16:45:25] [INFO ] Implicit Places using invariants in 2234 ms returned []
[2023-03-24 16:45:25] [INFO ] Invariant cache hit.
[2023-03-24 16:45:28] [INFO ] Implicit Places using invariants and state equation in 3510 ms returned []
Implicit Place search using SMT with State Equation took 5747 ms to find 0 implicit places.
[2023-03-24 16:45:28] [INFO ] Invariant cache hit.
[2023-03-24 16:45:29] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6565 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 159 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 276 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 283 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 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 8 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 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1124402 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :{}
Probabilistic random walk after 1124402 steps, saw 143518 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-24 16:45:33] [INFO ] Invariant cache hit.
[2023-03-24 16:45:34] [INFO ] [Real]Absence check using 0 positive and 1624 generalized place invariants in 348 ms returned sat
[2023-03-24 16:45:34] [INFO ] After 634ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-24 16:45:34] [INFO ] After 783ms 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-24 16:45:35] [INFO ] After 1586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-24 16:45:35] [INFO ] [Nat]Absence check using 0 positive and 1624 generalized place invariants in 341 ms returned sat
[2023-03-24 16:45:36] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 16:45:36] [INFO ] After 955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-24 16:45:36] [INFO ] After 1891ms 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 62 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=31 )
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 234 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 175 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 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 185 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 2814 reset in 344 ms.
Product exploration explored 100000 steps with 2814 reset in 364 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 212 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 85 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-24 16:45:38] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-24 16:45:38] [INFO ] Invariant cache hit.
[2023-03-24 16:45:39] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 878 ms. Remains : 1947/1947 places, 327/327 transitions.
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 64 ms. Remains 1947 /1947 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-24 16:45:39] [INFO ] Invariant cache hit.
[2023-03-24 16:45:42] [INFO ] Implicit Places using invariants in 2399 ms returned []
[2023-03-24 16:45:42] [INFO ] Invariant cache hit.
[2023-03-24 16:45:46] [INFO ] Implicit Places using invariants and state equation in 4371 ms returned []
Implicit Place search using SMT with State Equation took 6772 ms to find 0 implicit places.
[2023-03-24 16:45:46] [INFO ] Invariant cache hit.
[2023-03-24 16:45:47] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7575 ms. Remains : 1947/1947 places, 327/327 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 43380 ms.
[2023-03-24 16:45:47] [INFO ] Flatten gal took : 79 ms
[2023-03-24 16:45:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-24 16:45:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2936 places, 446 transitions and 6222 arcs took 7 ms.
Total runtime 460775 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2154/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2154/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-PT-28-LTLFireability-04
Could not compute solution for formula : QuasiCertifProtocol-PT-28-LTLFireability-08

BK_STOP 1679676349829

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name QuasiCertifProtocol-PT-28-LTLFireability-04
ltl formula formula --ltl=/tmp/2154/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2936 places, 446 transitions and 6222 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2154/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2154/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2154/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2154/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name QuasiCertifProtocol-PT-28-LTLFireability-08
ltl formula formula --ltl=/tmp/2154/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2936 places, 446 transitions and 6222 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2154/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2154/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2154/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2154/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="ltsminxred"
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 ltsminxred"
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 r297-tall-167873951100900"
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 ;