Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678982586082

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 16:03:07] [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]
[2023-03-16 16:03:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 16:03:07] [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.
[2023-03-16 16:03:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 16:03:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 469 ms
[2023-03-16 16:03:08] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 16:03:08] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 14 ms.
[2023-03-16 16:03:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 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 10011 steps, including 304 resets, run finished after 143 ms. (steps per millisecond=70 ) properties (out of 22) seen :11
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 16:03:10] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-16 16:03:10] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-16 16:03:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 16:03:10] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-16 16:03:10] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 16:03:10] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 9 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 9 properties in 12 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-16 16:03:10] [INFO ] Flatten gal took : 23 ms
[2023-03-16 16:03:10] [INFO ] Flatten gal took : 4 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2023-03-16 16:03:10] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 20 ms.
[2023-03-16 16:03:10] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 1386 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1964 transition count 356
Applied a total of 2 rules in 58 ms. Remains 1964 /1966 variables (removed 2) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1964 cols
[2023-03-16 16:03:11] [INFO ] Computed 1609 place invariants in 59 ms
[2023-03-16 16:03:12] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2023-03-16 16:03:12] [INFO ] Invariant cache hit.
[2023-03-16 16:03:14] [INFO ] Implicit Places using invariants and state equation in 1991 ms returned []
Implicit Place search using SMT with State Equation took 3075 ms to find 0 implicit places.
[2023-03-16 16:03:14] [INFO ] Invariant cache hit.
[2023-03-16 16:03:14] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1964/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3844 ms. Remains : 1964/1966 places, 356/356 transitions.
Support contains 1386 out of 1964 places after structural reductions.
[2023-03-16 16:03:14] [INFO ] Flatten gal took : 108 ms
[2023-03-16 16:03:14] [INFO ] Flatten gal took : 74 ms
[2023-03-16 16:03:15] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-16 16:03:15] [INFO ] Invariant cache hit.
[2023-03-16 16:03:16] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-16 16:03:16] [INFO ] [Real]Absence check using 1 positive and 1608 generalized place invariants in 298 ms returned sat
[2023-03-16 16:03:16] [INFO ] After 1058ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-16 16:03:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 16:03:17] [INFO ] [Nat]Absence check using 1 positive and 1608 generalized place invariants in 286 ms returned sat
[2023-03-16 16:03:34] [INFO ] After 16641ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2023-03-16 16:03:41] [INFO ] After 23569ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-16 16:03:41] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 13 properties in 30 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 1964 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1964 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 46 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1916 transition count 356
Applied a total of 48 rules in 224 ms. Remains 1916 /1964 variables (removed 48) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 16:03:42] [INFO ] Computed 1562 place invariants in 53 ms
[2023-03-16 16:03:44] [INFO ] Implicit Places using invariants in 2152 ms returned []
[2023-03-16 16:03:44] [INFO ] Invariant cache hit.
[2023-03-16 16:03:48] [INFO ] Implicit Places using invariants and state equation in 3818 ms returned []
Implicit Place search using SMT with State Equation took 5977 ms to find 0 implicit places.
[2023-03-16 16:03:48] [INFO ] Invariant cache hit.
[2023-03-16 16:03:48] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1964 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6864 ms. Remains : 1916/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s1749 s1750 s1751 s1752 s1753 s1754 s1755 s1756 s1757 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1765 s1766 s1767 s1768 s1769 s1770 s1771) (AD...], 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][false, false, false]]
Product exploration explored 100000 steps with 3714 reset in 495 ms.
Product exploration explored 100000 steps with 3711 reset in 451 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Finished Best-First random walk after 7355 steps, including 14 resets, run visited all 1 properties in 13 ms. (steps per millisecond=565 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-16 16:03:51] [INFO ] Invariant cache hit.
[2023-03-16 16:03:53] [INFO ] Implicit Places using invariants in 2072 ms returned []
[2023-03-16 16:03:53] [INFO ] Invariant cache hit.
[2023-03-16 16:03:57] [INFO ] Implicit Places using invariants and state equation in 3936 ms returned []
Implicit Place search using SMT with State Equation took 6017 ms to find 0 implicit places.
[2023-03-16 16:03:57] [INFO ] Invariant cache hit.
[2023-03-16 16:03:57] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6691 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 373 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished Best-First random walk after 4369 steps, including 7 resets, run visited all 1 properties in 8 ms. (steps per millisecond=546 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3712 reset in 411 ms.
Product exploration explored 100000 steps with 3715 reset in 424 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 765 are kept as prefixes of interest. Removing 1151 places using SCC suffix rule.16 ms
Discarding 1151 places :
Also discarding 71 output transitions
Drop transitions removed 71 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 765 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 765 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 71 rules in 115 ms. Remains 765 /1916 variables (removed 1151) and now considering 219/356 (removed 137) transitions.
[2023-03-16 16:04:00] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 219 rows 765 cols
[2023-03-16 16:04:00] [INFO ] Computed 550 place invariants in 3 ms
[2023-03-16 16:04:00] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 765/1916 places, 219/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 371 ms. Remains : 765/1916 places, 219/356 transitions.
Built C files in :
/tmp/ltsmin9105536339006143720
[2023-03-16 16:04:00] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9105536339006143720
Running compilation step : cd /tmp/ltsmin9105536339006143720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1495 ms.
Running link step : cd /tmp/ltsmin9105536339006143720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9105536339006143720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14844244740582836887.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 74 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 16:04:15] [INFO ] Computed 1562 place invariants in 33 ms
[2023-03-16 16:04:17] [INFO ] Implicit Places using invariants in 2152 ms returned []
[2023-03-16 16:04:17] [INFO ] Invariant cache hit.
[2023-03-16 16:04:22] [INFO ] Implicit Places using invariants and state equation in 4122 ms returned []
Implicit Place search using SMT with State Equation took 6277 ms to find 0 implicit places.
[2023-03-16 16:04:22] [INFO ] Invariant cache hit.
[2023-03-16 16:04:22] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6966 ms. Remains : 1916/1916 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin11306283056914484044
[2023-03-16 16:04:22] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11306283056914484044
Running compilation step : cd /tmp/ltsmin11306283056914484044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1598 ms.
Running link step : cd /tmp/ltsmin11306283056914484044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11306283056914484044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14135628170917531821.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 16:04:37] [INFO ] Flatten gal took : 53 ms
[2023-03-16 16:04:38] [INFO ] Flatten gal took : 52 ms
[2023-03-16 16:04:38] [INFO ] Time to serialize gal into /tmp/LTL14594882835470164383.gal : 12 ms
[2023-03-16 16:04:38] [INFO ] Time to serialize properties into /tmp/LTL17483271349518118690.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14594882835470164383.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9764684759271727858.hoa' '-atoms' '/tmp/LTL17483271349518118690.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Csta...471
Formula 0 simplified : XF!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Cstart...465
Detected timeout of ITS tools.
[2023-03-16 16:05:08] [INFO ] Flatten gal took : 48 ms
[2023-03-16 16:05:08] [INFO ] Applying decomposition
[2023-03-16 16:05:08] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5759820074965685965.txt' '-o' '/tmp/graph5759820074965685965.bin' '-w' '/tmp/graph5759820074965685965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5759820074965685965.bin' '-l' '-1' '-v' '-w' '/tmp/graph5759820074965685965.weights' '-q' '0' '-e' '0.001'
[2023-03-16 16:05:08] [INFO ] Decomposing Gal with order
[2023-03-16 16:05:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 16:05:08] [INFO ] Removed a total of 228 redundant transitions.
[2023-03-16 16:05:08] [INFO ] Flatten gal took : 246 ms
[2023-03-16 16:05:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 384 labels/synchronizations in 141 ms.
[2023-03-16 16:05:09] [INFO ] Time to serialize gal into /tmp/LTL3784466523631794847.gal : 20 ms
[2023-03-16 16:05:09] [INFO ] Time to serialize properties into /tmp/LTL12823263924542810849.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3784466523631794847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12823263924542810849.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((gu50.Cstart_0+gu50.Cstart_1)+(gu50.Cstart_2+gu50.Cstart_3))+((gu50.Cstart_4+gu50.Cstart_5)+(gu50.Cstart_6+gu50.Cstart_7)...701
Formula 0 simplified : XF!"((((((gu50.Cstart_0+gu50.Cstart_1)+(gu50.Cstart_2+gu50.Cstart_3))+((gu50.Cstart_4+gu50.Cstart_5)+(gu50.Cstart_6+gu50.Cstart_7)))...695
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin304324239963178051
[2023-03-16 16:05:24] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin304324239963178051
Running compilation step : cd /tmp/ltsmin304324239963178051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1190 ms.
Running link step : cd /tmp/ltsmin304324239963178051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin304324239963178051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-02 finished in 117728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 47 out of 1964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 1939 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.18 ms
Discarding 25 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 1938 transition count 355
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 1938 transition count 355
Applied a total of 4 rules in 298 ms. Remains 1938 /1964 variables (removed 26) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1938 cols
[2023-03-16 16:05:40] [INFO ] Computed 1585 place invariants in 24 ms
[2023-03-16 16:05:42] [INFO ] Implicit Places using invariants in 2138 ms returned []
[2023-03-16 16:05:42] [INFO ] Invariant cache hit.
[2023-03-16 16:05:46] [INFO ] Implicit Places using invariants and state equation in 4303 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6452 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1915/1964 places, 355/356 transitions.
Applied a total of 0 rules in 89 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6841 ms. Remains : 1915/1964 places, 355/356 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s1892 s1893 s1894 s1895 s1896 s1897 s1898 s1899 s1900 s1901 s1902 s1903 s1904 s1905 s1906 s1907 s1908 s1909 s1910 s1911 s1912 s1913 s1914) s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3710 reset in 363 ms.
Product exploration explored 100000 steps with 3717 reset in 315 ms.
Computed a total of 1915 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1915 transition count 355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 355 rows 1915 cols
[2023-03-16 16:05:48] [INFO ] Computed 1562 place invariants in 14 ms
[2023-03-16 16:05:48] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 16:05:48] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 273 ms returned sat
[2023-03-16 16:05:49] [INFO ] After 1129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 16:05:50] [INFO ] After 1711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 631 ms.
[2023-03-16 16:05:51] [INFO ] After 2873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 47 out of 1915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1915/1915 places, 355/355 transitions.
Applied a total of 0 rules in 86 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-16 16:05:51] [INFO ] Invariant cache hit.
[2023-03-16 16:05:53] [INFO ] Implicit Places using invariants in 2076 ms returned []
[2023-03-16 16:05:53] [INFO ] Invariant cache hit.
[2023-03-16 16:05:57] [INFO ] Implicit Places using invariants and state equation in 3529 ms returned []
Implicit Place search using SMT with State Equation took 5606 ms to find 0 implicit places.
[2023-03-16 16:05:57] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-16 16:05:57] [INFO ] Invariant cache hit.
[2023-03-16 16:05:57] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6343 ms. Remains : 1915/1915 places, 355/355 transitions.
Computed a total of 1915 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1915 transition count 355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 16:05:58] [INFO ] Invariant cache hit.
[2023-03-16 16:05:58] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 16:05:59] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 246 ms returned sat
[2023-03-16 16:06:00] [INFO ] After 1159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 16:06:01] [INFO ] After 1731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 629 ms.
[2023-03-16 16:06:01] [INFO ] After 2874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 888 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3710 reset in 279 ms.
Product exploration explored 100000 steps with 3712 reset in 294 ms.
Built C files in :
/tmp/ltsmin1824614920749855290
[2023-03-16 16:06:03] [INFO ] Computing symmetric may disable matrix : 355 transitions.
[2023-03-16 16:06:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:06:03] [INFO ] Computing symmetric may enable matrix : 355 transitions.
[2023-03-16 16:06:03] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:06:03] [INFO ] Computing Do-Not-Accords matrix : 355 transitions.
[2023-03-16 16:06:03] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:06:03] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1824614920749855290
Running compilation step : cd /tmp/ltsmin1824614920749855290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1444 ms.
Running link step : cd /tmp/ltsmin1824614920749855290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1824614920749855290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15767285596867030895.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 47 out of 1915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1915/1915 places, 355/355 transitions.
Applied a total of 0 rules in 96 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-16 16:06:18] [INFO ] Invariant cache hit.
[2023-03-16 16:06:20] [INFO ] Implicit Places using invariants in 2135 ms returned []
[2023-03-16 16:06:20] [INFO ] Invariant cache hit.
[2023-03-16 16:06:24] [INFO ] Implicit Places using invariants and state equation in 3801 ms returned []
Implicit Place search using SMT with State Equation took 5938 ms to find 0 implicit places.
[2023-03-16 16:06:24] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 16:06:24] [INFO ] Invariant cache hit.
[2023-03-16 16:06:25] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6729 ms. Remains : 1915/1915 places, 355/355 transitions.
Built C files in :
/tmp/ltsmin1778680292625242257
[2023-03-16 16:06:25] [INFO ] Computing symmetric may disable matrix : 355 transitions.
[2023-03-16 16:06:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:06:25] [INFO ] Computing symmetric may enable matrix : 355 transitions.
[2023-03-16 16:06:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:06:25] [INFO ] Computing Do-Not-Accords matrix : 355 transitions.
[2023-03-16 16:06:25] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:06:25] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1778680292625242257
Running compilation step : cd /tmp/ltsmin1778680292625242257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1405 ms.
Running link step : cd /tmp/ltsmin1778680292625242257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1778680292625242257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16914524919829923090.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 16:06:40] [INFO ] Flatten gal took : 51 ms
[2023-03-16 16:06:40] [INFO ] Flatten gal took : 46 ms
[2023-03-16 16:06:41] [INFO ] Time to serialize gal into /tmp/LTL15267356736331696692.gal : 983 ms
[2023-03-16 16:06:41] [INFO ] Time to serialize properties into /tmp/LTL9351609813408962436.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15267356736331696692.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15907019738403480548.hoa' '-atoms' '/tmp/LTL9351609813408962436.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))))+(((n1_1...515
Formula 0 simplified : G(F!"((((((CstopOK_0+CstopOK_1)+(CstopOK_2+CstopOK_3))+((CstopOK_4+CstopOK_5)+(CstopOK_6+CstopOK_7)))+(((CstopOK_8+CstopOK_9)+(Cstop...508
Detected timeout of ITS tools.
[2023-03-16 16:07:11] [INFO ] Flatten gal took : 39 ms
[2023-03-16 16:07:11] [INFO ] Applying decomposition
[2023-03-16 16:07:11] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10034090759613339672.txt' '-o' '/tmp/graph10034090759613339672.bin' '-w' '/tmp/graph10034090759613339672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10034090759613339672.bin' '-l' '-1' '-v' '-w' '/tmp/graph10034090759613339672.weights' '-q' '0' '-e' '0.001'
[2023-03-16 16:07:11] [INFO ] Decomposing Gal with order
[2023-03-16 16:07:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 16:07:12] [INFO ] Removed a total of 275 redundant transitions.
[2023-03-16 16:07:12] [INFO ] Flatten gal took : 105 ms
[2023-03-16 16:07:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 352 labels/synchronizations in 71 ms.
[2023-03-16 16:07:12] [INFO ] Time to serialize gal into /tmp/LTL7443001052579664068.gal : 20 ms
[2023-03-16 16:07:12] [INFO ] Time to serialize properties into /tmp/LTL14439024998693763023.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7443001052579664068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14439024998693763023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((gu64.n1_0+gu64.n1_1)+(gu64.n1_2+gu64.n1_3))+((gu64.n1_4+gu64.n1_5)+(gu64.n1_6+gu64.n1_7)))+(((gu64.n1_8+gu64.n1_9)+(gu6...774
Formula 0 simplified : G(F!"((((((gu133.CstopOK_0+gu133.CstopOK_1)+(gu133.CstopOK_2+gu133.CstopOK_3))+((gu133.CstopOK_4+gu133.CstopOK_5)+(gu133.CstopOK_6+g...767
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9873066291859957650
[2023-03-16 16:07:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9873066291859957650
Running compilation step : cd /tmp/ltsmin9873066291859957650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1494 ms.
Running link step : cd /tmp/ltsmin9873066291859957650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9873066291859957650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-03 finished in 122744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U X((X(G(p2)) U G(p3))))))'
Support contains 71 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 1917 transition count 356
Applied a total of 47 rules in 71 ms. Remains 1917 /1964 variables (removed 47) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2023-03-16 16:07:42] [INFO ] Computed 1563 place invariants in 104 ms
[2023-03-16 16:07:45] [INFO ] Implicit Places using invariants in 2554 ms returned []
[2023-03-16 16:07:45] [INFO ] Invariant cache hit.
[2023-03-16 16:07:49] [INFO ] Implicit Places using invariants and state equation in 4096 ms returned []
Implicit Place search using SMT with State Equation took 6653 ms to find 0 implicit places.
[2023-03-16 16:07:49] [INFO ] Invariant cache hit.
[2023-03-16 16:07:49] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1917/1964 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7441 ms. Remains : 1917/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p2)), true, (AND (NOT p3) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 4}, { cond=p3, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(GT s1916 (ADD s1658 s1659 s1660 s1661 s1662 s1663 s1664 s1665 s1666 s1667 s1668 s1669 s1670 s1671 s1672 s1673 s1674 s1675 s1676 s1677 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-04 finished in 7814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 552 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1916 transition count 356
Applied a total of 48 rules in 38 ms. Remains 1916 /1964 variables (removed 48) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 16:07:50] [INFO ] Computed 1562 place invariants in 54 ms
[2023-03-16 16:07:51] [INFO ] Implicit Places using invariants in 1467 ms returned []
[2023-03-16 16:07:51] [INFO ] Invariant cache hit.
[2023-03-16 16:07:54] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 3813 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1964 places, 356/356 transitions.
Applied a total of 0 rules in 36 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3887 ms. Remains : 1893/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 825 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1595 s1596 s1597 s1598 s1599 s1600 s1601 s1602 s1603 s1604 s1605 s1606 s1607 s1608 s1609 s1610) (AD...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-06 finished in 4732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((X(G(p1)) U (p0&&X(G(p1)))))))))'
Support contains 70 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1916 transition count 356
Applied a total of 48 rules in 72 ms. Remains 1916 /1964 variables (removed 48) and now considering 356/356 (removed 0) transitions.
[2023-03-16 16:07:55] [INFO ] Invariant cache hit.
[2023-03-16 16:07:57] [INFO ] Implicit Places using invariants in 2030 ms returned []
[2023-03-16 16:07:57] [INFO ] Invariant cache hit.
[2023-03-16 16:08:00] [INFO ] Implicit Places using invariants and state equation in 3527 ms returned []
Implicit Place search using SMT with State Equation took 5559 ms to find 0 implicit places.
[2023-03-16 16:08:00] [INFO ] Invariant cache hit.
[2023-03-16 16:08:01] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1964 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6299 ms. Remains : 1916/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s1864 s1865 s1866 s1867 s1868 s1869 s1870 s1871 s1872 s1873 s1874 s1875 s1876 s1877 s1878 s1879 s1880 s1881 s1882 s1883 s1884 s1885 s1886) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 818 ms.
Product exploration explored 100000 steps with 33333 reset in 790 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-07 finished in 8623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((G(F(p0)) U p0) U !p1)))'
Support contains 555 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 1917 transition count 356
Applied a total of 47 rules in 35 ms. Remains 1917 /1964 variables (removed 47) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2023-03-16 16:08:03] [INFO ] Computed 1562 place invariants in 19 ms
[2023-03-16 16:08:05] [INFO ] Implicit Places using invariants in 1807 ms returned []
[2023-03-16 16:08:05] [INFO ] Invariant cache hit.
[2023-03-16 16:08:09] [INFO ] Implicit Places using invariants and state equation in 3531 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5342 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1964 places, 356/356 transitions.
Applied a total of 0 rules in 35 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5412 ms. Remains : 1894/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 854 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1893 s1889), p1:(AND (LEQ (ADD s1059 s1060 s1061 s1062 s1063 s1064 s1065 s1066 s1067 s1068 s1069 s1070 s1071 s1072 s1073 s1074 s1075 s1076 s1077 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][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-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-09 finished in 6308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 46 out of 1964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 1892 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.8 ms
Discarding 72 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 1889 transition count 351
Applied a total of 5 rules in 171 ms. Remains 1889 /1964 variables (removed 75) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2023-03-16 16:08:10] [INFO ] Computed 1540 place invariants in 34 ms
[2023-03-16 16:08:12] [INFO ] Implicit Places using invariants in 2103 ms returned []
[2023-03-16 16:08:12] [INFO ] Invariant cache hit.
[2023-03-16 16:08:15] [INFO ] Implicit Places using invariants and state equation in 3591 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 5696 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/1964 places, 351/356 transitions.
Applied a total of 0 rules in 79 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5947 ms. Remains : 1843/1964 places, 351/356 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-10 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 s1611 s1612 s1613 s1614 s1615 s1616 s1617 s1618 s1619 s1620 s1621 s1622 s1623 s1624 s1625 s1626 s1627 s1628 s1629 s1630 s1631 s1632 s1633) (AD...], 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 27 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-10 finished in 6034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1 U X(p2)))))'
Support contains 622 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1939 transition count 356
Applied a total of 25 rules in 37 ms. Remains 1939 /1964 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1939 cols
[2023-03-16 16:08:16] [INFO ] Computed 1585 place invariants in 8 ms
[2023-03-16 16:08:17] [INFO ] Implicit Places using invariants in 1374 ms returned []
[2023-03-16 16:08:17] [INFO ] Invariant cache hit.
[2023-03-16 16:08:19] [INFO ] Implicit Places using invariants and state equation in 2494 ms returned []
Implicit Place search using SMT with State Equation took 3870 ms to find 0 implicit places.
[2023-03-16 16:08:19] [INFO ] Invariant cache hit.
[2023-03-16 16:08:20] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1939/1964 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4522 ms. Remains : 1939/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(LEQ (ADD s1726 s1727 s1728 s1729 s1730 s1731 s1732 s1733 s1734 s1735 s1736 s1737 s1738 s1739 s1740 s1741 s1742 s1743 s1744 s1745 s1746 s1747 s1748) (A...], 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]]
Stuttering criterion allowed to conclude after 542 steps with 19 reset in 5 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-11 finished in 4751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(p1)))))'
Support contains 47 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1939 transition count 356
Applied a total of 25 rules in 66 ms. Remains 1939 /1964 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1939 cols
[2023-03-16 16:08:20] [INFO ] Computed 1585 place invariants in 16 ms
[2023-03-16 16:08:22] [INFO ] Implicit Places using invariants in 2092 ms returned []
[2023-03-16 16:08:22] [INFO ] Invariant cache hit.
[2023-03-16 16:08:26] [INFO ] Implicit Places using invariants and state equation in 3776 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5870 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1916/1964 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6000 ms. Remains : 1916/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1680 s1681 s1682 s1683 s1684 s1685 s1686 s1687 s1688 s1689 s1690 s1691 s1692 s1693 s1694 s1695 s1696 s1697 s1698 s1699 s1700 s1701 s1702) (A...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-12 finished in 6175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 48 out of 1964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 1917 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.9 ms
Discarding 47 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 1916 transition count 355
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 1916 transition count 355
Applied a total of 4 rules in 221 ms. Remains 1916 /1964 variables (removed 48) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1916 cols
[2023-03-16 16:08:27] [INFO ] Computed 1562 place invariants in 26 ms
[2023-03-16 16:08:29] [INFO ] Implicit Places using invariants in 2080 ms returned []
[2023-03-16 16:08:29] [INFO ] Invariant cache hit.
[2023-03-16 16:08:32] [INFO ] Implicit Places using invariants and state equation in 3643 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5725 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1893/1964 places, 355/356 transitions.
Applied a total of 0 rules in 78 ms. Remains 1893 /1893 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6024 ms. Remains : 1893/1964 places, 355/356 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NOT (LEQ s1892 s1888)) (GT (ADD s1795 s1796 s1797 s1798 s1799 s1800 s1801 s1802 s1803 s1804 s1805 s1806 s1807 s1808 s1809 s1810 s1811 s1812 s1813 ...], 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 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-13 finished in 6099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 24 out of 1964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 48 are kept as prefixes of interest. Removing 1916 places using SCC suffix rule.3 ms
Discarding 1916 places :
Also discarding 171 output transitions
Drop transitions removed 171 transitions
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 48 transition count 48
Applied a total of 138 rules in 8 ms. Remains 48 /1964 variables (removed 1916) and now considering 48/356 (removed 308) transitions.
// Phase 1: matrix 48 rows 48 cols
[2023-03-16 16:08:33] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-16 16:08:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 16:08:33] [INFO ] Invariant cache hit.
[2023-03-16 16:08:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-16 16:08:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 16:08:33] [INFO ] Invariant cache hit.
[2023-03-16 16:08:33] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/1964 places, 48/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 48/1964 places, 48/356 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s47 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23))], 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 3845 reset in 279 ms.
Product exploration explored 100000 steps with 3845 reset in 330 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 48
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 (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 106 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-22-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-14 finished in 917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLCardinality-02
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 765 are kept as prefixes of interest. Removing 1199 places using SCC suffix rule.9 ms
Discarding 1199 places :
Also discarding 71 output transitions
Drop transitions removed 71 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 764 transition count 216
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 1 with 4 rules applied. Total rules applied 73 place count 762 transition count 214
Applied a total of 73 rules in 51 ms. Remains 762 /1964 variables (removed 1202) and now considering 214/356 (removed 142) transitions.
// Phase 1: matrix 214 rows 762 cols
[2023-03-16 16:08:34] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-16 16:08:34] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-16 16:08:34] [INFO ] Invariant cache hit.
[2023-03-16 16:08:35] [INFO ] Implicit Places using invariants and state equation in 763 ms returned [622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 1280 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 739/1964 places, 214/356 transitions.
Applied a total of 0 rules in 12 ms. Remains 739 /739 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1344 ms. Remains : 739/1964 places, 214/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s633 s634 s635 s636 s637 s638 s639 s640 s641 s642 s643 s644) (ADD s599 s600 s601 s602 s...], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3429 reset in 446 ms.
Product exploration explored 100000 steps with 3436 reset in 462 ms.
Computed a total of 739 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 739 transition count 214
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1051 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 565 steps, including 17 resets, run visited all 1 properties in 7 ms. (steps per millisecond=80 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 739/739 places, 214/214 transitions.
Applied a total of 0 rules in 19 ms. Remains 739 /739 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 739 cols
[2023-03-16 16:08:38] [INFO ] Computed 528 place invariants in 4 ms
[2023-03-16 16:08:38] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-16 16:08:38] [INFO ] Invariant cache hit.
[2023-03-16 16:08:39] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
[2023-03-16 16:08:39] [INFO ] Invariant cache hit.
[2023-03-16 16:08:39] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1429 ms. Remains : 739/739 places, 214/214 transitions.
Computed a total of 739 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 739 transition count 214
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1172 steps, including 37 resets, run visited all 1 properties in 12 ms. (steps per millisecond=97 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3436 reset in 441 ms.
Product exploration explored 100000 steps with 3435 reset in 459 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 739 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 739/739 places, 214/214 transitions.
Applied a total of 0 rules in 17 ms. Remains 739 /739 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-16 16:08:41] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-16 16:08:41] [INFO ] Invariant cache hit.
[2023-03-16 16:08:42] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 739/739 places, 214/214 transitions.
Built C files in :
/tmp/ltsmin2134040407705831674
[2023-03-16 16:08:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2134040407705831674
Running compilation step : cd /tmp/ltsmin2134040407705831674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 524 ms.
Running link step : cd /tmp/ltsmin2134040407705831674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2134040407705831674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7676623854127898398.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 46 out of 739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 739/739 places, 214/214 transitions.
Applied a total of 0 rules in 13 ms. Remains 739 /739 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-16 16:08:57] [INFO ] Invariant cache hit.
[2023-03-16 16:08:57] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-16 16:08:57] [INFO ] Invariant cache hit.
[2023-03-16 16:08:58] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2023-03-16 16:08:58] [INFO ] Invariant cache hit.
[2023-03-16 16:08:58] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1492 ms. Remains : 739/739 places, 214/214 transitions.
Built C files in :
/tmp/ltsmin12694520719624800497
[2023-03-16 16:08:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12694520719624800497
Running compilation step : cd /tmp/ltsmin12694520719624800497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 580 ms.
Running link step : cd /tmp/ltsmin12694520719624800497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12694520719624800497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17399198325342736761.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 16:09:14] [INFO ] Flatten gal took : 29 ms
[2023-03-16 16:09:14] [INFO ] Flatten gal took : 14 ms
[2023-03-16 16:09:14] [INFO ] Time to serialize gal into /tmp/LTL15132306836432222686.gal : 3 ms
[2023-03-16 16:09:14] [INFO ] Time to serialize properties into /tmp/LTL2646317455215759873.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15132306836432222686.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5830220121927660170.hoa' '-atoms' '/tmp/LTL2646317455215759873.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Csta...471
Formula 0 simplified : XF!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Cstart...465
Detected timeout of ITS tools.
[2023-03-16 16:09:44] [INFO ] Flatten gal took : 16 ms
[2023-03-16 16:09:44] [INFO ] Applying decomposition
[2023-03-16 16:09:44] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18001479938317185941.txt' '-o' '/tmp/graph18001479938317185941.bin' '-w' '/tmp/graph18001479938317185941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18001479938317185941.bin' '-l' '-1' '-v' '-w' '/tmp/graph18001479938317185941.weights' '-q' '0' '-e' '0.001'
[2023-03-16 16:09:44] [INFO ] Decomposing Gal with order
[2023-03-16 16:09:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 16:09:44] [INFO ] Removed a total of 138 redundant transitions.
[2023-03-16 16:09:44] [INFO ] Flatten gal took : 35 ms
[2023-03-16 16:09:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 25 ms.
[2023-03-16 16:09:44] [INFO ] Time to serialize gal into /tmp/LTL7870847726415685311.gal : 8 ms
[2023-03-16 16:09:44] [INFO ] Time to serialize properties into /tmp/LTL16272023099410040203.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7870847726415685311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16272023099410040203.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((gu31.Cstart_0+gu31.Cstart_1)+(gu31.Cstart_2+gu31.Cstart_3))+((gu31.Cstart_4+gu31.Cstart_5)+(gu31.Cstart_6+gu31.Cstart_7)...701
Formula 0 simplified : XF!"((((((gu31.Cstart_0+gu31.Cstart_1)+(gu31.Cstart_2+gu31.Cstart_3))+((gu31.Cstart_4+gu31.Cstart_5)+(gu31.Cstart_6+gu31.Cstart_7)))...695
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10660749640685333329
[2023-03-16 16:09:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10660749640685333329
Running compilation step : cd /tmp/ltsmin10660749640685333329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 566 ms.
Running link step : cd /tmp/ltsmin10660749640685333329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10660749640685333329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-02 finished in 100726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-16 16:10:14] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1754928840982251273
[2023-03-16 16:10:14] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2023-03-16 16:10:14] [INFO ] Applying decomposition
[2023-03-16 16:10:14] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:10:14] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2023-03-16 16:10:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:10:14] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2023-03-16 16:10:14] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 16:10:14] [INFO ] Flatten gal took : 42 ms
[2023-03-16 16:10:14] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1754928840982251273
Running compilation step : cd /tmp/ltsmin1754928840982251273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7030912542405424555.txt' '-o' '/tmp/graph7030912542405424555.bin' '-w' '/tmp/graph7030912542405424555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7030912542405424555.bin' '-l' '-1' '-v' '-w' '/tmp/graph7030912542405424555.weights' '-q' '0' '-e' '0.001'
[2023-03-16 16:10:15] [INFO ] Decomposing Gal with order
[2023-03-16 16:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 16:10:15] [INFO ] Removed a total of 183 redundant transitions.
[2023-03-16 16:10:15] [INFO ] Flatten gal took : 101 ms
[2023-03-16 16:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 68 ms.
[2023-03-16 16:10:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality11141010195944640047.gal : 20 ms
[2023-03-16 16:10:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality10020599441095125275.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11141010195944640047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10020599441095125275.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((X(G("((((((gu51.Cstart_0+gu51.Cstart_1)+(gu51.Cstart_2+gu51.Cstart_3))+((gu51.Cstart_4+gu51.Cstart_5)+(gu51.Cstart_6+gu51.Cstart_7)...701
Formula 0 simplified : XF!"((((((gu51.Cstart_0+gu51.Cstart_1)+(gu51.Cstart_2+gu51.Cstart_3))+((gu51.Cstart_4+gu51.Cstart_5)+(gu51.Cstart_6+gu51.Cstart_7)))...695
Compilation finished in 1963 ms.
Running link step : cd /tmp/ltsmin1754928840982251273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1754928840982251273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 0.019: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.019: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.058: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.279: DFS-FIFO for weak LTL, using special progress label 360
pins2lts-mc-linux64( 0/ 8), 0.279: There are 361 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.279: State length is 1965, there are 360 groups
pins2lts-mc-linux64( 0/ 8), 0.279: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.279: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.279: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.279: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.498: ~1 levels ~960 states ~23080 transitions
pins2lts-mc-linux64( 4/ 8), 0.653: ~1 levels ~1920 states ~47680 transitions
pins2lts-mc-linux64( 1/ 8), 0.901: ~1 levels ~3840 states ~83160 transitions
pins2lts-mc-linux64( 0/ 8), 1.348: ~1 levels ~7680 states ~186864 transitions
pins2lts-mc-linux64( 1/ 8), 2.214: ~1 levels ~15360 states ~393720 transitions
pins2lts-mc-linux64( 1/ 8), 3.484: ~1 levels ~30720 states ~782520 transitions
pins2lts-mc-linux64( 5/ 8), 6.082: ~1 levels ~61440 states ~1611936 transitions
pins2lts-mc-linux64( 7/ 8), 10.641: ~1 levels ~122880 states ~3532760 transitions
pins2lts-mc-linux64( 1/ 8), 19.685: ~1 levels ~245760 states ~7331720 transitions
pins2lts-mc-linux64( 1/ 8), 38.745: ~1 levels ~491520 states ~15475192 transitions
pins2lts-mc-linux64( 1/ 8), 80.383: ~1 levels ~983040 states ~32757792 transitions
pins2lts-mc-linux64( 2/ 8), 85.052: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 85.335:
pins2lts-mc-linux64( 0/ 8), 85.335: mean standard work distribution: 9.8% (states) 7.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 85.335:
pins2lts-mc-linux64( 0/ 8), 85.335: Explored 890923 states 33355375 transitions, fanout: 37.439
pins2lts-mc-linux64( 0/ 8), 85.335: Total exploration time 85.040 sec (84.790 sec minimum, 84.851 sec on average)
pins2lts-mc-linux64( 0/ 8), 85.335: States per second: 10477, Transitions per second: 392232
pins2lts-mc-linux64( 0/ 8), 85.335:
pins2lts-mc-linux64( 0/ 8), 85.335: Progress states detected: 8547176
pins2lts-mc-linux64( 0/ 8), 85.335: Redundant explorations: -89.5765
pins2lts-mc-linux64( 0/ 8), 85.335:
pins2lts-mc-linux64( 0/ 8), 85.335: Queue width: 8B, total height: 9897102, memory: 75.51MB
pins2lts-mc-linux64( 0/ 8), 85.335: Tree memory: 321.2MB, 39.4 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 85.335: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 85.336: Stored 359 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 85.336: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 85.336: Est. total memory use: 396.7MB (~1099.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1754928840982251273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1754928840982251273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 16:33:47] [INFO ] Applying decomposition
[2023-03-16 16:33:47] [INFO ] Flatten gal took : 263 ms
[2023-03-16 16:33:47] [INFO ] Decomposing Gal with order
[2023-03-16 16:33:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 16:33:48] [INFO ] Removed a total of 182 redundant transitions.
[2023-03-16 16:33:48] [INFO ] Flatten gal took : 604 ms
[2023-03-16 16:33:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 153 ms.
[2023-03-16 16:34:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality5738178218938065526.gal : 20556 ms
[2023-03-16 16:34:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality15936295086562156991.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5738178218938065526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15936295086562156991.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X(G("((((((gtsid0.Cstart_0+gtsid1.Cstart_1)+(gtsid2.Cstart_2+gtsid3.Cstart_3))+((gtsid4.Cstart_4+gtsid5.Cstart_5)+(gtsid6.Cstart_6+...819
Formula 0 simplified : XF!"((((((gtsid0.Cstart_0+gtsid1.Cstart_1)+(gtsid2.Cstart_2+gtsid3.Cstart_3))+((gtsid4.Cstart_4+gtsid5.Cstart_5)+(gtsid6.Cstart_6+gt...813
Detected timeout of ITS tools.
[2023-03-16 16:56:43] [INFO ] Flatten gal took : 342 ms
[2023-03-16 16:56:45] [INFO ] Input system was already deterministic with 356 transitions.
[2023-03-16 16:56:45] [INFO ] Transformed 1964 places.
[2023-03-16 16:56:45] [INFO ] Transformed 356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 16:56:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality2881736081186861299.gal : 6 ms
[2023-03-16 16:56:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality14582447761340802846.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2881736081186861299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14582447761340802846.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Csta...471
Formula 0 simplified : XF!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+Cstart...465
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7511892 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15901108 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-22"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-22, 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 r293-tall-167873946000835"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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