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-171662361400027.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361400027
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716765945968

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 23:25:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 23:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:25:47] [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:25:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 23:25:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 689 ms
[2024-05-26 23:25:48] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 23:25:48] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-26 23:25:48] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 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 10002 steps, including 253 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 31) seen :14
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1006 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=251 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1002 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 23:25:48] [INFO ] Computed 5 invariants in 3 ms
[2024-05-26 23:25:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:25:49] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2024-05-26 23:25:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 23:25:49] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :13
[2024-05-26 23:25:49] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :13
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-26 23:25:49] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :13
Fused 17 Parikh solutions to 12 different solutions.
Finished Parikh walk after 179 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Parikh walk visited 9 properties in 4 ms.
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 26/26 transitions.
Graph (complete) has 50 edges and 30 vertex of which 26 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 26 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 25 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 13 ms. Remains 24 /30 variables (removed 6) and now considering 16/26 (removed 10) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-26 23:25:49] [INFO ] Computed 8 invariants in 4 ms
[2024-05-26 23:25:49] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 24/30 places, 16/26 transitions.
Finished random walk after 364 steps, including 3 resets, run visited all 4 properties in 4 ms. (steps per millisecond=91 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-26 23:25:49] [INFO ] Flatten gal took : 19 ms
[2024-05-26 23:25:49] [INFO ] Flatten gal took : 4 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2024-05-26 23:25:49] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 27 ms.
[2024-05-26 23:25:49] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Support contains 2040 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Applied a total of 0 rules in 239 ms. Remains 2998 /2998 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2998 cols
[2024-05-26 23:25:50] [INFO ] Computed 2553 invariants in 106 ms
[2024-05-26 23:25:51] [INFO ] Implicit Places using invariants in 1870 ms returned []
[2024-05-26 23:25:51] [INFO ] Invariant cache hit.
[2024-05-26 23:25:57] [INFO ] Implicit Places using invariants and state equation in 5466 ms returned []
Implicit Place search using SMT with State Equation took 7341 ms to find 0 implicit places.
[2024-05-26 23:25:57] [INFO ] Invariant cache hit.
[2024-05-26 23:25:58] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8779 ms. Remains : 2998/2998 places, 446/446 transitions.
Support contains 2040 out of 2998 places after structural reductions.
[2024-05-26 23:25:58] [INFO ] Flatten gal took : 166 ms
[2024-05-26 23:25:58] [INFO ] Flatten gal took : 111 ms
[2024-05-26 23:25:59] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 2039 out of 2998 places (down from 2040) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 29) seen :10
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-26 23:25:59] [INFO ] Invariant cache hit.
[2024-05-26 23:26:01] [INFO ] After 1163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-26 23:26:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-26 23:26:02] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 486 ms returned sat
[2024-05-26 23:26:26] [INFO ] After 22466ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :15
[2024-05-26 23:26:26] [INFO ] After 22475ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :15
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-26 23:26:26] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :15
Fused 19 Parikh solutions to 6 different solutions.
Parikh walk visited 12 properties in 62 ms.
Support contains 987 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2965 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.15 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 179 rules applied. Total rules applied 180 place count 2936 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 181 place count 2935 transition count 296
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 181 place count 2935 transition count 295
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 2934 transition count 295
Applied a total of 183 rules in 343 ms. Remains 2934 /2998 variables (removed 64) and now considering 295/446 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 2934/2998 places, 295/446 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 582 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Finished probabilistic random walk after 3257 steps, run visited all 4 properties in 178 ms. (steps per millisecond=18 )
Probabilistic random walk after 3257 steps, saw 3110 distinct states, run finished after 180 ms. (steps per millisecond=18 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2998 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2998 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' '!(F(G(p0)))'
Support contains 29 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.28 ms
Discarding 92 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 697 ms. Remains 2903 /2998 variables (removed 95) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-26 23:26:29] [INFO ] Computed 2464 invariants in 114 ms
[2024-05-26 23:26:33] [INFO ] Implicit Places using invariants in 4224 ms returned []
[2024-05-26 23:26:33] [INFO ] Invariant cache hit.
[2024-05-26 23:26:41] [INFO ] Implicit Places using invariants and state equation in 7693 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 11932 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2998 places, 441/446 transitions.
Applied a total of 0 rules in 186 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12817 ms. Remains : 2845/2998 places, 441/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 150 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s2669 s2670 s2671 s2672 s2673 s2674 s2675 s2676 s2677 s2678 s2679 s2680 s2681 s2682 s2683 s2684 s2685 s2686 s2687 s2688 s2689 s2690 s2691 s2...], 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 2809 reset in 510 ms.
Product exploration explored 100000 steps with 2818 reset in 447 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 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-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-00 finished in 14446 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((F(G(p0))&&F(p1))))'
Support contains 61 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2937 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.11 ms
Discarding 61 places :
Also discarding 0 output 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 2936 transition count 445
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2936 transition count 445
Applied a total of 4 rules in 501 ms. Remains 2936 /2998 variables (removed 62) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 2936 cols
[2024-05-26 23:26:43] [INFO ] Computed 2492 invariants in 38 ms
[2024-05-26 23:26:47] [INFO ] Implicit Places using invariants in 4092 ms returned []
[2024-05-26 23:26:47] [INFO ] Invariant cache hit.
[2024-05-26 23:26:55] [INFO ] Implicit Places using invariants and state equation in 7846 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 11954 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2907/2998 places, 445/446 transitions.
Applied a total of 0 rules in 161 ms. Remains 2907 /2907 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12617 ms. Remains : 2907/2998 places, 445/446 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s2906 (ADD s2872 s2873 s2874 s2875 s2876 s2877 s2878 s2879 s2880 s2881 s2882 s2883 s2884 s2885 s2886 s2887 s2888 s2889 s2890 s2891 s2892 s2893 s28...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-01 finished in 12774 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 (p1||G(!p0))))'
Support contains 843 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2938 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.11 ms
Discarding 60 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2935 transition count 443
Applied a total of 5 rules in 191 ms. Remains 2935 /2998 variables (removed 63) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 2935 cols
[2024-05-26 23:26:55] [INFO ] Computed 2493 invariants in 68 ms
[2024-05-26 23:26:58] [INFO ] Implicit Places using invariants in 2810 ms returned []
[2024-05-26 23:26:58] [INFO ] Invariant cache hit.
[2024-05-26 23:27:04] [INFO ] Implicit Places using invariants and state equation in 6127 ms returned [2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2698, 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, 2756]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8949 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2998 places, 443/446 transitions.
Applied a total of 0 rules in 105 ms. Remains 2877 /2877 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9248 ms. Remains : 2877/2998 places, 443/446 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) p0), (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s1), p0:(LEQ s2876 (ADD s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 s865 s866 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3134 reset in 2750 ms.
Product exploration explored 100000 steps with 3088 reset in 2644 ms.
Computed a total of 2877 stabilizing places and 443 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2877 transition count 443
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 9 factoid took 285 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND p0 (NOT p1)), (NOT p0), p0, true]
Incomplete random walk after 10000 steps, including 280 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 443 rows 2877 cols
[2024-05-26 23:27:12] [INFO ] Computed 2436 invariants in 70 ms
[2024-05-26 23:27:12] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 23:27:13] [INFO ] [Nat]Absence check using 0 positive and 2436 generalized place invariants in 511 ms returned sat
[2024-05-26 23:27:23] [INFO ] After 9828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 23:27:25] [INFO ] After 11594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9967 ms.
[2024-05-26 23:27:34] [INFO ] After 22518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 90 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 9 factoid took 333 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-02 finished in 39765 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((F(p1)&&X(G(p2))))&&p0)))'
Support contains 88 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 140 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:27:35] [INFO ] Computed 2492 invariants in 60 ms
[2024-05-26 23:27:39] [INFO ] Implicit Places using invariants in 4352 ms returned []
[2024-05-26 23:27:39] [INFO ] Invariant cache hit.
[2024-05-26 23:27:48] [INFO ] Implicit Places using invariants and state equation in 8990 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 13352 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 131 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 13623 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 1806 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(LEQ (ADD s2669 s2670 s2671 s2672 s2673 s2674 s2675 s2676 s2677 s2678 s2679 s2680 s2681 s2682 s2683 s2684 s2685 s2686 s2687 s2688 s2689 s2690 s2691 s26...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-04 finished in 15453 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' '!(((p0 U p1)||X((G(p2)||F(p3)))))'
Support contains 61 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2938 transition count 446
Applied a total of 60 rules in 141 ms. Remains 2938 /2998 variables (removed 60) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2938 cols
[2024-05-26 23:27:50] [INFO ] Computed 2493 invariants in 55 ms
[2024-05-26 23:27:55] [INFO ] Implicit Places using invariants in 4353 ms returned []
[2024-05-26 23:27:55] [INFO ] Invariant cache hit.
[2024-05-26 23:28:04] [INFO ] Implicit Places using invariants and state equation in 8867 ms returned [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, 2756]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 13228 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2909/2998 places, 446/446 transitions.
Applied a total of 0 rules in 137 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13507 ms. Remains : 2909/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p3:(GT 3 (ADD s2786 s2787 s2788 s2789 s2790 s2791 s2792 s2793 s2794 s2795 s2796 s2797 s2798 s2799 s2800 s2801 s2802 s2803 s2804 s2805 s2806 s2807 s2808 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 899 ms.
Product exploration explored 100000 steps with 50000 reset in 934 ms.
Computed a total of 2909 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 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 p3 (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 40 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-05 finished in 16092 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)))'
Support contains 871 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 73 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:28:07] [INFO ] Computed 2492 invariants in 54 ms
[2024-05-26 23:28:09] [INFO ] Implicit Places using invariants in 2811 ms returned []
[2024-05-26 23:28:09] [INFO ] Invariant cache hit.
[2024-05-26 23:28:13] [INFO ] Implicit Places using invariants and state equation in 3978 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 6795 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 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 6940 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s0 (ADD s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 s865 s866 s867 s868 s86...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-07 finished in 7152 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)))'
Support contains 842 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 73 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2024-05-26 23:28:14] [INFO ] Computed 2492 invariants in 45 ms
[2024-05-26 23:28:17] [INFO ] Implicit Places using invariants in 3617 ms returned []
[2024-05-26 23:28:17] [INFO ] Invariant cache hit.
[2024-05-26 23:28:24] [INFO ] Implicit Places using invariants and state equation in 7193 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 10814 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2998 places, 446/446 transitions.
Applied a total of 0 rules in 79 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10968 ms. Remains : 2908/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-08 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 (GT 3 s2907) (LEQ 2 (ADD s1683 s1684 s1685 s1686 s1687 s1688 s1689 s1690 s1691 s1692 s1693 s1694 s1695 s1696 s1697 s1698 s1699 s1700 s1701 s1702 s1...], 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 818 ms.
Product exploration explored 100000 steps with 50000 reset in 838 ms.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 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-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-08 finished in 13681 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((p0&&X(F((p0&&F(p1))))))))'
Support contains 2 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 141 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:28:27] [INFO ] Invariant cache hit.
[2024-05-26 23:28:31] [INFO ] Implicit Places using invariants in 4104 ms returned []
[2024-05-26 23:28:31] [INFO ] Invariant cache hit.
[2024-05-26 23:28:40] [INFO ] Implicit Places using invariants and state equation in 8341 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 12450 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2998 places, 446/446 transitions.
Applied a total of 0 rules in 151 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12744 ms. Remains : 2908/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(LEQ 1 s2903), p0:(LEQ 2 s2907)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, 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-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-09 finished in 12969 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(p0))'
Support contains 31 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.9 ms
Discarding 92 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2905 transition count 443
Applied a total of 3 rules in 306 ms. Remains 2905 /2998 variables (removed 93) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 2905 cols
[2024-05-26 23:28:41] [INFO ] Computed 2464 invariants in 54 ms
[2024-05-26 23:28:45] [INFO ] Implicit Places using invariants in 4094 ms returned []
[2024-05-26 23:28:45] [INFO ] Invariant cache hit.
[2024-05-26 23:28:52] [INFO ] Implicit Places using invariants and state equation in 7736 ms returned [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 29 places :
Implicit Place search using SMT with State Equation took 11839 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2876/2998 places, 443/446 transitions.
Applied a total of 0 rules in 161 ms. Remains 2876 /2876 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12308 ms. Remains : 2876/2998 places, 443/446 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s2785 s2786 s2787 s2788 s2789 s2790 s2791 s2792 s2793 s2794 s2795 s2796 s2797 s2798 s2799 s2800 s2801 s2802 s2803 s2804 s2805 s2806 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-10 finished in 12363 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(F(p0)))'
Support contains 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 269 are kept as prefixes of interest. Removing 2729 places using SCC suffix rule.7 ms
Discarding 2729 places :
Also discarding 145 output transitions
Drop transitions removed 145 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 268 transition count 185
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 268 transition count 185
Applied a total of 117 rules in 18 ms. Remains 268 /2998 variables (removed 2730) and now considering 185/446 (removed 261) transitions.
// Phase 1: matrix 185 rows 268 cols
[2024-05-26 23:28:53] [INFO ] Computed 84 invariants in 1 ms
[2024-05-26 23:28:53] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-26 23:28:53] [INFO ] Invariant cache hit.
[2024-05-26 23:28:53] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 379 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/2998 places, 185/446 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 401 ms. Remains : 239/2998 places, 185/446 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117) s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-11 finished in 482 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(G((X(G(p1))||p0))))'
Support contains 59 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 140 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2024-05-26 23:28:53] [INFO ] Computed 2492 invariants in 39 ms
[2024-05-26 23:28:57] [INFO ] Implicit Places using invariants in 4134 ms returned []
[2024-05-26 23:28:57] [INFO ] Invariant cache hit.
[2024-05-26 23:29:06] [INFO ] Implicit Places using invariants and state equation in 8605 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 12741 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2998 places, 446/446 transitions.
Applied a total of 0 rules in 130 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13011 ms. Remains : 2908/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 1 s2907), p0:(OR (GT (ADD s2553 s2554 s2555 s2556 s2557 s2558 s2559 s2560 s2561 s2562 s2563 s2564 s2565 s2566 s2567 s2568 s2569 s2570 s2571 s2572 ...], 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-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-12 finished in 13152 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(X((G(F(p0))||G(p1)))) U G(p2))))'
Support contains 88 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 137 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:29:06] [INFO ] Computed 2492 invariants in 57 ms
[2024-05-26 23:29:11] [INFO ] Implicit Places using invariants in 4215 ms returned []
[2024-05-26 23:29:11] [INFO ] Invariant cache hit.
[2024-05-26 23:29:18] [INFO ] Implicit Places using invariants and state equation in 7520 ms returned []
Implicit Place search using SMT with State Equation took 11739 ms to find 0 implicit places.
[2024-05-26 23:29:18] [INFO ] Invariant cache hit.
[2024-05-26 23:29:19] [INFO ] Dead Transitions using invariants and state equation in 1038 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 12919 ms. Remains : 2936/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(LEQ s0 (ADD s2901 s2902 s2903 s2904 s2905 s2906 s2907 s2908 s2909 s2910 s2911 s2912 s2913 s2914 s2915 s2916 s2917 s2918 s2919 s2920 s2921 s2922 s2923 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3026 reset in 413 ms.
Product exploration explored 100000 steps with 3027 reset in 389 ms.
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).
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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 274 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 303 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-26 23:29:22] [INFO ] Invariant cache hit.
[2024-05-26 23:29:23] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 511 ms returned sat
[2024-05-26 23:29:23] [INFO ] After 1012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 23:29:24] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 504 ms returned sat
[2024-05-26 23:29:30] [INFO ] After 6076ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-26 23:29:39] [INFO ] After 15162ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 8779 ms.
[2024-05-26 23:29:48] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 151 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 14 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p0))), (F p1), (F (AND p1 (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 8 factoid took 965 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 345 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-26 23:29:49] [INFO ] Invariant cache hit.
[2024-05-26 23:29:54] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 3736 ms returned sat
[2024-05-26 23:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:30:04] [INFO ] [Real]Absence check using state equation in 10360 ms returned unknown
Could not prove EG (NOT p2)
Support contains 88 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 133 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:30:05] [INFO ] Invariant cache hit.
[2024-05-26 23:30:09] [INFO ] Implicit Places using invariants in 4076 ms returned []
[2024-05-26 23:30:09] [INFO ] Invariant cache hit.
[2024-05-26 23:30:16] [INFO ] Implicit Places using invariants and state equation in 7118 ms returned []
Implicit Place search using SMT with State Equation took 11199 ms to find 0 implicit places.
[2024-05-26 23:30:16] [INFO ] Invariant cache hit.
[2024-05-26 23:30:17] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12352 ms. Remains : 2936/2936 places, 446/446 transitions.
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).
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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 23:30:18] [INFO ] Invariant cache hit.
[2024-05-26 23:30:19] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 509 ms returned sat
[2024-05-26 23:30:19] [INFO ] After 968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 23:30:20] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 493 ms returned sat
[2024-05-26 23:30:23] [INFO ] After 3014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 23:30:26] [INFO ] After 5518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4060 ms.
[2024-05-26 23:30:30] [INFO ] After 10559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 150 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p0))), (F p1), (F (AND p1 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 853 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 322 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-26 23:30:31] [INFO ] Invariant cache hit.
[2024-05-26 23:30:36] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 3955 ms returned sat
[2024-05-26 23:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:30:46] [INFO ] [Real]Absence check using state equation in 10209 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 342 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 3025 reset in 361 ms.
Product exploration explored 100000 steps with 3024 reset in 395 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 350 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 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.12 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2906 transition count 446
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 483 ms. Remains 2906 /2936 variables (removed 30) and now considering 446/446 (removed 0) transitions.
[2024-05-26 23:30:48] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 446 rows 2906 cols
[2024-05-26 23:30:48] [INFO ] Computed 2464 invariants in 47 ms
[2024-05-26 23:30:49] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2906/2936 places, 446/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1610 ms. Remains : 2906/2936 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin6160607452375679324
[2024-05-26 23:30:49] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6160607452375679324
Running compilation step : cd /tmp/ltsmin6160607452375679324;'/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 1855 ms.
Running link step : cd /tmp/ltsmin6160607452375679324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6160607452375679324;'/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/stateBased9920087568590440904.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 88 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 157 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:31:05] [INFO ] Computed 2492 invariants in 52 ms
[2024-05-26 23:31:09] [INFO ] Implicit Places using invariants in 4174 ms returned []
[2024-05-26 23:31:09] [INFO ] Invariant cache hit.
[2024-05-26 23:31:16] [INFO ] Implicit Places using invariants and state equation in 6879 ms returned []
Implicit Place search using SMT with State Equation took 11054 ms to find 0 implicit places.
[2024-05-26 23:31:16] [INFO ] Invariant cache hit.
[2024-05-26 23:31:17] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12233 ms. Remains : 2936/2936 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin5674453260514964468
[2024-05-26 23:31:17] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5674453260514964468
Running compilation step : cd /tmp/ltsmin5674453260514964468;'/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 1742 ms.
Running link step : cd /tmp/ltsmin5674453260514964468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5674453260514964468;'/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/stateBased16846770878480853400.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:31:32] [INFO ] Flatten gal took : 73 ms
[2024-05-26 23:31:32] [INFO ] Flatten gal took : 82 ms
[2024-05-26 23:31:32] [INFO ] Time to serialize gal into /tmp/LTL15028954963353488620.gal : 23 ms
[2024-05-26 23:31:32] [INFO ] Time to serialize properties into /tmp/LTL8369167524623626575.prop : 6 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/LTL15028954963353488620.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4429644058298737439.hoa' '-atoms' '/tmp/LTL8369167524623626575.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...318
Loading property file /tmp/LTL8369167524623626575.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4429644058298737439.hoa
Detected timeout of ITS tools.
[2024-05-26 23:31:47] [INFO ] Flatten gal took : 71 ms
[2024-05-26 23:31:47] [INFO ] Flatten gal took : 68 ms
[2024-05-26 23:31:47] [INFO ] Time to serialize gal into /tmp/LTL14344235840731386900.gal : 10 ms
[2024-05-26 23:31:47] [INFO ] Time to serialize properties into /tmp/LTL15509375859520555625.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/LTL14344235840731386900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15509375859520555625.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...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X((G(F("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart...872
Formula 0 simplified : X(XX(FG!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+C...857
Detected timeout of ITS tools.
[2024-05-26 23:32:03] [INFO ] Flatten gal took : 66 ms
[2024-05-26 23:32:03] [INFO ] Applying decomposition
[2024-05-26 23:32:03] [INFO ] Flatten gal took : 67 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/graph14882628592550841180.txt' '-o' '/tmp/graph14882628592550841180.bin' '-w' '/tmp/graph14882628592550841180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14882628592550841180.bin' '-l' '-1' '-v' '-w' '/tmp/graph14882628592550841180.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:32:03] [INFO ] Decomposing Gal with order
[2024-05-26 23:32:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:32:03] [INFO ] Removed a total of 262 redundant transitions.
[2024-05-26 23:32:03] [INFO ] Flatten gal took : 262 ms
[2024-05-26 23:32:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 94 ms.
[2024-05-26 23:32:04] [INFO ] Time to serialize gal into /tmp/LTL6831730119417767131.gal : 23 ms
[2024-05-26 23:32:04] [INFO ] Time to serialize properties into /tmp/LTL4585976171856741471.ltl : 46 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/LTL6831730119417767131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4585976171856741471.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...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X((G(F("((((((gu63.Cstart_0+gu63.Cstart_1)+(gu63.Cstart_2+gu63.Cstart_3))+((gu63.Cstart_4+gu63.Cstart_5)+(gu63.Cstart_6+gu63.C...1282
Formula 0 simplified : X(XX(FG!"((((((gu63.Cstart_0+gu63.Cstart_1)+(gu63.Cstart_2+gu63.Cstart_3))+((gu63.Cstart_4+gu63.Cstart_5)+(gu63.Cstart_6+gu63.Cstart...1267
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16967588612771651251
[2024-05-26 23:32:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16967588612771651251
Running compilation step : cd /tmp/ltsmin16967588612771651251;'/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 1786 ms.
Running link step : cd /tmp/ltsmin16967588612771651251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16967588612771651251;'/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((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-13 finished in 207782 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((p0 U (G(p0)||(p0&&(p1||F(!p2)))))) U (!p0&&G(p3))))'
Support contains 1016 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2965 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.11 ms
Discarding 33 places :
Also discarding 0 output 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 2964 transition count 445
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2964 transition count 445
Applied a total of 4 rules in 277 ms. Remains 2964 /2998 variables (removed 34) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 2964 cols
[2024-05-26 23:32:34] [INFO ] Computed 2521 invariants in 20 ms
[2024-05-26 23:32:37] [INFO ] Implicit Places using invariants in 3218 ms returned []
[2024-05-26 23:32:37] [INFO ] Invariant cache hit.
[2024-05-26 23:32:46] [INFO ] Implicit Places using invariants and state equation in 8487 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 11709 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2935/2998 places, 445/446 transitions.
Applied a total of 0 rules in 105 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12093 ms. Remains : 2935/2998 places, 445/446 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s2814 s2815 s2816 s2817 s2818 s2819 s2820 s2821 s2822 s2823 s2824 s2825 s2826 s2827 s2828 s2829 s2830 s2831 s2832 s2833 s2834 s2835 s2836 s283...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3021 reset in 714 ms.
Product exploration explored 100000 steps with 3025 reset in 702 ms.
Computed a total of 2935 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2935 transition count 445
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) p3 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X p3), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X p3)), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 176 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 303 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 481926 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481926 steps, saw 82480 distinct states, run finished after 3002 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 445 rows 2935 cols
[2024-05-26 23:32:53] [INFO ] Computed 2492 invariants in 16 ms
[2024-05-26 23:32:54] [INFO ] After 634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-26 23:32:55] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 541 ms returned sat
[2024-05-26 23:33:19] [INFO ] After 23246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-26 23:33:19] [INFO ] After 23251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-26 23:33:19] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=15 )
Parikh walk visited 8 properties in 13 ms.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X p3), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X p3)), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p3) (NOT p1) p2)), (F (NOT p3)), (F (OR p0 (NOT p3))), (F (NOT (AND (NOT p0) p3))), (F (AND (NOT p0) (NOT p3))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 21 factoid took 509 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Applied a total of 0 rules in 92 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-26 23:33:20] [INFO ] Invariant cache hit.
[2024-05-26 23:33:23] [INFO ] Implicit Places using invariants in 3294 ms returned []
[2024-05-26 23:33:23] [INFO ] Invariant cache hit.
[2024-05-26 23:33:30] [INFO ] Implicit Places using invariants and state equation in 6988 ms returned []
Implicit Place search using SMT with State Equation took 10284 ms to find 0 implicit places.
[2024-05-26 23:33:30] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-26 23:33:30] [INFO ] Invariant cache hit.
[2024-05-26 23:33:31] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11445 ms. Remains : 2935/2935 places, 445/445 transitions.
Computed a total of 2935 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2935 transition count 445
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) p3 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X p3), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X p3)), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 171 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 410970 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 410970 steps, saw 71350 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-26 23:33:36] [INFO ] Invariant cache hit.
[2024-05-26 23:33:37] [INFO ] After 728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-26 23:33:38] [INFO ] [Nat]Absence check using 0 positive and 2492 generalized place invariants in 487 ms returned sat
[2024-05-26 23:33:54] [INFO ] After 15023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-26 23:34:01] [INFO ] After 22182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1286 ms.
[2024-05-26 23:34:02] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 64 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 8 properties in 13 ms.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X p3), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X p3)), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p3) (NOT p1) p2)), (F (NOT p3)), (F (OR p0 (NOT p3))), (F (NOT (AND (NOT p0) p3))), (F (AND (NOT p0) (NOT p3))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 21 factoid took 538 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 3027 reset in 657 ms.
Product exploration explored 100000 steps with 3019 reset in 686 ms.
Built C files in :
/tmp/ltsmin2928358993603181141
[2024-05-26 23:34:04] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2024-05-26 23:34:04] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:04] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2024-05-26 23:34:04] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:04] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2024-05-26 23:34:04] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:04] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2928358993603181141
Running compilation step : cd /tmp/ltsmin2928358993603181141;'/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 2188 ms.
Running link step : cd /tmp/ltsmin2928358993603181141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2928358993603181141;'/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/stateBased12622309975092728667.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Applied a total of 0 rules in 90 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-26 23:34:19] [INFO ] Invariant cache hit.
[2024-05-26 23:34:23] [INFO ] Implicit Places using invariants in 3271 ms returned []
[2024-05-26 23:34:23] [INFO ] Invariant cache hit.
[2024-05-26 23:34:30] [INFO ] Implicit Places using invariants and state equation in 7649 ms returned []
Implicit Place search using SMT with State Equation took 10925 ms to find 0 implicit places.
[2024-05-26 23:34:30] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-26 23:34:30] [INFO ] Invariant cache hit.
[2024-05-26 23:34:31] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12161 ms. Remains : 2935/2935 places, 445/445 transitions.
Built C files in :
/tmp/ltsmin18197854865577063455
[2024-05-26 23:34:32] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2024-05-26 23:34:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:32] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2024-05-26 23:34:32] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:32] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2024-05-26 23:34:32] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:34:32] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18197854865577063455
Running compilation step : cd /tmp/ltsmin18197854865577063455;'/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 2312 ms.
Running link step : cd /tmp/ltsmin18197854865577063455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18197854865577063455;'/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/stateBased8754284454580820391.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:34:47] [INFO ] Flatten gal took : 90 ms
[2024-05-26 23:34:47] [INFO ] Flatten gal took : 80 ms
[2024-05-26 23:34:47] [INFO ] Time to serialize gal into /tmp/LTL1480185154307181242.gal : 8 ms
[2024-05-26 23:34:47] [INFO ] Time to serialize properties into /tmp/LTL586514029374949104.prop : 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/LTL1480185154307181242.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4738739612101508891.hoa' '-atoms' '/tmp/LTL586514029374949104.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...316
Loading property file /tmp/LTL586514029374949104.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4738739612101508891.hoa
Detected timeout of ITS tools.
[2024-05-26 23:35:02] [INFO ] Flatten gal took : 71 ms
[2024-05-26 23:35:02] [INFO ] Flatten gal took : 66 ms
[2024-05-26 23:35:02] [INFO ] Time to serialize gal into /tmp/LTL594749310913738538.gal : 9 ms
[2024-05-26 23:35:02] [INFO ] Time to serialize properties into /tmp/LTL11778716437245697096.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/LTL594749310913738538.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11778716437245697096.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...275
Read 1 LTL properties
Checking formula 0 : !(((F(("((((((s4_0+s4_1)+(s4_2+s4_3))+((s4_4+s4_5)+(s4_6+s4_7)))+(((s4_8+s4_9)+(s4_10+s4_11))+((s4_12+s4_13)+(s4_14+s4_15))))+((((s4_1...18275
Formula 0 simplified : G((!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+s6_13)+(s6_14+s6_15))))+((((s6_16...17130
Detected timeout of ITS tools.
[2024-05-26 23:35:17] [INFO ] Flatten gal took : 66 ms
[2024-05-26 23:35:17] [INFO ] Applying decomposition
[2024-05-26 23:35:17] [INFO ] Flatten gal took : 63 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/graph14148004254216859533.txt' '-o' '/tmp/graph14148004254216859533.bin' '-w' '/tmp/graph14148004254216859533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14148004254216859533.bin' '-l' '-1' '-v' '-w' '/tmp/graph14148004254216859533.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:35:19] [INFO ] Decomposing Gal with order
[2024-05-26 23:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:35:19] [INFO ] Removed a total of 318 redundant transitions.
[2024-05-26 23:35:19] [INFO ] Flatten gal took : 127 ms
[2024-05-26 23:35:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 207 labels/synchronizations in 14 ms.
[2024-05-26 23:35:19] [INFO ] Time to serialize gal into /tmp/LTL3864567023994692182.gal : 10 ms
[2024-05-26 23:35:19] [INFO ] Time to serialize properties into /tmp/LTL11762680594181313825.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/LTL3864567023994692182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11762680594181313825.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 : !(((F(("((((((gi2.gi12.gu60.s4_0+gi2.gi12.gu60.s4_1)+(gi2.gi12.gu60.s4_2+gi2.gi12.gu60.s4_3))+((gi2.gi12.gu60.s4_4+gi2.gi12.gu60.s4_5)...28807
Formula 0 simplified : G((!"((((((gu61.s6_0+gu61.s6_1)+(gu61.s6_2+gu61.s6_3))+((gu61.s6_4+gu61.s6_5)+(gu61.s6_6+gu61.s6_7)))+(((gu61.s6_8+gu61.s6_9)+(gu61....26038
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3996030766381939908
[2024-05-26 23:35:34] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3996030766381939908
Running compilation step : cd /tmp/ltsmin3996030766381939908;'/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 1942 ms.
Running link step : cd /tmp/ltsmin3996030766381939908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3996030766381939908;'/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 ([]((LTLAPp0==true))||((LTLAPp0==true)&&((LTLAPp1==true)||<>(!(LTLAPp2==true))))))) U (!(LTLAPp0==true)&&[]((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-14 finished in 195441 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(F(p0)))'
Support contains 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2096 are kept as prefixes of interest. Removing 902 places using SCC suffix rule.11 ms
Discarding 902 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 2095 transition count 388
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2095 transition count 388
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2094 transition count 387
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2094 transition count 387
Applied a total of 33 rules in 267 ms. Remains 2094 /2998 variables (removed 904) and now considering 387/446 (removed 59) transitions.
// Phase 1: matrix 387 rows 2094 cols
[2024-05-26 23:35:50] [INFO ] Computed 1708 invariants in 10 ms
[2024-05-26 23:35:53] [INFO ] Implicit Places using invariants in 2854 ms returned []
[2024-05-26 23:35:53] [INFO ] Invariant cache hit.
[2024-05-26 23:35:57] [INFO ] Implicit Places using invariants and state equation in 4640 ms returned [1829, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 7497 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2036/2998 places, 387/446 transitions.
Applied a total of 0 rules in 261 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8025 ms. Remains : 2036/2998 places, 387/446 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1 (ADD s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2023 s2024 s2025 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4096 reset in 436 ms.
Product exploration explored 100000 steps with 4130 reset in 458 ms.
Computed a total of 2036 stabilizing places and 387 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2036 transition count 387
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 387 rows 2036 cols
[2024-05-26 23:35:59] [INFO ] Computed 1652 invariants in 10 ms
[2024-05-26 23:36:02] [INFO ] [Real]Absence check using 0 positive and 1652 generalized place invariants in 2157 ms returned sat
[2024-05-26 23:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:36:09] [INFO ] [Real]Absence check using state equation in 7082 ms returned sat
[2024-05-26 23:36:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:36:12] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 1939 ms returned sat
[2024-05-26 23:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:36:20] [INFO ] [Nat]Absence check using state equation in 7948 ms returned sat
[2024-05-26 23:36:20] [INFO ] Computed and/alt/rep : 264/323/264 causal constraints (skipped 63 transitions) in 39 ms.
[2024-05-26 23:36:21] [INFO ] Added : 79 causal constraints over 16 iterations in 1428 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 2036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2036/2036 places, 387/387 transitions.
Applied a total of 0 rules in 87 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-26 23:36:21] [INFO ] Invariant cache hit.
[2024-05-26 23:36:24] [INFO ] Implicit Places using invariants in 2805 ms returned []
[2024-05-26 23:36:24] [INFO ] Invariant cache hit.
[2024-05-26 23:36:28] [INFO ] Implicit Places using invariants and state equation in 4385 ms returned []
Implicit Place search using SMT with State Equation took 7195 ms to find 0 implicit places.
[2024-05-26 23:36:28] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-26 23:36:28] [INFO ] Invariant cache hit.
[2024-05-26 23:36:29] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7966 ms. Remains : 2036/2036 places, 387/387 transitions.
Computed a total of 2036 stabilizing places and 387 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2036 transition count 387
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-26 23:36:30] [INFO ] Invariant cache hit.
[2024-05-26 23:36:32] [INFO ] [Real]Absence check using 0 positive and 1652 generalized place invariants in 1921 ms returned sat
[2024-05-26 23:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:36:38] [INFO ] [Real]Absence check using state equation in 6172 ms returned sat
[2024-05-26 23:36:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 23:36:41] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 1937 ms returned sat
[2024-05-26 23:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 23:36:49] [INFO ] [Nat]Absence check using state equation in 7631 ms returned sat
[2024-05-26 23:36:49] [INFO ] Computed and/alt/rep : 264/323/264 causal constraints (skipped 63 transitions) in 32 ms.
[2024-05-26 23:36:50] [INFO ] Added : 79 causal constraints over 16 iterations in 1360 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4085 reset in 399 ms.
Product exploration explored 100000 steps with 4138 reset in 424 ms.
Built C files in :
/tmp/ltsmin7854988342835240387
[2024-05-26 23:36:51] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2024-05-26 23:36:51] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:36:51] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2024-05-26 23:36:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:36:51] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2024-05-26 23:36:51] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:36:51] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7854988342835240387
Running compilation step : cd /tmp/ltsmin7854988342835240387;'/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 1566 ms.
Running link step : cd /tmp/ltsmin7854988342835240387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7854988342835240387;'/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/stateBased2316174875831326170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 2036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2036/2036 places, 387/387 transitions.
Applied a total of 0 rules in 96 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-26 23:37:06] [INFO ] Invariant cache hit.
[2024-05-26 23:37:09] [INFO ] Implicit Places using invariants in 2774 ms returned []
[2024-05-26 23:37:09] [INFO ] Invariant cache hit.
[2024-05-26 23:37:14] [INFO ] Implicit Places using invariants and state equation in 4679 ms returned []
Implicit Place search using SMT with State Equation took 7456 ms to find 0 implicit places.
[2024-05-26 23:37:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-26 23:37:14] [INFO ] Invariant cache hit.
[2024-05-26 23:37:14] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8230 ms. Remains : 2036/2036 places, 387/387 transitions.
Built C files in :
/tmp/ltsmin7578881036790470570
[2024-05-26 23:37:14] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2024-05-26 23:37:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:37:14] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2024-05-26 23:37:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:37:14] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2024-05-26 23:37:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:37:14] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7578881036790470570
Running compilation step : cd /tmp/ltsmin7578881036790470570;'/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 1559 ms.
Running link step : cd /tmp/ltsmin7578881036790470570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7578881036790470570;'/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/stateBased6018584394536910120.hoa' '--buchi-type=spotba'
LTSmin run took 8470 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-15 finished in 94961 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(X((G(F(p0))||G(p1)))) U G(p2))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-28-LTLCardinality-13
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.13 ms
Discarding 92 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 308 ms. Remains 2903 /2998 variables (removed 95) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-26 23:37:25] [INFO ] Computed 2464 invariants in 52 ms
[2024-05-26 23:37:29] [INFO ] Implicit Places using invariants in 3986 ms returned []
[2024-05-26 23:37:29] [INFO ] Invariant cache hit.
[2024-05-26 23:37:36] [INFO ] Implicit Places using invariants and state equation in 6744 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]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10732 ms to find 29 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2874/2998 places, 441/446 transitions.
Applied a total of 0 rules in 150 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11197 ms. Remains : 2874/2998 places, 441/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(LEQ s0 (ADD s2843 s2844 s2845 s2846 s2847 s2848 s2849 s2850 s2851 s2852 s2853 s2854 s2855 s2856 s2857 s2858 s2859 s2860 s2861 s2862 s2863 s2864 s2865 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2817 reset in 460 ms.
Product exploration explored 100000 steps with 2814 reset in 485 ms.
Computed a total of 2874 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2874 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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 283 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 441 rows 2874 cols
[2024-05-26 23:37:38] [INFO ] Computed 2436 invariants in 49 ms
[2024-05-26 23:37:39] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 450 ms returned sat
[2024-05-26 23:37:39] [INFO ] After 925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 23:37:40] [INFO ] [Nat]Absence check using 0 positive and 2436 generalized place invariants in 472 ms returned sat
[2024-05-26 23:37:43] [INFO ] After 2386ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-26 23:37:48] [INFO ] After 7638ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 5505 ms.
[2024-05-26 23:37:54] [INFO ] After 14172ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 147 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=16 )
Parikh walk visited 3 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p0))), (F p1), (F (AND p1 (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 8 factoid took 977 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 342 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-26 23:37:55] [INFO ] Invariant cache hit.
[2024-05-26 23:38:00] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3918 ms returned sat
[2024-05-26 23:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:38:10] [INFO ] [Real]Absence check using state equation in 10219 ms returned unknown
Could not prove EG (NOT p2)
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 131 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-26 23:38:10] [INFO ] Invariant cache hit.
[2024-05-26 23:38:14] [INFO ] Implicit Places using invariants in 3975 ms returned []
[2024-05-26 23:38:14] [INFO ] Invariant cache hit.
[2024-05-26 23:38:22] [INFO ] Implicit Places using invariants and state equation in 7154 ms returned []
Implicit Place search using SMT with State Equation took 11134 ms to find 0 implicit places.
[2024-05-26 23:38:22] [INFO ] Invariant cache hit.
[2024-05-26 23:38:23] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12263 ms. Remains : 2874/2874 places, 441/441 transitions.
Computed a total of 2874 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2874 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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 258 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 280 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 23:38:24] [INFO ] Invariant cache hit.
[2024-05-26 23:38:25] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 487 ms returned sat
[2024-05-26 23:38:25] [INFO ] After 949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 23:38:26] [INFO ] [Nat]Absence check using 0 positive and 2436 generalized place invariants in 485 ms returned sat
[2024-05-26 23:38:28] [INFO ] After 2737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 23:38:39] [INFO ] After 12912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3617 ms.
[2024-05-26 23:38:42] [INFO ] After 17481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 153 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=30 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p0))), (F p1), (F (AND p1 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 971 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-26 23:38:44] [INFO ] Invariant cache hit.
[2024-05-26 23:38:49] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 3904 ms returned sat
[2024-05-26 23:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 23:38:59] [INFO ] [Real]Absence check using state equation in 10229 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 361 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 2812 reset in 466 ms.
Product exploration explored 100000 steps with 2815 reset in 494 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 149 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-26 23:39:01] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-26 23:39:01] [INFO ] Invariant cache hit.
[2024-05-26 23:39:02] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1207 ms. Remains : 2874/2874 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin11852968218655556035
[2024-05-26 23:39:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11852968218655556035
Running compilation step : cd /tmp/ltsmin11852968218655556035;'/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 1803 ms.
Running link step : cd /tmp/ltsmin11852968218655556035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11852968218655556035;'/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/stateBased1641392198199839412.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 131 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-26 23:39:17] [INFO ] Invariant cache hit.
[2024-05-26 23:39:21] [INFO ] Implicit Places using invariants in 3921 ms returned []
[2024-05-26 23:39:21] [INFO ] Invariant cache hit.
[2024-05-26 23:39:28] [INFO ] Implicit Places using invariants and state equation in 7208 ms returned []
Implicit Place search using SMT with State Equation took 11131 ms to find 0 implicit places.
[2024-05-26 23:39:28] [INFO ] Invariant cache hit.
[2024-05-26 23:39:29] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12312 ms. Remains : 2874/2874 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin6989221420733765105
[2024-05-26 23:39:29] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6989221420733765105
Running compilation step : cd /tmp/ltsmin6989221420733765105;'/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 1767 ms.
Running link step : cd /tmp/ltsmin6989221420733765105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6989221420733765105;'/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/stateBased13311869317912807293.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:39:44] [INFO ] Flatten gal took : 66 ms
[2024-05-26 23:39:44] [INFO ] Flatten gal took : 57 ms
[2024-05-26 23:39:44] [INFO ] Time to serialize gal into /tmp/LTL10066753270221911087.gal : 8 ms
[2024-05-26 23:39:44] [INFO ] Time to serialize properties into /tmp/LTL8505987392577689155.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/LTL10066753270221911087.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9725355820127747242.hoa' '-atoms' '/tmp/LTL8505987392577689155.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...318
Loading property file /tmp/LTL8505987392577689155.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9725355820127747242.hoa
Detected timeout of ITS tools.
[2024-05-26 23:40:00] [INFO ] Flatten gal took : 58 ms
[2024-05-26 23:40:00] [INFO ] Flatten gal took : 56 ms
[2024-05-26 23:40:00] [INFO ] Time to serialize gal into /tmp/LTL15538767124851199727.gal : 7 ms
[2024-05-26 23:40:00] [INFO ] Time to serialize properties into /tmp/LTL17174526566870393298.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/LTL15538767124851199727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17174526566870393298.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...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X((G(F("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart...872
Formula 0 simplified : X(XX(FG!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+C...857
Detected timeout of ITS tools.
[2024-05-26 23:40:15] [INFO ] Flatten gal took : 58 ms
[2024-05-26 23:40:15] [INFO ] Applying decomposition
[2024-05-26 23:40:15] [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/graph13940184677127130301.txt' '-o' '/tmp/graph13940184677127130301.bin' '-w' '/tmp/graph13940184677127130301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13940184677127130301.bin' '-l' '-1' '-v' '-w' '/tmp/graph13940184677127130301.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:40:15] [INFO ] Decomposing Gal with order
[2024-05-26 23:40:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:40:15] [INFO ] Removed a total of 290 redundant transitions.
[2024-05-26 23:40:15] [INFO ] Flatten gal took : 122 ms
[2024-05-26 23:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 396 labels/synchronizations in 61 ms.
[2024-05-26 23:40:16] [INFO ] Time to serialize gal into /tmp/LTL18349897758759767146.gal : 46 ms
[2024-05-26 23:40:16] [INFO ] Time to serialize properties into /tmp/LTL9914319793587102770.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/LTL18349897758759767146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9914319793587102770.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((X(X((G(F("((((((gu40.Cstart_0+gu40.Cstart_1)+(gu40.Cstart_2+gu40.Cstart_3))+((gu40.Cstart_4+gu40.Cstart_5)+(gu40.Cstart_6+gu40.C...1282
Formula 0 simplified : X(XX(FG!"((((((gu40.Cstart_0+gu40.Cstart_1)+(gu40.Cstart_2+gu40.Cstart_3))+((gu40.Cstart_4+gu40.Cstart_5)+(gu40.Cstart_6+gu40.Cstart...1267
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin447406810215302951
[2024-05-26 23:40:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin447406810215302951
Running compilation step : cd /tmp/ltsmin447406810215302951;'/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 1772 ms.
Running link step : cd /tmp/ltsmin447406810215302951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin447406810215302951;'/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((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-13 finished in 201391 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((p0 U (G(p0)||(p0&&(p1||F(!p2)))))) U (!p0&&G(p3))))'
[2024-05-26 23:40:46] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17462736990310007339
[2024-05-26 23:40:46] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2024-05-26 23:40:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:40:46] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2024-05-26 23:40:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:40:46] [INFO ] Applying decomposition
[2024-05-26 23:40:46] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2024-05-26 23:40:46] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:40:46] [INFO ] Flatten gal took : 59 ms
[2024-05-26 23:40:46] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17462736990310007339
Running compilation step : cd /tmp/ltsmin17462736990310007339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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/graph13591672924843336133.txt' '-o' '/tmp/graph13591672924843336133.bin' '-w' '/tmp/graph13591672924843336133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13591672924843336133.bin' '-l' '-1' '-v' '-w' '/tmp/graph13591672924843336133.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:40:48] [INFO ] Decomposing Gal with order
[2024-05-26 23:40:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:40:48] [INFO ] Removed a total of 314 redundant transitions.
[2024-05-26 23:40:48] [INFO ] Flatten gal took : 119 ms
[2024-05-26 23:40:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 5 ms.
[2024-05-26 23:40:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality15194321575852498044.gal : 12 ms
[2024-05-26 23:40:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality11367827419807278285.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/LTLCardinality15194321575852498044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11367827419807278285.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...299
Read 2 LTL properties
Checking formula 0 : !((X((X(X((G(F("((((((gu63.Cstart_0+gu63.Cstart_1)+(gu63.Cstart_2+gu63.Cstart_3))+((gu63.Cstart_4+gu63.Cstart_5)+(gu63.Cstart_6+gu63.C...1432
Formula 0 simplified : X(XX(FG!"((((((gu63.Cstart_0+gu63.Cstart_1)+(gu63.Cstart_2+gu63.Cstart_3))+((gu63.Cstart_4+gu63.Cstart_5)+(gu63.Cstart_6+gu63.Cstart...1417
Compilation finished in 2553 ms.
Running link step : cd /tmp/ltsmin17462736990310007339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17462736990310007339;'/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((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: LTL layer: formula: X((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))
pins2lts-mc-linux64( 4/ 8), 0.036: "X((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.037: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.390: There are 454 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.390: State length is 2999, there are 467 groups
pins2lts-mc-linux64( 0/ 8), 0.390: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.390: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.390: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.390: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.562: [Blue] ~32 levels ~960 states ~6480 transitions
pins2lts-mc-linux64( 4/ 8), 0.635: [Blue] ~32 levels ~1920 states ~10944 transitions
pins2lts-mc-linux64( 4/ 8), 0.755: [Blue] ~32 levels ~3840 states ~21320 transitions
pins2lts-mc-linux64( 4/ 8), 0.997: [Blue] ~32 levels ~7680 states ~43384 transitions
pins2lts-mc-linux64( 4/ 8), 1.434: [Blue] ~32 levels ~15360 states ~92784 transitions
pins2lts-mc-linux64( 1/ 8), 2.275: [Blue] ~37 levels ~30720 states ~151744 transitions
pins2lts-mc-linux64( 2/ 8), 3.806: [Blue] ~38 levels ~61440 states ~301472 transitions
pins2lts-mc-linux64( 1/ 8), 6.973: [Blue] ~37 levels ~122880 states ~630856 transitions
pins2lts-mc-linux64( 1/ 8), 13.320: [Blue] ~37 levels ~245760 states ~1336352 transitions
pins2lts-mc-linux64( 1/ 8), 25.414: [Blue] ~37 levels ~491520 states ~2909808 transitions
pins2lts-mc-linux64( 2/ 8), 49.096: [Blue] ~38 levels ~983040 states ~6215584 transitions
pins2lts-mc-linux64( 2/ 8), 96.697: [Blue] ~39 levels ~1966080 states ~12585816 transitions
pins2lts-mc-linux64( 1/ 8), 192.429: [Blue] ~37 levels ~3932160 states ~26498960 transitions
pins2lts-mc-linux64( 1/ 8), 384.587: [Blue] ~37 levels ~7864320 states ~56397912 transitions
pins2lts-mc-linux64( 2/ 8), 438.907: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 439.040:
pins2lts-mc-linux64( 0/ 8), 439.040: Explored 8286402 states 63961045 transitions, fanout: 7.719
pins2lts-mc-linux64( 0/ 8), 439.040: Total exploration time 438.620 sec (438.500 sec minimum, 438.540 sec on average)
pins2lts-mc-linux64( 0/ 8), 439.040: States per second: 18892, Transitions per second: 145823
pins2lts-mc-linux64( 0/ 8), 439.040:
pins2lts-mc-linux64( 0/ 8), 439.040: State space has 8289371 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 439.040: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 439.040: blue states: 8286402 (99.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 439.040: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 439.040: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 439.040:
pins2lts-mc-linux64( 0/ 8), 439.040: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 439.040:
pins2lts-mc-linux64( 0/ 8), 439.040: Queue width: 8B, total height: 279, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 439.040: Tree memory: 319.2MB, 40.4 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 439.040: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 439.040: Stored 448 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 439.040: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 439.040: Est. total memory use: 319.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17462736990310007339;'/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((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17462736990310007339;'/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((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==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:05:57] [INFO ] Applying decomposition
[2024-05-27 00:05:57] [INFO ] Flatten gal took : 545 ms
[2024-05-27 00:05:57] [INFO ] Decomposing Gal with order
[2024-05-27 00:05:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:05:58] [INFO ] Removed a total of 412 redundant transitions.
[2024-05-27 00:05:59] [INFO ] Flatten gal took : 786 ms
[2024-05-27 00:05:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 359 ms.
[2024-05-27 00:06:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality16211048333480441996.gal : 44 ms
[2024-05-27 00:06:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality9162187610339085109.ltl : 19 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/LTLCardinality16211048333480441996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9162187610339085109.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...298
Read 2 LTL properties
Checking formula 0 : !((X((X(X((G(F("((((((gtsid0.Cstart_0+gtsid1.Cstart_1)+(gtsid2.Cstart_2+gtsid3.Cstart_3))+((gtsid4.Cstart_4+gtsid5.Cstart_5)+(gtsid6.C...1559
Formula 0 simplified : X(XX(FG!"((((((gtsid0.Cstart_0+gtsid1.Cstart_1)+(gtsid2.Cstart_2+gtsid3.Cstart_3))+((gtsid4.Cstart_4+gtsid5.Cstart_5)+(gtsid6.Cstart...1544
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 135008 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15887284 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-171662361400027"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;