Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 03:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716765969850

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-26 23:26:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 23:26:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:26:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 23:26:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 23:26:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 787 ms
[2024-05-26 23:26:12] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 23:26:12] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-26 23:26:12] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 260 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 23:26:13] [INFO ] Computed 5 invariants in 3 ms
[2024-05-26 23:26:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-26 23:26:13] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:8
[2024-05-26 23:26:13] [INFO ] After 149ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:8
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-26 23:26:13] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:8
[2024-05-26 23:26:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:26:13] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-26 23:26:13] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-26 23:26:13] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 10 different solutions.
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=68 )
Parikh walk visited 12 properties in 11 ms.
[2024-05-26 23:26:13] [INFO ] Flatten gal took : 27 ms
[2024-05-26 23:26:13] [INFO ] Flatten gal took : 6 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2024-05-26 23:26:13] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 25 ms.
[2024-05-26 23:26:13] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 2820 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 24 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-26 23:26:14] [INFO ] Computed 2492 invariants in 158 ms
[2024-05-26 23:26:15] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-26 23:26:15] [INFO ] Invariant cache hit.
[2024-05-26 23:26:17] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 3044 ms to find 0 implicit places.
[2024-05-26 23:26:17] [INFO ] Invariant cache hit.
[2024-05-26 23:26:18] [INFO ] Dead Transitions using invariants and state equation in 1074 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 4149 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2820 out of 2936 places after structural reductions.
[2024-05-26 23:26:18] [INFO ] Flatten gal took : 214 ms
[2024-05-26 23:26:19] [INFO ] Flatten gal took : 143 ms
[2024-05-26 23:26:19] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2024-05-26 23:26:20] [INFO ] Invariant cache hit.
[2024-05-26 23:26:22] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 546 ms returned sat
[2024-05-26 23:26:22] [INFO ] After 1872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-26 23:26:24] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 537 ms returned sat
[2024-05-26 23:26:36] [INFO ] After 11306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-26 23:26:47] [INFO ] After 22310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-26 23:26:47] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 18 Parikh solutions to 17 different solutions.
Finished Parikh walk after 210 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=30 )
Parikh walk visited 18 properties in 37 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 30 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 413 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:26:48] [INFO ] Invariant cache hit.
[2024-05-26 23:26:52] [INFO ] Implicit Places using invariants in 4163 ms returned []
[2024-05-26 23:26:52] [INFO ] Invariant cache hit.
[2024-05-26 23:27:00] [INFO ] Implicit Places using invariants and state equation in 8045 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12215 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 189 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 12818 ms. Remains : 2907/2936 places, 446/446 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s2754 1)) (AND (GEQ s0 1) (GEQ s2755 1)) (AND (GEQ s0 1) (GEQ s2752 1)) (AND (GEQ s0 1) (GEQ s2753 1)) (AND (GEQ s0 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1459 ms.
Product exploration explored 100000 steps with 50000 reset in 1395 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 : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-00 finished in 16374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Support contains 1740 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 38 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:27:04] [INFO ] Invariant cache hit.
[2024-05-26 23:27:06] [INFO ] Implicit Places using invariants in 1648 ms returned []
[2024-05-26 23:27:06] [INFO ] Invariant cache hit.
[2024-05-26 23:27:09] [INFO ] Implicit Places using invariants and state equation in 3623 ms returned []
Implicit Place search using SMT with State Equation took 5275 ms to find 0 implicit places.
[2024-05-26 23:27:09] [INFO ] Invariant cache hit.
[2024-05-26 23:27:10] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6411 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s1161 1) (GEQ s1162 1) (GEQ s1163 1) (GEQ s1164 1) (GEQ s1165 1) (GEQ s1166 1) (GEQ s1167 1) (GEQ s1168 1) (GEQ s1169 1) (GEQ s1170 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-01 finished in 6764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||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 169 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:27:11] [INFO ] Invariant cache hit.
[2024-05-26 23:27:15] [INFO ] Implicit Places using invariants in 4088 ms returned []
[2024-05-26 23:27:15] [INFO ] Invariant cache hit.
[2024-05-26 23:27:23] [INFO ] Implicit Places using invariants and state equation in 8348 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12444 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 140 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 12753 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s2905 1), p0:(GEQ s2903 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 7429 reset in 400 ms.
Product exploration explored 100000 steps with 7456 reset in 445 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)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 446 rows 2907 cols
[2024-05-26 23:27:26] [INFO ] Computed 2464 invariants in 291 ms
[2024-05-26 23:27:30] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 3153 ms returned sat
[2024-05-26 23:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:27:41] [INFO ] [Real]Absence check using state equation in 11028 ms returned unknown
Could not prove EG (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 137 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:27:41] [INFO ] Invariant cache hit.
[2024-05-26 23:27:45] [INFO ] Implicit Places using invariants in 4098 ms returned []
[2024-05-26 23:27:45] [INFO ] Invariant cache hit.
[2024-05-26 23:27:53] [INFO ] Implicit Places using invariants and state equation in 7489 ms returned []
Implicit Place search using SMT with State Equation took 11590 ms to find 0 implicit places.
[2024-05-26 23:27:53] [INFO ] Invariant cache hit.
[2024-05-26 23:27:54] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12741 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) (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 292 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-26 23:27:55] [INFO ] Invariant cache hit.
[2024-05-26 23:27:59] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 3147 ms returned sat
[2024-05-26 23:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:28:10] [INFO ] [Real]Absence check using state equation in 11055 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7414 reset in 399 ms.
Product exploration explored 100000 steps with 7450 reset in 412 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (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 179 are kept as prefixes of interest. Removing 2728 places using SCC suffix rule.23 ms
Discarding 2728 places :
Also discarding 178 output transitions
Drop transitions removed 178 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 179 transition count 124
Applied a total of 145 rules in 39 ms. Remains 179 /2907 variables (removed 2728) and now considering 124/446 (removed 322) transitions.
[2024-05-26 23:28:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 124 rows 179 cols
[2024-05-26 23:28:11] [INFO ] Computed 56 invariants in 0 ms
[2024-05-26 23:28:11] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/2907 places, 124/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 179/2907 places, 124/446 transitions.
Built C files in :
/tmp/ltsmin435633348168261843
[2024-05-26 23:28:11] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin435633348168261843
Running compilation step : cd /tmp/ltsmin435633348168261843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1841 ms.
Running link step : cd /tmp/ltsmin435633348168261843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin435633348168261843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18421260522176177997.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 136 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-26 23:28:27] [INFO ] Computed 2464 invariants in 277 ms
[2024-05-26 23:28:31] [INFO ] Implicit Places using invariants in 4610 ms returned []
[2024-05-26 23:28:31] [INFO ] Invariant cache hit.
[2024-05-26 23:28:39] [INFO ] Implicit Places using invariants and state equation in 7759 ms returned []
Implicit Place search using SMT with State Equation took 12372 ms to find 0 implicit places.
[2024-05-26 23:28:39] [INFO ] Invariant cache hit.
[2024-05-26 23:28:40] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13600 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin3140678043913777381
[2024-05-26 23:28:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3140678043913777381
Running compilation step : cd /tmp/ltsmin3140678043913777381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1890 ms.
Running link step : cd /tmp/ltsmin3140678043913777381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3140678043913777381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12538808898692278854.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:28:55] [INFO ] Flatten gal took : 81 ms
[2024-05-26 23:28:55] [INFO ] Flatten gal took : 78 ms
[2024-05-26 23:28:55] [INFO ] Time to serialize gal into /tmp/LTL10838422752939004490.gal : 18 ms
[2024-05-26 23:28:55] [INFO ] Time to serialize properties into /tmp/LTL17299626038939250121.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10838422752939004490.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10280197995820200520.hoa' '-atoms' '/tmp/LTL17299626038939250121.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17299626038939250121.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10280197995820200520.hoa
Detected timeout of ITS tools.
[2024-05-26 23:29:11] [INFO ] Flatten gal took : 73 ms
[2024-05-26 23:29:11] [INFO ] Flatten gal took : 71 ms
[2024-05-26 23:29:11] [INFO ] Time to serialize gal into /tmp/LTL17111201622606659381.gal : 11 ms
[2024-05-26 23:29:11] [INFO ] Time to serialize properties into /tmp/LTL5473172495563246374.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17111201622606659381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5473172495563246374.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("(a3_0>=1)"))||(F("(a1_0>=1)"))))
Formula 0 simplified : X!"(a3_0>=1)" & G!"(a1_0>=1)"
Detected timeout of ITS tools.
[2024-05-26 23:29:26] [INFO ] Flatten gal took : 64 ms
[2024-05-26 23:29:26] [INFO ] Applying decomposition
[2024-05-26 23:29:26] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13773752104724564309.txt' '-o' '/tmp/graph13773752104724564309.bin' '-w' '/tmp/graph13773752104724564309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13773752104724564309.bin' '-l' '-1' '-v' '-w' '/tmp/graph13773752104724564309.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:29:26] [INFO ] Decomposing Gal with order
[2024-05-26 23:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:29:27] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-26 23:29:27] [INFO ] Flatten gal took : 389 ms
[2024-05-26 23:29:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 138 ms.
[2024-05-26 23:29:27] [INFO ] Time to serialize gal into /tmp/LTL15803460590681833010.gal : 30 ms
[2024-05-26 23:29:27] [INFO ] Time to serialize properties into /tmp/LTL16098472267612160924.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15803460590681833010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16098472267612160924.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X("(i22.u170.a3_0>=1)"))||(F("(i22.u171.a1_0>=1)"))))
Formula 0 simplified : X!"(i22.u170.a3_0>=1)" & G!"(i22.u171.a1_0>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7115479799826496199
[2024-05-26 23:29:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7115479799826496199
Running compilation step : cd /tmp/ltsmin7115479799826496199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1716 ms.
Running link step : cd /tmp/ltsmin7115479799826496199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7115479799826496199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-02 finished in 166219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 871 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 209 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-26 23:29:57] [INFO ] Computed 2492 invariants in 49 ms
[2024-05-26 23:30:01] [INFO ] Implicit Places using invariants in 3478 ms returned []
[2024-05-26 23:30:01] [INFO ] Invariant cache hit.
[2024-05-26 23:30:06] [INFO ] Implicit Places using invariants and state equation in 5663 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 9145 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 73 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 9428 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s12 1) (GEQ s41 1) (GEQ s70 1) (GEQ s99 1) (GEQ s128 1) (GEQ s157 1) (GEQ s186 1) (GEQ s215 1) (GEQ s244 1) (GEQ s273 1) (GEQ s302 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-03 finished in 9563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||G(F(p2))))))'
Support contains 1741 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 31 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:30:07] [INFO ] Invariant cache hit.
[2024-05-26 23:30:09] [INFO ] Implicit Places using invariants in 2610 ms returned []
[2024-05-26 23:30:09] [INFO ] Invariant cache hit.
[2024-05-26 23:30:14] [INFO ] Implicit Places using invariants and state equation in 4628 ms returned []
Implicit Place search using SMT with State Equation took 7240 ms to find 0 implicit places.
[2024-05-26 23:30:14] [INFO ] Invariant cache hit.
[2024-05-26 23:30:15] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8298 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s2935 1), p2:(OR (AND (GEQ s1691 1) (GEQ s1720 1) (GEQ s1749 1) (GEQ s1778 1) (GEQ s1807 1) (GEQ s1836 1) (GEQ s1865 1) (GEQ s1894 1) (GEQ s1923 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2011 steps with 60 reset in 17 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-04 finished in 8541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1 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 135 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:30:15] [INFO ] Invariant cache hit.
[2024-05-26 23:30:19] [INFO ] Implicit Places using invariants in 4064 ms returned []
[2024-05-26 23:30:19] [INFO ] Invariant cache hit.
[2024-05-26 23:30:27] [INFO ] Implicit Places using invariants and state equation in 7180 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11256 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 140 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 11532 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s2813 1)) (AND (GEQ s0 1) (GEQ s2812 1)) (AND (GEQ s0 1) (GEQ s2810 1)) (AND (GEQ s0 1) (GEQ s2811 1)) (AND (GEQ s0 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3024 reset in 436 ms.
Product exploration explored 100000 steps with 3025 reset in 406 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), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7296 steps, run visited all 2 properties in 88 ms. (steps per millisecond=82 )
Probabilistic random walk after 7296 steps, saw 7147 distinct states, run finished after 89 ms. (steps per millisecond=81 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 132 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 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 137 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-26 23:30:29] [INFO ] Computed 2464 invariants in 244 ms
[2024-05-26 23:30:33] [INFO ] Implicit Places using invariants in 4166 ms returned []
[2024-05-26 23:30:33] [INFO ] Invariant cache hit.
[2024-05-26 23:30:41] [INFO ] Implicit Places using invariants and state equation in 7687 ms returned []
Implicit Place search using SMT with State Equation took 11858 ms to find 0 implicit places.
[2024-05-26 23:30:41] [INFO ] Invariant cache hit.
[2024-05-26 23:30:42] [INFO ] Dead Transitions using invariants and state equation in 1011 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13009 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), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) 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 2) seen :0
Finished probabilistic random walk after 7296 steps, run visited all 2 properties in 77 ms. (steps per millisecond=94 )
Probabilistic random walk after 7296 steps, saw 7147 distinct states, run finished after 78 ms. (steps per millisecond=93 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 101 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 181 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 3022 reset in 393 ms.
Product exploration explored 100000 steps with 3024 reset in 406 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 117 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 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 2877 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.27 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2877 transition count 446
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 377 ms. Remains 2877 /2907 variables (removed 30) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:30:45] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 446 rows 2877 cols
[2024-05-26 23:30:45] [INFO ] Computed 2436 invariants in 259 ms
[2024-05-26 23:30:46] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2907 places, 446/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1700 ms. Remains : 2877/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin15770589988097375132
[2024-05-26 23:30:46] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15770589988097375132
Running compilation step : cd /tmp/ltsmin15770589988097375132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1715 ms.
Running link step : cd /tmp/ltsmin15770589988097375132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15770589988097375132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6884762378383514924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 59 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 135 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-26 23:31:02] [INFO ] Computed 2464 invariants in 289 ms
[2024-05-26 23:31:06] [INFO ] Implicit Places using invariants in 4432 ms returned []
[2024-05-26 23:31:06] [INFO ] Invariant cache hit.
[2024-05-26 23:31:14] [INFO ] Implicit Places using invariants and state equation in 8204 ms returned []
Implicit Place search using SMT with State Equation took 12642 ms to find 0 implicit places.
[2024-05-26 23:31:14] [INFO ] Invariant cache hit.
[2024-05-26 23:31:15] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13855 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin10573484380532050507
[2024-05-26 23:31:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10573484380532050507
Running compilation step : cd /tmp/ltsmin10573484380532050507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1793 ms.
Running link step : cd /tmp/ltsmin10573484380532050507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10573484380532050507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1341886023627693864.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:31:30] [INFO ] Flatten gal took : 64 ms
[2024-05-26 23:31:31] [INFO ] Flatten gal took : 60 ms
[2024-05-26 23:31:31] [INFO ] Time to serialize gal into /tmp/LTL11986851002102476148.gal : 12 ms
[2024-05-26 23:31:31] [INFO ] Time to serialize properties into /tmp/LTL18177779355188226040.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11986851002102476148.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4864286211559697214.hoa' '-atoms' '/tmp/LTL18177779355188226040.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18177779355188226040.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4864286211559697214.hoa
Detected timeout of ITS tools.
[2024-05-26 23:31:46] [INFO ] Flatten gal took : 58 ms
[2024-05-26 23:31:46] [INFO ] Flatten gal took : 59 ms
[2024-05-26 23:31:46] [INFO ] Time to serialize gal into /tmp/LTL9037013407690464347.gal : 7 ms
[2024-05-26 23:31:46] [INFO ] Time to serialize properties into /tmp/LTL14974507268146963422.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9037013407690464347.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14974507268146963422.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((malicious_reservoir_0>=1)&&(s3_28>=1))||((malicious_reservoir_0>=1)&&(s3_27>=1)))||(((malicious_reservoir_0>=1)&&(s3_...2942
Formula 0 simplified : F(!"((((((s6_19<1)&&(s6_18<1))&&((s6_17<1)&&(s6_16<1)))&&(((s6_23<1)&&(s6_22<1))&&((s6_21<1)&&(s6_20<1))))&&((((s6_11<1)&&(s6_10<1))...2931
Detected timeout of ITS tools.
[2024-05-26 23:32:01] [INFO ] Flatten gal took : 59 ms
[2024-05-26 23:32:01] [INFO ] Applying decomposition
[2024-05-26 23:32:01] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10218602632210351889.txt' '-o' '/tmp/graph10218602632210351889.bin' '-w' '/tmp/graph10218602632210351889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10218602632210351889.bin' '-l' '-1' '-v' '-w' '/tmp/graph10218602632210351889.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:32:01] [INFO ] Decomposing Gal with order
[2024-05-26 23:32:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:32:01] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-26 23:32:01] [INFO ] Flatten gal took : 201 ms
[2024-05-26 23:32:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 54 ms.
[2024-05-26 23:32:02] [INFO ] Time to serialize gal into /tmp/LTL12774791086653702911.gal : 18 ms
[2024-05-26 23:32:02] [INFO ] Time to serialize properties into /tmp/LTL7805830162561870349.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12774791086653702911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7805830162561870349.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((u0.malicious_reservoir_0>=1)&&(i27.u16.s3_28>=1))||((u0.malicious_reservoir_0>=1)&&(i13.i0.u30.s3_27>=1)))||(((u0.mal...3823
Formula 0 simplified : F(!"((((((u155.s6_19<1)&&(u154.s6_18<1))&&((u153.s6_17<1)&&(u152.s6_16<1)))&&(((u159.s6_23<1)&&(u158.s6_22<1))&&((u157.s6_21<1)&&(u1...3812
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17397098833325118619
[2024-05-26 23:32:17] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17397098833325118619
Running compilation step : cd /tmp/ltsmin17397098833325118619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1729 ms.
Running link step : cd /tmp/ltsmin17397098833325118619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17397098833325118619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(((LTLAPp0==true) U [](!(LTLAPp0==true))))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-05 finished in 136567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 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 179 are kept as prefixes of interest. Removing 2757 places using SCC suffix rule.12 ms
Discarding 2757 places :
Also discarding 178 output transitions
Drop transitions removed 178 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 178 transition count 123
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 178 transition count 123
Applied a total of 146 rules in 26 ms. Remains 178 /2936 variables (removed 2758) and now considering 123/446 (removed 323) transitions.
// Phase 1: matrix 123 rows 178 cols
[2024-05-26 23:32:32] [INFO ] Computed 56 invariants in 0 ms
[2024-05-26 23:32:32] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-26 23:32:32] [INFO ] Invariant cache hit.
[2024-05-26 23:32:32] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 272 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/2936 places, 123/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 302 ms. Remains : 149/2936 places, 123/446 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s146 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2789 reset in 326 ms.
Product exploration explored 100000 steps with 2784 reset in 314 ms.
Computed a total of 149 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 149 transition count 123
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-06 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((!p0||X(G(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 165 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-26 23:32:33] [INFO ] Computed 2492 invariants in 52 ms
[2024-05-26 23:32:37] [INFO ] Implicit Places using invariants in 4299 ms returned []
[2024-05-26 23:32:37] [INFO ] Invariant cache hit.
[2024-05-26 23:32:45] [INFO ] Implicit Places using invariants and state equation in 8037 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12341 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 136 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 12643 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s2901 1), p1:(OR (LT s2582 1) (LT s2583 1) (LT s2584 1) (LT s2585 1) (LT s2586 1) (LT s2587 1) (LT s2588 1) (LT s2589 1) (LT s2590 1) (LT s2591 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-07 TRUE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-07 finished in 12764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p0)&&F(G(p1))))))'
Support contains 871 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.9 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Applied a total of 3 rules in 189 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2024-05-26 23:32:46] [INFO ] Computed 2464 invariants in 47 ms
[2024-05-26 23:32:49] [INFO ] Implicit Places using invariants in 3283 ms returned []
[2024-05-26 23:32:49] [INFO ] Invariant cache hit.
[2024-05-26 23:32:55] [INFO ] Implicit Places using invariants and state equation in 5583 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8881 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 97 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 9168 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s2844 1), p1:(OR (AND (GEQ s12 1) (GEQ s41 1) (GEQ s70 1) (GEQ s99 1) (GEQ s128 1) (GEQ s157 1) (GEQ s186 1) (GEQ s215 1) (GEQ s244 1) (GEQ s273 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-08 finished in 9333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(X(!p1))&&F(p2)))))'
Support contains 930 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 76 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-26 23:32:55] [INFO ] Computed 2492 invariants in 49 ms
[2024-05-26 23:32:58] [INFO ] Implicit Places using invariants in 3330 ms returned []
[2024-05-26 23:32:58] [INFO ] Invariant cache hit.
[2024-05-26 23:33:03] [INFO ] Implicit Places using invariants and state equation in 5075 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 8410 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 72 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 8559 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 427 ms :[(NOT p0), true, p1, (NOT p2), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0)), p1, p1, (AND (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 6}, { cond=p1, acceptance={0} source=2 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 9}, { cond=(AND p0 p1), acceptance={} source=4 dest: 10}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 3}], [{ cond=p1, acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND p0 p1), acceptance={} source=9 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=11 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s41 1) (GEQ s70 1) (GEQ s99 1) (GEQ s128 1) (GEQ s157 1) (GEQ s186 1) (GEQ s215 1) (GEQ s244 1) (GEQ s273 1) (GEQ s302 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-09 finished in 9014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 60 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 153 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:33:04] [INFO ] Invariant cache hit.
[2024-05-26 23:33:08] [INFO ] Implicit Places using invariants in 4066 ms returned []
[2024-05-26 23:33:08] [INFO ] Invariant cache hit.
[2024-05-26 23:33:16] [INFO ] Implicit Places using invariants and state equation in 7901 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11976 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 135 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 12265 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2582 1) (LT s2583 1) (LT s2584 1) (LT s2585 1) (LT s2586 1) (LT s2587 1) (LT s2588 1) (LT s2589 1) (LT s2590 1) (LT s2591 1) (LT s2592 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1329 ms.
Product exploration explored 100000 steps with 50000 reset in 1350 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 p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-10 finished in 15485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 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 180 are kept as prefixes of interest. Removing 2756 places using SCC suffix rule.5 ms
Discarding 2756 places :
Also discarding 176 output transitions
Drop transitions removed 176 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 179 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 178 transition count 123
Applied a total of 148 rules in 16 ms. Remains 178 /2936 variables (removed 2758) and now considering 123/446 (removed 323) transitions.
// Phase 1: matrix 123 rows 178 cols
[2024-05-26 23:33:19] [INFO ] Computed 56 invariants in 1 ms
[2024-05-26 23:33:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-26 23:33:20] [INFO ] Invariant cache hit.
[2024-05-26 23:33:20] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 237 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/2936 places, 123/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 256 ms. Remains : 149/2936 places, 123/446 transitions.
Stuttering acceptance computed with spot in 27 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s146 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2786 reset in 285 ms.
Product exploration explored 100000 steps with 2788 reset in 301 ms.
Computed a total of 149 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 149 transition count 123
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-13 finished in 944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U ((!p2&&X(G((!p2||G(!p0)))))||p1))))'
Support contains 929 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.10 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 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
Applied a total of 3 rules in 172 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2024-05-26 23:33:21] [INFO ] Computed 2464 invariants in 48 ms
[2024-05-26 23:33:24] [INFO ] Implicit Places using invariants in 3309 ms returned []
[2024-05-26 23:33:24] [INFO ] Invariant cache hit.
[2024-05-26 23:33:29] [INFO ] Implicit Places using invariants and state equation in 5662 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8975 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 85 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 9240 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) p2), true, (AND p0 p2), (AND (NOT p1) p2), (AND p2 p0 (NOT p1)), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s12 1) (GEQ s41 1) (GEQ s70 1) (GEQ s99 1) (GEQ s128 1) (GEQ s157 1) (GEQ s186 1) (GEQ s215 1) (GEQ s244 1) (GEQ s273 1) (GEQ s302 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2813 reset in 636 ms.
Product exploration explored 100000 steps with 2816 reset in 661 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 (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (OR p1 (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p1 (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 911 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) p2), true, (AND p0 p2), (AND (NOT p1) p2), (AND p0 p2 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 280 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 361983 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{2=1, 4=1, 6=1, 7=1, 8=1}
Probabilistic random walk after 361983 steps, saw 66139 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :5
Running SMT prover for 4 properties.
// Phase 1: matrix 442 rows 2846 cols
[2024-05-26 23:33:38] [INFO ] Computed 2408 invariants in 565 ms
[2024-05-26 23:33:39] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 482 ms returned sat
[2024-05-26 23:33:40] [INFO ] After 1708ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (OR p1 (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p1 (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 p2))), (G (OR p0 p1 (NOT p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p0) p2))]
Knowledge based reduction with 26 factoid took 2726 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND p0 p2), p0]
Stuttering acceptance computed with spot in 75 ms :[true, (AND p0 p2), p0]
Support contains 59 out of 2846 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 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 96 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-26 23:33:43] [INFO ] Invariant cache hit.
[2024-05-26 23:33:46] [INFO ] Implicit Places using invariants in 3186 ms returned []
[2024-05-26 23:33:46] [INFO ] Invariant cache hit.
[2024-05-26 23:33:52] [INFO ] Implicit Places using invariants and state equation in 5904 ms returned []
Implicit Place search using SMT with State Equation took 9095 ms to find 0 implicit places.
[2024-05-26 23:33:52] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-26 23:33:52] [INFO ] Invariant cache hit.
[2024-05-26 23:33:53] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10209 ms. Remains : 2846/2846 places, 442/442 transitions.
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 (NOT p0) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 177 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 88 ms :[true, p0, (AND p0 p2)]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 155 ms. (steps per millisecond=64 ) 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 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 604015 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 604015 steps, saw 95954 distinct states, run finished after 3002 ms. (steps per millisecond=201 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-26 23:33:57] [INFO ] Invariant cache hit.
[2024-05-26 23:33:58] [INFO ] [Real]Absence check using 0 positive and 2408 generalized place invariants in 482 ms returned sat
[2024-05-26 23:33:59] [INFO ] After 1683ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (F (G (NOT p0))), (F (G (NOT p2))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 13 factoid took 370 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 86 ms :[true, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 80 ms :[true, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 99 ms :[true, p0, (AND p0 p2)]
Product exploration explored 100000 steps with 2812 reset in 565 ms.
Product exploration explored 100000 steps with 2812 reset in 582 ms.
Built C files in :
/tmp/ltsmin3726647124220843545
[2024-05-26 23:34:00] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2024-05-26 23:34:00] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:00] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2024-05-26 23:34:01] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:01] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2024-05-26 23:34:01] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:01] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3726647124220843545
Running compilation step : cd /tmp/ltsmin3726647124220843545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2153 ms.
Running link step : cd /tmp/ltsmin3726647124220843545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3726647124220843545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17627372945368685264.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 59 out of 2846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 165 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-26 23:34:16] [INFO ] Invariant cache hit.
[2024-05-26 23:34:20] [INFO ] Implicit Places using invariants in 4050 ms returned []
[2024-05-26 23:34:20] [INFO ] Invariant cache hit.
[2024-05-26 23:34:28] [INFO ] Implicit Places using invariants and state equation in 7946 ms returned []
Implicit Place search using SMT with State Equation took 11998 ms to find 0 implicit places.
[2024-05-26 23:34:28] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-26 23:34:28] [INFO ] Invariant cache hit.
[2024-05-26 23:34:29] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13266 ms. Remains : 2846/2846 places, 442/442 transitions.
Built C files in :
/tmp/ltsmin7977908748294110778
[2024-05-26 23:34:29] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2024-05-26 23:34:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:29] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2024-05-26 23:34:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:29] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2024-05-26 23:34:29] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:29] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7977908748294110778
Running compilation step : cd /tmp/ltsmin7977908748294110778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2246 ms.
Running link step : cd /tmp/ltsmin7977908748294110778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7977908748294110778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18268791485101925478.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:34:44] [INFO ] Flatten gal took : 60 ms
[2024-05-26 23:34:44] [INFO ] Flatten gal took : 53 ms
[2024-05-26 23:34:44] [INFO ] Time to serialize gal into /tmp/LTL16373459741293541387.gal : 7 ms
[2024-05-26 23:34:44] [INFO ] Time to serialize properties into /tmp/LTL169144930853785902.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16373459741293541387.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2767558580768078924.hoa' '-atoms' '/tmp/LTL169144930853785902.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL169144930853785902.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2767558580768078924.hoa
Detected timeout of ITS tools.
[2024-05-26 23:34:59] [INFO ] Flatten gal took : 54 ms
[2024-05-26 23:34:59] [INFO ] Flatten gal took : 72 ms
[2024-05-26 23:34:59] [INFO ] Time to serialize gal into /tmp/LTL1486635949932513354.gal : 22 ms
[2024-05-26 23:34:59] [INFO ] Time to serialize properties into /tmp/LTL14881722121488642919.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1486635949932513354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14881722121488642919.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(a4_0>=1)")U(("(((((((((((n9_11>=1)&&(n9_40>=1))&&((n9_69>=1)&&(n9_98>=1)))&&(((n9_127>=1)&&(n9_156>=1))&&((n9_185>=1)&&(n9_214...15371
Formula 0 simplified : F(!"(a4_0>=1)" R (!"(((((((((((n9_11>=1)&&(n9_40>=1))&&((n9_69>=1)&&(n9_98>=1)))&&(((n9_127>=1)&&(n9_156>=1))&&((n9_185>=1)&&(n9_214...15348
Detected timeout of ITS tools.
[2024-05-26 23:35:14] [INFO ] Flatten gal took : 55 ms
[2024-05-26 23:35:14] [INFO ] Applying decomposition
[2024-05-26 23:35:14] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8326261044926159494.txt' '-o' '/tmp/graph8326261044926159494.bin' '-w' '/tmp/graph8326261044926159494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8326261044926159494.bin' '-l' '-1' '-v' '-w' '/tmp/graph8326261044926159494.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:35:15] [INFO ] Decomposing Gal with order
[2024-05-26 23:35:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:35:15] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-26 23:35:15] [INFO ] Flatten gal took : 161 ms
[2024-05-26 23:35:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 50 ms.
[2024-05-26 23:35:15] [INFO ] Time to serialize gal into /tmp/LTL1414599156063101713.gal : 15 ms
[2024-05-26 23:35:15] [INFO ] Time to serialize properties into /tmp/LTL13087656212976762818.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1414599156063101713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13087656212976762818.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i3.u117.a4_0>=1)")U(("(((((((((((u90.n9_11>=1)&&(u91.n9_40>=1))&&((u92.n9_69>=1)&&(u93.n9_98>=1)))&&(((u94.n9_127>=1)&&(u1.n9_...20712
Formula 0 simplified : F(!"(i3.u117.a4_0>=1)" R (!"(((((((((((u90.n9_11>=1)&&(u91.n9_40>=1))&&((u92.n9_69>=1)&&(u93.n9_98>=1)))&&(((u94.n9_127>=1)&&(u1.n9_...20689
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8839378604598078563
[2024-05-26 23:35:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8839378604598078563
Running compilation step : cd /tmp/ltsmin8839378604598078563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1878 ms.
Running link step : cd /tmp/ltsmin8839378604598078563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8839378604598078563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U ((!(LTLAPp2==true)&&X([]((!(LTLAPp2==true)||[](!(LTLAPp0==true))))))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-14 finished in 144750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 870 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 80 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-26 23:35:45] [INFO ] Computed 2492 invariants in 50 ms
[2024-05-26 23:35:48] [INFO ] Implicit Places using invariants in 2797 ms returned []
[2024-05-26 23:35:48] [INFO ] Invariant cache hit.
[2024-05-26 23:35:52] [INFO ] Implicit Places using invariants and state equation in 4270 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 7076 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 73 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 7229 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-15 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: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s1161 1) (GEQ s1162 1) (GEQ s1163 1) (GEQ s1164 1) (GEQ s1165 1) (GEQ s1166 1) (GEQ s1167 1) (GEQ s1168 1) (GEQ s1169 1) (GEQ s1170 1) (G...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-15 finished in 7399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1 U G(!p1))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-28-LTLFireability-05
Stuttering acceptance computed with spot in 98 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 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.19 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 324 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-26 23:35:53] [INFO ] Computed 2464 invariants in 55 ms
[2024-05-26 23:35:58] [INFO ] Implicit Places using invariants in 4503 ms returned []
[2024-05-26 23:35:58] [INFO ] Invariant cache hit.
[2024-05-26 23:36:05] [INFO ] Implicit Places using invariants and state equation in 7851 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 12358 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 151 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12834 ms. Remains : 2845/2936 places, 441/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s2755 1)) (AND (GEQ s0 1) (GEQ s2754 1)) (AND (GEQ s0 1) (GEQ s2752 1)) (AND (GEQ s0 1) (GEQ s2753 1)) (AND (GEQ s0 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2814 reset in 423 ms.
Product exploration explored 100000 steps with 2815 reset in 435 ms.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
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), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7113 steps, run visited all 2 properties in 87 ms. (steps per millisecond=81 )
Probabilistic random walk after 7113 steps, saw 6968 distinct states, run finished after 88 ms. (steps per millisecond=80 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 154 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 136 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 2845 cols
[2024-05-26 23:36:09] [INFO ] Computed 2408 invariants in 540 ms
[2024-05-26 23:36:13] [INFO ] Implicit Places using invariants in 4564 ms returned []
[2024-05-26 23:36:13] [INFO ] Invariant cache hit.
[2024-05-26 23:36:21] [INFO ] Implicit Places using invariants and state equation in 8597 ms returned []
Implicit Place search using SMT with State Equation took 13162 ms to find 0 implicit places.
[2024-05-26 23:36:21] [INFO ] Invariant cache hit.
[2024-05-26 23:36:22] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14282 ms. Remains : 2845/2845 places, 441/441 transitions.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
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), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), p1]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7113 steps, run visited all 2 properties in 78 ms. (steps per millisecond=91 )
Probabilistic random walk after 7113 steps, saw 6968 distinct states, run finished after 79 ms. (steps per millisecond=90 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 90 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 2813 reset in 433 ms.
Product exploration explored 100000 steps with 2814 reset in 437 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 104 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 156 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-26 23:36:25] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-26 23:36:25] [INFO ] Invariant cache hit.
[2024-05-26 23:36:26] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1196 ms. Remains : 2845/2845 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin7941099450268130706
[2024-05-26 23:36:26] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7941099450268130706
Running compilation step : cd /tmp/ltsmin7941099450268130706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1776 ms.
Running link step : cd /tmp/ltsmin7941099450268130706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7941099450268130706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10526958083032540840.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 138 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-26 23:36:41] [INFO ] Invariant cache hit.
[2024-05-26 23:36:45] [INFO ] Implicit Places using invariants in 3960 ms returned []
[2024-05-26 23:36:45] [INFO ] Invariant cache hit.
[2024-05-26 23:36:54] [INFO ] Implicit Places using invariants and state equation in 8828 ms returned []
Implicit Place search using SMT with State Equation took 12795 ms to find 0 implicit places.
[2024-05-26 23:36:54] [INFO ] Invariant cache hit.
[2024-05-26 23:36:55] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13935 ms. Remains : 2845/2845 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin11443679385414909429
[2024-05-26 23:36:55] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11443679385414909429
Running compilation step : cd /tmp/ltsmin11443679385414909429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1852 ms.
Running link step : cd /tmp/ltsmin11443679385414909429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11443679385414909429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6439208419933589721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:37:10] [INFO ] Flatten gal took : 52 ms
[2024-05-26 23:37:10] [INFO ] Flatten gal took : 51 ms
[2024-05-26 23:37:10] [INFO ] Time to serialize gal into /tmp/LTL16338997276581716833.gal : 7 ms
[2024-05-26 23:37:10] [INFO ] Time to serialize properties into /tmp/LTL2308038613316552822.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16338997276581716833.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14487150825166482043.hoa' '-atoms' '/tmp/LTL2308038613316552822.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2308038613316552822.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14487150825166482043.hoa
Detected timeout of ITS tools.
[2024-05-26 23:37:25] [INFO ] Flatten gal took : 52 ms
[2024-05-26 23:37:25] [INFO ] Flatten gal took : 55 ms
[2024-05-26 23:37:25] [INFO ] Time to serialize gal into /tmp/LTL8355510779485523176.gal : 7 ms
[2024-05-26 23:37:26] [INFO ] Time to serialize properties into /tmp/LTL11445379327160632030.ltl : 79 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8355510779485523176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11445379327160632030.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((malicious_reservoir_0>=1)&&(s3_28>=1))||((malicious_reservoir_0>=1)&&(s3_27>=1)))||(((malicious_reservoir_0>=1)&&(s3_...2942
Formula 0 simplified : F(!"((((((s6_19<1)&&(s6_18<1))&&((s6_17<1)&&(s6_16<1)))&&(((s6_23<1)&&(s6_22<1))&&((s6_21<1)&&(s6_20<1))))&&((((s6_11<1)&&(s6_10<1))...2931
Detected timeout of ITS tools.
[2024-05-26 23:37:41] [INFO ] Flatten gal took : 50 ms
[2024-05-26 23:37:41] [INFO ] Applying decomposition
[2024-05-26 23:37:41] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6001564123215104022.txt' '-o' '/tmp/graph6001564123215104022.bin' '-w' '/tmp/graph6001564123215104022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6001564123215104022.bin' '-l' '-1' '-v' '-w' '/tmp/graph6001564123215104022.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:37:41] [INFO ] Decomposing Gal with order
[2024-05-26 23:37:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:37:41] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-26 23:37:41] [INFO ] Flatten gal took : 170 ms
[2024-05-26 23:37:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 50 ms.
[2024-05-26 23:37:41] [INFO ] Time to serialize gal into /tmp/LTL13829722957593658002.gal : 14 ms
[2024-05-26 23:37:41] [INFO ] Time to serialize properties into /tmp/LTL6320385492261742187.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13829722957593658002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6320385492261742187.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((u0.malicious_reservoir_0>=1)&&(i22.u87.s3_28>=1))||((u0.malicious_reservoir_0>=1)&&(i8.u8.s3_27>=1)))||(((u0.maliciou...3679
Formula 0 simplified : F(!"((((((u107.s6_19<1)&&(u106.s6_18<1))&&((u105.s6_17<1)&&(u104.s6_16<1)))&&(((u111.s6_23<1)&&(u110.s6_22<1))&&((u109.s6_21<1)&&(u1...3668
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2126838931566693735
[2024-05-26 23:37:56] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2126838931566693735
Running compilation step : cd /tmp/ltsmin2126838931566693735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1806 ms.
Running link step : cd /tmp/ltsmin2126838931566693735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2126838931566693735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(((LTLAPp0==true) U [](!(LTLAPp0==true))))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-05 finished in 138764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U ((!p2&&X(G((!p2||G(!p0)))))||p1))))'
[2024-05-26 23:38:12] [INFO ] Flatten gal took : 74 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6724742316050397355
[2024-05-26 23:38:12] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2024-05-26 23:38:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:38:12] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2024-05-26 23:38:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:38:12] [INFO ] Applying decomposition
[2024-05-26 23:38:12] [INFO ] Flatten gal took : 80 ms
[2024-05-26 23:38:12] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2024-05-26 23:38:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:38:12] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6724742316050397355
Running compilation step : cd /tmp/ltsmin6724742316050397355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3335465149753452602.txt' '-o' '/tmp/graph3335465149753452602.bin' '-w' '/tmp/graph3335465149753452602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3335465149753452602.bin' '-l' '-1' '-v' '-w' '/tmp/graph3335465149753452602.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:38:12] [INFO ] Decomposing Gal with order
[2024-05-26 23:38:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:38:12] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-26 23:38:12] [INFO ] Flatten gal took : 157 ms
[2024-05-26 23:38:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 66 ms.
[2024-05-26 23:38:12] [INFO ] Time to serialize gal into /tmp/LTLFireability10424404745178456652.gal : 24 ms
[2024-05-26 23:38:12] [INFO ] Time to serialize properties into /tmp/LTLFireability15314252720290998759.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10424404745178456652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15314252720290998759.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !(((X("(i29.i1.u201.a3_0>=1)"))||(F("(i29.i1.u202.a1_0>=1)"))))
Formula 0 simplified : X!"(i29.i1.u201.a3_0>=1)" & G!"(i29.i1.u202.a1_0>=1)"
Compilation finished in 2258 ms.
Running link step : cd /tmp/ltsmin6724742316050397355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6724742316050397355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6724742316050397355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6724742316050397355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: LTL layer: formula: [](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))
pins2lts-mc-linux64( 2/ 8), 0.045: "[](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.046: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.093: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.456: DFS-FIFO for weak LTL, using special progress label 454
pins2lts-mc-linux64( 0/ 8), 0.456: There are 455 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.456: State length is 2937, there are 453 groups
pins2lts-mc-linux64( 0/ 8), 0.456: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.456: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.456: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.456: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.704: ~1 levels ~960 states ~27224 transitions
pins2lts-mc-linux64( 3/ 8), 0.877: ~1 levels ~1920 states ~62328 transitions
pins2lts-mc-linux64( 3/ 8), 1.109: ~1 levels ~3840 states ~124480 transitions
pins2lts-mc-linux64( 2/ 8), 1.793: ~1 levels ~7680 states ~235768 transitions
pins2lts-mc-linux64( 3/ 8), 3.765: ~1 levels ~15360 states ~600192 transitions
pins2lts-mc-linux64( 3/ 8), 5.907: ~1 levels ~30720 states ~1082552 transitions
pins2lts-mc-linux64( 5/ 8), 10.155: ~1 levels ~61440 states ~2147344 transitions
pins2lts-mc-linux64( 5/ 8), 17.395: ~1 levels ~122880 states ~4079320 transitions
pins2lts-mc-linux64( 5/ 8), 38.816: ~1 levels ~245760 states ~10562848 transitions
pins2lts-mc-linux64( 0/ 8), 69.995: ~1 levels ~491520 states ~18882048 transitions
pins2lts-mc-linux64( 2/ 8), 87.633: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 88.471:
pins2lts-mc-linux64( 0/ 8), 88.471: mean standard work distribution: 8.7% (states) 7.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 88.477:
pins2lts-mc-linux64( 0/ 8), 88.477: Explored 539097 states 24131347 transitions, fanout: 44.763
pins2lts-mc-linux64( 0/ 8), 88.477: Total exploration time 87.840 sec (87.330 sec minimum, 87.535 sec on average)
pins2lts-mc-linux64( 0/ 8), 88.477: States per second: 6137, Transitions per second: 274719
pins2lts-mc-linux64( 0/ 8), 88.477:
pins2lts-mc-linux64( 0/ 8), 88.477: Progress states detected: 6187974
pins2lts-mc-linux64( 0/ 8), 88.477: Redundant explorations: -91.2883
pins2lts-mc-linux64( 0/ 8), 88.477:
pins2lts-mc-linux64( 0/ 8), 88.477: Queue width: 8B, total height: 7171270, memory: 54.71MB
pins2lts-mc-linux64( 0/ 8), 88.478: Tree memory: 303.2MB, 51.4 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 88.478: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 88.478: Stored 480 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 88.478: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 88.479: Est. total memory use: 357.9MB (~1078.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6724742316050397355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6724742316050397355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(((LTLAPp3==true) U [](!(LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-27 00:02:14] [INFO ] Applying decomposition
[2024-05-27 00:02:15] [INFO ] Flatten gal took : 628 ms
[2024-05-27 00:02:15] [INFO ] Decomposing Gal with order
[2024-05-27 00:02:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:02:24] [INFO ] Removed a total of 260 redundant transitions.
[2024-05-27 00:02:25] [INFO ] Flatten gal took : 9402 ms
[2024-05-27 00:02:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 364 ms.
[2024-05-27 00:02:25] [INFO ] Time to serialize gal into /tmp/LTLFireability2320577955301765273.gal : 62 ms
[2024-05-27 00:02:25] [INFO ] Time to serialize properties into /tmp/LTLFireability2241130176358589953.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2320577955301765273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2241130176358589953.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !(((X("(a3.a3_0>=1)"))||(F("(a1.a1_0>=1)"))))
Formula 0 simplified : X!"(a3.a3_0>=1)" & G!"(a1.a1_0>=1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 135920 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12754648 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-28"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-COL-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 r329-tall-171662361400028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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