fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r293-tall-167873946000891
Last Updated
May 14, 2023

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-22

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16223.548 3600000.00 3330961.00 600838.40 TT??FTFTTFFTFTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 33K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 225K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 667K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678996573782

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-PT-22
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-16 19:56:15] [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 19:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:56:15] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-16 19:56:15] [INFO ] Transformed 1966 places.
[2023-03-16 19:56:15] [INFO ] Transformed 356 transitions.
[2023-03-16 19:56:15] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 723 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 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 1941 transition count 356
Applied a total of 25 rules in 126 ms. Remains 1941 /1966 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1941 cols
[2023-03-16 19:56:15] [INFO ] Computed 1586 place invariants in 60 ms
[2023-03-16 19:56:17] [INFO ] Implicit Places using invariants in 1930 ms returned []
[2023-03-16 19:56:17] [INFO ] Invariant cache hit.
[2023-03-16 19:56:20] [INFO ] Implicit Places using invariants and state equation in 2689 ms returned []
Implicit Place search using SMT with State Equation took 4650 ms to find 0 implicit places.
[2023-03-16 19:56:20] [INFO ] Invariant cache hit.
[2023-03-16 19:56:21] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1941/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5446 ms. Remains : 1941/1966 places, 356/356 transitions.
Support contains 723 out of 1941 places after structural reductions.
[2023-03-16 19:56:21] [INFO ] Flatten gal took : 132 ms
[2023-03-16 19:56:21] [INFO ] Flatten gal took : 78 ms
[2023-03-16 19:56:21] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 19) seen :4
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 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) 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 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-16 19:56:22] [INFO ] Invariant cache hit.
[2023-03-16 19:56:23] [INFO ] [Real]Absence check using 0 positive and 1586 generalized place invariants in 296 ms returned sat
[2023-03-16 19:56:23] [INFO ] After 1106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-16 19:56:24] [INFO ] [Nat]Absence check using 0 positive and 1586 generalized place invariants in 311 ms returned sat
[2023-03-16 19:56:48] [INFO ] After 23541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-16 19:56:48] [INFO ] After 23546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 19:56:48] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 15 Parikh solutions to 7 different solutions.
Parikh walk visited 14 properties in 31 ms.
Support contains 1 out of 1941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 4 are kept as prefixes of interest. Removing 1937 places using SCC suffix rule.6 ms
Discarding 1937 places :
Also discarding 193 output transitions
Drop transitions removed 193 transitions
Drop transitions removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 0 with 160 rules applied. Total rules applied 161 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 161 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 163 place count 3 transition count 2
Applied a total of 163 rules in 15 ms. Remains 3 /1941 variables (removed 1938) and now considering 2/356 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 3/1941 places, 2/356 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2500 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 3 states, properties seen :0
Probabilistic random walk after 5 steps, saw 3 distinct states, run finished after 4 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 3 states, properties seen :0
Exhaustive walk after 5 steps, saw 3 distinct states, run finished after 2 ms. (steps per millisecond=2 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1941 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1941 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 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 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 1916 transition count 356
Applied a total of 25 rules in 155 ms. Remains 1916 /1941 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 19:56:49] [INFO ] Computed 1562 place invariants in 40 ms
[2023-03-16 19:56:51] [INFO ] Implicit Places using invariants in 2153 ms returned []
[2023-03-16 19:56:51] [INFO ] Invariant cache hit.
[2023-03-16 19:56:55] [INFO ] Implicit Places using invariants and state equation in 4517 ms returned []
Implicit Place search using SMT with State Equation took 6677 ms to find 0 implicit places.
[2023-03-16 19:56:55] [INFO ] Invariant cache hit.
[2023-03-16 19:56:56] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1941 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7512 ms. Remains : 1916/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s1155 s1156 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s1175 s1176 s1177 s1178 s1181 s1183 s1184 s1185 s1186) (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 3720 reset in 495 ms.
Product exploration explored 100000 steps with 3711 reset in 470 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 303 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)]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1283598 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :{}
Probabilistic random walk after 1283598 steps, saw 177939 distinct states, run finished after 3002 ms. (steps per millisecond=427 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:57:01] [INFO ] Invariant cache hit.
[2023-03-16 19:57:01] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 303 ms returned sat
[2023-03-16 19:57:04] [INFO ] After 3499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:57:05] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 298 ms returned sat
[2023-03-16 19:57:07] [INFO ] After 2518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:57:08] [INFO ] After 2643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1588 ms.
[2023-03-16 19:57:09] [INFO ] After 4770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
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 609 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 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 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 66 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-16 19:57:10] [INFO ] Invariant cache hit.
[2023-03-16 19:57:12] [INFO ] Implicit Places using invariants in 2018 ms returned []
[2023-03-16 19:57:12] [INFO ] Invariant cache hit.
[2023-03-16 19:57:17] [INFO ] Implicit Places using invariants and state equation in 4450 ms returned []
Implicit Place search using SMT with State Equation took 6471 ms to find 0 implicit places.
[2023-03-16 19:57:17] [INFO ] Invariant cache hit.
[2023-03-16 19:57:17] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7182 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 198 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 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished Best-First random walk after 2491 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=415 )
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 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3717 reset in 406 ms.
Product exploration explored 100000 steps with 3713 reset in 428 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 535 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 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.20 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1318 transition count 266
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 93 rules in 395 ms. Remains 1318 /1916 variables (removed 598) and now considering 266/356 (removed 90) transitions.
[2023-03-16 19:57:20] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 266 rows 1318 cols
[2023-03-16 19:57:20] [INFO ] Computed 1056 place invariants in 11 ms
[2023-03-16 19:57:21] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1318/1916 places, 266/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 911 ms. Remains : 1318/1916 places, 266/356 transitions.
Built C files in :
/tmp/ltsmin17749403153192827445
[2023-03-16 19:57:21] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17749403153192827445
Running compilation step : cd /tmp/ltsmin17749403153192827445;'/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 1271 ms.
Running link step : cd /tmp/ltsmin17749403153192827445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17749403153192827445;'/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/stateBased6466140014404397362.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 204 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 19:57:36] [INFO ] Computed 1562 place invariants in 23 ms
[2023-03-16 19:57:38] [INFO ] Implicit Places using invariants in 2129 ms returned []
[2023-03-16 19:57:38] [INFO ] Invariant cache hit.
[2023-03-16 19:57:43] [INFO ] Implicit Places using invariants and state equation in 4566 ms returned []
Implicit Place search using SMT with State Equation took 6700 ms to find 0 implicit places.
[2023-03-16 19:57:43] [INFO ] Invariant cache hit.
[2023-03-16 19:57:43] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7586 ms. Remains : 1916/1916 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin15677506668262385802
[2023-03-16 19:57:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15677506668262385802
Running compilation step : cd /tmp/ltsmin15677506668262385802;'/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 1547 ms.
Running link step : cd /tmp/ltsmin15677506668262385802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15677506668262385802;'/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/stateBased17348711364285115720.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:57:59] [INFO ] Flatten gal took : 55 ms
[2023-03-16 19:57:59] [INFO ] Flatten gal took : 49 ms
[2023-03-16 19:57:59] [INFO ] Time to serialize gal into /tmp/LTL9032239904993198424.gal : 12 ms
[2023-03-16 19:57:59] [INFO ] Time to serialize properties into /tmp/LTL5841844028426578302.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/LTL9032239904993198424.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8076582189189547835.hoa' '-atoms' '/tmp/LTL5841844028426578302.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...317
Loading property file /tmp/LTL5841844028426578302.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8076582189189547835.hoa
Detected timeout of ITS tools.
[2023-03-16 19:58:14] [INFO ] Flatten gal took : 51 ms
[2023-03-16 19:58:14] [INFO ] Flatten gal took : 45 ms
[2023-03-16 19:58:14] [INFO ] Time to serialize gal into /tmp/LTL12281580194436855003.gal : 7 ms
[2023-03-16 19:58:14] [INFO ] Time to serialize properties into /tmp/LTL11035587801549794939.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/LTL12281580194436855003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11035587801549794939.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 : !((X(G("((((((Cstart_1+Cstart_0)+(Cstart_9+Cstart_8))+((Cstart_7+Cstart_6)+(Cstart_5+Cstart_4)))+(((Cstart_3+Cstart_2)+(Cstart_16+Csta...471
Formula 0 simplified : XF!"((((((Cstart_1+Cstart_0)+(Cstart_9+Cstart_8))+((Cstart_7+Cstart_6)+(Cstart_5+Cstart_4)))+(((Cstart_3+Cstart_2)+(Cstart_16+Cstart...465
Detected timeout of ITS tools.
[2023-03-16 19:58:29] [INFO ] Flatten gal took : 42 ms
[2023-03-16 19:58:29] [INFO ] Applying decomposition
[2023-03-16 19:58:29] [INFO ] Flatten gal took : 40 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/graph5254917683437852020.txt' '-o' '/tmp/graph5254917683437852020.bin' '-w' '/tmp/graph5254917683437852020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5254917683437852020.bin' '-l' '-1' '-v' '-w' '/tmp/graph5254917683437852020.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:58:29] [INFO ] Decomposing Gal with order
[2023-03-16 19:58:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:58:30] [INFO ] Removed a total of 230 redundant transitions.
[2023-03-16 19:58:30] [INFO ] Flatten gal took : 279 ms
[2023-03-16 19:58:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 127 ms.
[2023-03-16 19:58:30] [INFO ] Time to serialize gal into /tmp/LTL16091888277067371537.gal : 21 ms
[2023-03-16 19:58:30] [INFO ] Time to serialize properties into /tmp/LTL16865382397201276182.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/LTL16091888277067371537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16865382397201276182.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 : !((X(G("((((((gu67.Cstart_1+gu67.Cstart_0)+(gu67.Cstart_9+gu67.Cstart_8))+((gu67.Cstart_7+gu67.Cstart_6)+(gu67.Cstart_5+gu67.Cstart_4)...701
Formula 0 simplified : XF!"((((((gu67.Cstart_1+gu67.Cstart_0)+(gu67.Cstart_9+gu67.Cstart_8))+((gu67.Cstart_7+gu67.Cstart_6)+(gu67.Cstart_5+gu67.Cstart_4)))...695
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16084549779108078166
[2023-03-16 19:58:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16084549779108078166
Running compilation step : cd /tmp/ltsmin16084549779108078166;'/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 1226 ms.
Running link step : cd /tmp/ltsmin16084549779108078166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16084549779108078166;'/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-PT-22-LTLCardinality-02 finished in 131923 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 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1939 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 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 343 ms. Remains 1938 /1941 variables (removed 3) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1938 cols
[2023-03-16 19:59:01] [INFO ] Computed 1585 place invariants in 12 ms
[2023-03-16 19:59:03] [INFO ] Implicit Places using invariants in 2006 ms returned []
[2023-03-16 19:59:03] [INFO ] Invariant cache hit.
[2023-03-16 19:59:07] [INFO ] Implicit Places using invariants and state equation in 3909 ms returned [1177, 1178, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1203, 1205, 1206, 1207, 1208]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5920 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1915/1941 places, 355/356 transitions.
Applied a total of 0 rules in 111 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 6376 ms. Remains : 1915/1941 places, 355/356 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s649 s650 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s742 s743 s744 s753 s754 s755 s756 s757) s165), p0:(LEQ 2 (ADD s18...], 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 3715 reset in 345 ms.
Product exploration explored 100000 steps with 3715 reset in 287 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 265 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 38 ms. (steps per millisecond=263 ) 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.
// Phase 1: matrix 355 rows 1915 cols
[2023-03-16 19:59:08] [INFO ] Computed 1562 place invariants in 21 ms
[2023-03-16 19:59:08] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:59:09] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 304 ms returned sat
[2023-03-16 19:59:10] [INFO ] After 1356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:59:16] [INFO ] After 6561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-16 19:59:16] [INFO ] After 7251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
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 359 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 79 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))]
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 19:59:16] [INFO ] Invariant cache hit.
[2023-03-16 19:59:18] [INFO ] Implicit Places using invariants in 1847 ms returned []
[2023-03-16 19:59:18] [INFO ] Invariant cache hit.
[2023-03-16 19:59:22] [INFO ] Implicit Places using invariants and state equation in 3693 ms returned []
Implicit Place search using SMT with State Equation took 5543 ms to find 0 implicit places.
[2023-03-16 19:59:22] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-16 19:59:22] [INFO ] Invariant cache hit.
[2023-03-16 19:59:23] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6285 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 280 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 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:59:23] [INFO ] Invariant cache hit.
[2023-03-16 19:59:23] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:59:24] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 298 ms returned sat
[2023-03-16 19:59:25] [INFO ] After 1324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:59:30] [INFO ] After 6468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-16 19:59:31] [INFO ] After 7130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=56 )
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 313 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 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3712 reset in 260 ms.
Product exploration explored 100000 steps with 3718 reset in 329 ms.
Built C files in :
/tmp/ltsmin13058854911364289472
[2023-03-16 19:59:32] [INFO ] Computing symmetric may disable matrix : 355 transitions.
[2023-03-16 19:59:32] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:59:32] [INFO ] Computing symmetric may enable matrix : 355 transitions.
[2023-03-16 19:59:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:59:32] [INFO ] Computing Do-Not-Accords matrix : 355 transitions.
[2023-03-16 19:59:32] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:59:32] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13058854911364289472
Running compilation step : cd /tmp/ltsmin13058854911364289472;'/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 1544 ms.
Running link step : cd /tmp/ltsmin13058854911364289472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13058854911364289472;'/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/stateBased12917487144074449629.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 19:59:47] [INFO ] Invariant cache hit.
[2023-03-16 19:59:49] [INFO ] Implicit Places using invariants in 2007 ms returned []
[2023-03-16 19:59:49] [INFO ] Invariant cache hit.
[2023-03-16 19:59:53] [INFO ] Implicit Places using invariants and state equation in 3734 ms returned []
Implicit Place search using SMT with State Equation took 5743 ms to find 0 implicit places.
[2023-03-16 19:59:53] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-16 19:59:53] [INFO ] Invariant cache hit.
[2023-03-16 19:59:53] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6529 ms. Remains : 1915/1915 places, 355/355 transitions.
Built C files in :
/tmp/ltsmin6650103230108952785
[2023-03-16 19:59:53] [INFO ] Computing symmetric may disable matrix : 355 transitions.
[2023-03-16 19:59:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:59:53] [INFO ] Computing symmetric may enable matrix : 355 transitions.
[2023-03-16 19:59:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:59:53] [INFO ] Computing Do-Not-Accords matrix : 355 transitions.
[2023-03-16 19:59:53] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:59:53] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6650103230108952785
Running compilation step : cd /tmp/ltsmin6650103230108952785;'/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 1443 ms.
Running link step : cd /tmp/ltsmin6650103230108952785;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6650103230108952785;'/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/stateBased377154707136119847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 20:00:08] [INFO ] Flatten gal took : 58 ms
[2023-03-16 20:00:09] [INFO ] Flatten gal took : 46 ms
[2023-03-16 20:00:09] [INFO ] Time to serialize gal into /tmp/LTL12566614296259019902.gal : 6 ms
[2023-03-16 20:00:09] [INFO ] Time to serialize properties into /tmp/LTL11505632897301023163.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/LTL12566614296259019902.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1121741096279357444.hoa' '-atoms' '/tmp/LTL11505632897301023163.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/LTL11505632897301023163.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1121741096279357444.hoa
Detected timeout of ITS tools.
[2023-03-16 20:00:24] [INFO ] Flatten gal took : 40 ms
[2023-03-16 20:00:24] [INFO ] Flatten gal took : 38 ms
[2023-03-16 20:00:24] [INFO ] Time to serialize gal into /tmp/LTL5337931593063673622.gal : 6 ms
[2023-03-16 20:00:24] [INFO ] Time to serialize properties into /tmp/LTL13632448539159717189.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/LTL5337931593063673622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13632448539159717189.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(("((((((n1_22+n1_18)+(n1_19+n1_20))+((n1_21+n1_17)+(n1_16+n1_15)))+(((n1_14+n1_13)+(n1_12+n1_11))+((n1_10+n1_9)+(n1_8+n1_7))))+...513
Formula 0 simplified : G(F!"((((((CstopOK_0+CstopOK_1)+(CstopOK_11+CstopOK_10))+((CstopOK_13+CstopOK_12)+(CstopOK_15+CstopOK_14)))+(((CstopOK_17+CstopOK_16...506
Detected timeout of ITS tools.
[2023-03-16 20:00:39] [INFO ] Flatten gal took : 38 ms
[2023-03-16 20:00:39] [INFO ] Applying decomposition
[2023-03-16 20:00:39] [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/graph6643443871161200718.txt' '-o' '/tmp/graph6643443871161200718.bin' '-w' '/tmp/graph6643443871161200718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6643443871161200718.bin' '-l' '-1' '-v' '-w' '/tmp/graph6643443871161200718.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:00:39] [INFO ] Decomposing Gal with order
[2023-03-16 20:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:00:39] [INFO ] Removed a total of 275 redundant transitions.
[2023-03-16 20:00:39] [INFO ] Flatten gal took : 103 ms
[2023-03-16 20:00:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 373 labels/synchronizations in 146 ms.
[2023-03-16 20:00:40] [INFO ] Time to serialize gal into /tmp/LTL6414821571082879928.gal : 17 ms
[2023-03-16 20:00:40] [INFO ] Time to serialize properties into /tmp/LTL13119496107341803985.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/LTL6414821571082879928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13119496107341803985.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(("((((((gu120.n1_22+gu120.n1_18)+(gu120.n1_19+gu120.n1_20))+((gu120.n1_21+gu120.n1_17)+(gu120.n1_16+gu120.n1_15)))+(((gu120.n1_...771
Formula 0 simplified : G(F!"((((((gu64.CstopOK_0+gu64.CstopOK_1)+(gu64.CstopOK_11+gu64.CstopOK_10))+((gu64.CstopOK_13+gu64.CstopOK_12)+(gu64.CstopOK_15+gu6...764
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17677024677475496408
[2023-03-16 20:00:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17677024677475496408
Running compilation step : cd /tmp/ltsmin17677024677475496408;'/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 1191 ms.
Running link step : cd /tmp/ltsmin17677024677475496408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17677024677475496408;'/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-PT-22-LTLCardinality-03 finished in 129391 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 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1917 transition count 356
Applied a total of 24 rules in 68 ms. Remains 1917 /1941 variables (removed 24) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2023-03-16 20:01:10] [INFO ] Computed 1563 place invariants in 37 ms
[2023-03-16 20:01:12] [INFO ] Implicit Places using invariants in 2227 ms returned []
[2023-03-16 20:01:12] [INFO ] Invariant cache hit.
[2023-03-16 20:01:16] [INFO ] Implicit Places using invariants and state equation in 4033 ms returned []
Implicit Place search using SMT with State Equation took 6265 ms to find 0 implicit places.
[2023-03-16 20:01:16] [INFO ] Invariant cache hit.
[2023-03-16 20:01:17] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1917/1941 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6997 ms. Remains : 1917/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 274 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-PT-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 s23), p1:(GT s1892 (ADD s1805 s1806 s1807 s1812 s1813 s1814 s1815 s1816 s1817 s1818 s1819 s1820 s1821 s1822 s1823 s1824 s1825 s1826 s1827 s1828 ...], 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 47 steps with 2 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-04 finished in 7309 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 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 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 1916 transition count 356
Applied a total of 25 rules in 46 ms. Remains 1916 /1941 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-16 20:01:17] [INFO ] Computed 1562 place invariants in 31 ms
[2023-03-16 20:01:19] [INFO ] Implicit Places using invariants in 1694 ms returned []
[2023-03-16 20:01:19] [INFO ] Invariant cache hit.
[2023-03-16 20:01:23] [INFO ] Implicit Places using invariants and state equation in 3755 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5453 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1941 places, 356/356 transitions.
Applied a total of 0 rules in 38 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 5538 ms. Remains : 1893/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s1869 s1870 s1871 s1872 s1873 s1874 s1875 s1876 s1877 s1878 s1879 s1880 s1881 s1882 s1883 s1885 s1886 s1887 s1888 s1889 s1890 s1891 s1892) (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 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-06 finished in 5631 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 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 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 1916 transition count 356
Applied a total of 25 rules in 66 ms. Remains 1916 /1941 variables (removed 25) and now considering 356/356 (removed 0) transitions.
[2023-03-16 20:01:23] [INFO ] Invariant cache hit.
[2023-03-16 20:01:25] [INFO ] Implicit Places using invariants in 2067 ms returned []
[2023-03-16 20:01:25] [INFO ] Invariant cache hit.
[2023-03-16 20:01:29] [INFO ] Implicit Places using invariants and state equation in 4349 ms returned []
Implicit Place search using SMT with State Equation took 6428 ms to find 0 implicit places.
[2023-03-16 20:01:29] [INFO ] Invariant cache hit.
[2023-03-16 20:01:30] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1941 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7123 ms. Remains : 1916/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s71 s72 s73) (ADD s1155 s1156 s1163 s1164 s1165 s1166 s1167 s...], 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 814 ms.
Product exploration explored 100000 steps with 33333 reset in 781 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 78 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-PT-22-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-07 finished in 9415 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 2 out of 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1363 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.4 ms
Discarding 578 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1316 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1316 transition count 262
Applied a total of 94 rules in 195 ms. Remains 1316 /1941 variables (removed 625) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2023-03-16 20:01:32] [INFO ] Computed 1056 place invariants in 18 ms
[2023-03-16 20:01:34] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2023-03-16 20:01:34] [INFO ] Invariant cache hit.
[2023-03-16 20:01:36] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3677 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1270/1941 places, 262/356 transitions.
Applied a total of 0 rules in 50 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3923 ms. Remains : 1270/1941 places, 262/356 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1212 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-09 finished in 3974 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)&&F(p1))))'
Support contains 4 out of 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1363 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.6 ms
Discarding 578 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1316 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1316 transition count 262
Applied a total of 94 rules in 177 ms. Remains 1316 /1941 variables (removed 625) and now considering 262/356 (removed 94) transitions.
[2023-03-16 20:01:36] [INFO ] Invariant cache hit.
[2023-03-16 20:01:37] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2023-03-16 20:01:37] [INFO ] Invariant cache hit.
[2023-03-16 20:01:40] [INFO ] Implicit Places using invariants and state equation in 2273 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 45 places :
Implicit Place search using SMT with State Equation took 3486 ms to find 45 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1941 places, 262/356 transitions.
Applied a total of 0 rules in 48 ms. Remains 1271 /1271 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3711 ms. Remains : 1271/1941 places, 262/356 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s191 s585), p1:(LEQ s1224 s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-10 finished in 3827 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) U p1)))'
Support contains 4 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1917 transition count 356
Applied a total of 24 rules in 64 ms. Remains 1917 /1941 variables (removed 24) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2023-03-16 20:01:40] [INFO ] Computed 1563 place invariants in 35 ms
[2023-03-16 20:01:42] [INFO ] Implicit Places using invariants in 2241 ms returned []
[2023-03-16 20:01:42] [INFO ] Invariant cache hit.
[2023-03-16 20:01:47] [INFO ] Implicit Places using invariants and state equation in 4450 ms returned [1156, 1157, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1182, 1184, 1185, 1186, 1187]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6697 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1941 places, 356/356 transitions.
Applied a total of 0 rules in 73 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 6836 ms. Remains : 1894/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s23 s459), p0:(LEQ s1820 s1802)], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 50000 reset in 947 ms.
Product exploration explored 100000 steps with 50000 reset in 952 ms.
Computed a total of 1894 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1894 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 8 factoid took 284 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-11 finished in 9435 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 2 out of 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1363 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.4 ms
Discarding 578 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1318 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1318 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 1317 transition count 264
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1317 transition count 264
Applied a total of 92 rules in 164 ms. Remains 1317 /1941 variables (removed 624) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1317 cols
[2023-03-16 20:01:50] [INFO ] Computed 1056 place invariants in 9 ms
[2023-03-16 20:01:51] [INFO ] Implicit Places using invariants in 1202 ms returned []
[2023-03-16 20:01:51] [INFO ] Invariant cache hit.
[2023-03-16 20:01:53] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned [580, 581, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 1276, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3275 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1941 places, 264/356 transitions.
Applied a total of 0 rules in 49 ms. Remains 1271 /1271 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3488 ms. Remains : 1271/1941 places, 264/356 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 (LEQ s2 s112) (LEQ 1 s112))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3472 reset in 262 ms.
Product exploration explored 100000 steps with 3478 reset in 275 ms.
Computed a total of 1271 stabilizing places and 264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1271 transition count 264
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-13 finished in 4386 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 1 out of 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1387 are kept as prefixes of interest. Removing 554 places using SCC suffix rule.5 ms
Discarding 554 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1341 transition count 265
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1341 transition count 265
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 95 place count 1339 transition count 263
Applied a total of 95 rules in 122 ms. Remains 1339 /1941 variables (removed 602) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1339 cols
[2023-03-16 20:01:54] [INFO ] Computed 1078 place invariants in 12 ms
[2023-03-16 20:01:55] [INFO ] Implicit Places using invariants in 1220 ms returned []
[2023-03-16 20:01:55] [INFO ] Invariant cache hit.
[2023-03-16 20:01:57] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3418 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1293/1941 places, 263/356 transitions.
Applied a total of 0 rules in 40 ms. Remains 1293 /1293 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3580 ms. Remains : 1293/1941 places, 263/356 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 1 s1275)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-14 finished in 3640 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 2 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1918 transition count 356
Applied a total of 23 rules in 66 ms. Remains 1918 /1941 variables (removed 23) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1918 cols
[2023-03-16 20:01:57] [INFO ] Computed 1563 place invariants in 33 ms
[2023-03-16 20:02:00] [INFO ] Implicit Places using invariants in 2172 ms returned []
[2023-03-16 20:02:00] [INFO ] Invariant cache hit.
[2023-03-16 20:02:04] [INFO ] Implicit Places using invariants and state equation in 4705 ms returned [1157, 1158, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1183, 1185, 1186, 1187, 1188]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6878 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1895/1941 places, 356/356 transitions.
Applied a total of 0 rules in 58 ms. Remains 1895 /1895 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7002 ms. Remains : 1895/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-15 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:(LEQ s159 s23)], 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 15 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-15 finished in 7104 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-PT-22-LTLCardinality-02
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1363 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.8 ms
Discarding 578 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
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 95 place count 1315 transition count 261
Applied a total of 95 rules in 121 ms. Remains 1315 /1941 variables (removed 626) and now considering 261/356 (removed 95) transitions.
// Phase 1: matrix 261 rows 1315 cols
[2023-03-16 20:02:05] [INFO ] Computed 1056 place invariants in 16 ms
[2023-03-16 20:02:06] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2023-03-16 20:02:06] [INFO ] Invariant cache hit.
[2023-03-16 20:02:08] [INFO ] Implicit Places using invariants and state equation in 2207 ms returned [1274, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 3395 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1292/1941 places, 261/356 transitions.
Applied a total of 0 rules in 41 ms. Remains 1292 /1292 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3560 ms. Remains : 1292/1941 places, 261/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-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 s578 s579 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s604 s606 s607 s608 s609) (ADD s1254 s1255 s1256 s12...], 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 3470 reset in 419 ms.
Product exploration explored 100000 steps with 3472 reset in 464 ms.
Computed a total of 1292 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1292 transition count 261
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 250 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)]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Finished Best-First random walk after 851 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=425 )
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 193 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)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 261/261 transitions.
Applied a total of 0 rules in 35 ms. Remains 1292 /1292 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 1292 cols
[2023-03-16 20:02:10] [INFO ] Computed 1034 place invariants in 9 ms
[2023-03-16 20:02:11] [INFO ] Implicit Places using invariants in 1161 ms returned []
[2023-03-16 20:02:11] [INFO ] Invariant cache hit.
[2023-03-16 20:02:13] [INFO ] Implicit Places using invariants and state equation in 1915 ms returned []
Implicit Place search using SMT with State Equation took 3078 ms to find 0 implicit places.
[2023-03-16 20:02:13] [INFO ] Invariant cache hit.
[2023-03-16 20:02:14] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3497 ms. Remains : 1292/1292 places, 261/261 transitions.
Computed a total of 1292 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1292 transition count 261
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 155 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)]
Incomplete random walk after 10000 steps, including 348 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Finished Best-First random walk after 851 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=425 )
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 225 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)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 482 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3473 reset in 414 ms.
Product exploration explored 100000 steps with 3477 reset in 440 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1292/1292 places, 261/261 transitions.
Applied a total of 0 rules in 44 ms. Remains 1292 /1292 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-16 20:02:16] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-16 20:02:16] [INFO ] Invariant cache hit.
[2023-03-16 20:02:16] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 467 ms. Remains : 1292/1292 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin9672635236862494228
[2023-03-16 20:02:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9672635236862494228
Running compilation step : cd /tmp/ltsmin9672635236862494228;'/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 802 ms.
Running link step : cd /tmp/ltsmin9672635236862494228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9672635236862494228;'/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/stateBased876754695524821978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 46 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 261/261 transitions.
Applied a total of 0 rules in 31 ms. Remains 1292 /1292 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-16 20:02:31] [INFO ] Invariant cache hit.
[2023-03-16 20:02:33] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2023-03-16 20:02:33] [INFO ] Invariant cache hit.
[2023-03-16 20:02:34] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 3058 ms to find 0 implicit places.
[2023-03-16 20:02:34] [INFO ] Invariant cache hit.
[2023-03-16 20:02:35] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3494 ms. Remains : 1292/1292 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin6329249459615806800
[2023-03-16 20:02:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6329249459615806800
Running compilation step : cd /tmp/ltsmin6329249459615806800;'/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 811 ms.
Running link step : cd /tmp/ltsmin6329249459615806800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6329249459615806800;'/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/stateBased17966429355970478498.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 20:02:50] [INFO ] Flatten gal took : 31 ms
[2023-03-16 20:02:50] [INFO ] Flatten gal took : 25 ms
[2023-03-16 20:02:50] [INFO ] Time to serialize gal into /tmp/LTL13507166388078652299.gal : 4 ms
[2023-03-16 20:02:50] [INFO ] Time to serialize properties into /tmp/LTL2403238480489289212.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/LTL13507166388078652299.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11216239452632546985.hoa' '-atoms' '/tmp/LTL2403238480489289212.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/LTL2403238480489289212.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11216239452632546985.hoa
Detected timeout of ITS tools.
[2023-03-16 20:03:05] [INFO ] Flatten gal took : 28 ms
[2023-03-16 20:03:05] [INFO ] Flatten gal took : 26 ms
[2023-03-16 20:03:05] [INFO ] Time to serialize gal into /tmp/LTL13553336471571044208.gal : 5 ms
[2023-03-16 20:03:05] [INFO ] Time to serialize properties into /tmp/LTL16269632658035607143.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/LTL13553336471571044208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16269632658035607143.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 : !((X(G("((((((Cstart_1+Cstart_0)+(Cstart_9+Cstart_8))+((Cstart_7+Cstart_6)+(Cstart_5+Cstart_4)))+(((Cstart_3+Cstart_2)+(Cstart_16+Csta...471
Formula 0 simplified : XF!"((((((Cstart_1+Cstart_0)+(Cstart_9+Cstart_8))+((Cstart_7+Cstart_6)+(Cstart_5+Cstart_4)))+(((Cstart_3+Cstart_2)+(Cstart_16+Cstart...465
Detected timeout of ITS tools.
[2023-03-16 20:03:20] [INFO ] Flatten gal took : 26 ms
[2023-03-16 20:03:20] [INFO ] Applying decomposition
[2023-03-16 20:03:20] [INFO ] Flatten gal took : 25 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/graph6370977802438433637.txt' '-o' '/tmp/graph6370977802438433637.bin' '-w' '/tmp/graph6370977802438433637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6370977802438433637.bin' '-l' '-1' '-v' '-w' '/tmp/graph6370977802438433637.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:03:20] [INFO ] Decomposing Gal with order
[2023-03-16 20:03:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:03:20] [INFO ] Removed a total of 184 redundant transitions.
[2023-03-16 20:03:21] [INFO ] Flatten gal took : 51 ms
[2023-03-16 20:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 29 ms.
[2023-03-16 20:03:21] [INFO ] Time to serialize gal into /tmp/LTL5775297757670884735.gal : 9 ms
[2023-03-16 20:03:21] [INFO ] Time to serialize properties into /tmp/LTL3640784635690336721.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/LTL5775297757670884735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3640784635690336721.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("((((((gu41.Cstart_1+gu41.Cstart_0)+(gu41.Cstart_9+gu41.Cstart_8))+((gu41.Cstart_7+gu41.Cstart_6)+(gu41.Cstart_5+gu41.Cstart_4)...701
Formula 0 simplified : XF!"((((((gu41.Cstart_1+gu41.Cstart_0)+(gu41.Cstart_9+gu41.Cstart_8))+((gu41.Cstart_7+gu41.Cstart_6)+(gu41.Cstart_5+gu41.Cstart_4)))...695
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2136805378687204582
[2023-03-16 20:03:36] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2136805378687204582
Running compilation step : cd /tmp/ltsmin2136805378687204582;'/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 812 ms.
Running link step : cd /tmp/ltsmin2136805378687204582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2136805378687204582;'/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-PT-22-LTLCardinality-02 finished in 106346 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 20:03:51] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16842394570523254173
[2023-03-16 20:03:51] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2023-03-16 20:03:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:03:51] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2023-03-16 20:03:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:03:51] [INFO ] Applying decomposition
[2023-03-16 20:03:51] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2023-03-16 20:03:51] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 20:03:51] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16842394570523254173
Running compilation step : cd /tmp/ltsmin16842394570523254173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 20:03:51] [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/graph2152453132605406142.txt' '-o' '/tmp/graph2152453132605406142.bin' '-w' '/tmp/graph2152453132605406142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2152453132605406142.bin' '-l' '-1' '-v' '-w' '/tmp/graph2152453132605406142.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:03:51] [INFO ] Decomposing Gal with order
[2023-03-16 20:03:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:03:51] [INFO ] Removed a total of 184 redundant transitions.
[2023-03-16 20:03:51] [INFO ] Flatten gal took : 98 ms
[2023-03-16 20:03:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 59 ms.
[2023-03-16 20:03:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality1574829545540454648.gal : 19 ms
[2023-03-16 20:03:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality11901099847749519226.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/LTLCardinality1574829545540454648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11901099847749519226.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("((((((gu70.Cstart_1+gu70.Cstart_0)+(gu70.Cstart_9+gu70.Cstart_8))+((gu70.Cstart_7+gu70.Cstart_6)+(gu70.Cstart_5+gu70.Cstart_4)...701
Formula 0 simplified : XF!"((((((gu70.Cstart_1+gu70.Cstart_0)+(gu70.Cstart_9+gu70.Cstart_8))+((gu70.Cstart_7+gu70.Cstart_6)+(gu70.Cstart_5+gu70.Cstart_4)))...695
Compilation finished in 1517 ms.
Running link step : cd /tmp/ltsmin16842394570523254173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16842394570523254173;'/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.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.027: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 0.027: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.027: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.252: DFS-FIFO for weak LTL, using special progress label 360
pins2lts-mc-linux64( 0/ 8), 0.252: There are 361 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.252: State length is 1942, there are 360 groups
pins2lts-mc-linux64( 0/ 8), 0.252: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.252: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.252: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.252: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.503: ~1 levels ~960 states ~20744 transitions
pins2lts-mc-linux64( 7/ 8), 0.672: ~1 levels ~1920 states ~49888 transitions
pins2lts-mc-linux64( 0/ 8), 0.921: ~1 levels ~3840 states ~89256 transitions
pins2lts-mc-linux64( 1/ 8), 1.389: ~1 levels ~7680 states ~171528 transitions
pins2lts-mc-linux64( 6/ 8), 2.174: ~1 levels ~15360 states ~396560 transitions
pins2lts-mc-linux64( 4/ 8), 3.595: ~1 levels ~30720 states ~790264 transitions
pins2lts-mc-linux64( 4/ 8), 6.777: ~1 levels ~61440 states ~1962320 transitions
pins2lts-mc-linux64( 6/ 8), 11.748: ~1 levels ~122880 states ~3920640 transitions
pins2lts-mc-linux64( 1/ 8), 19.383: ~1 levels ~245760 states ~7108984 transitions
pins2lts-mc-linux64( 1/ 8), 39.840: ~1 levels ~491520 states ~15752952 transitions
pins2lts-mc-linux64( 6/ 8), 85.606: ~1 levels ~983040 states ~33780784 transitions
pins2lts-mc-linux64( 4/ 8), 92.193: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 92.717:
pins2lts-mc-linux64( 0/ 8), 92.717: mean standard work distribution: 4.0% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 92.717:
pins2lts-mc-linux64( 0/ 8), 92.717: Explored 981656 states 36670077 transitions, fanout: 37.355
pins2lts-mc-linux64( 0/ 8), 92.717: Total exploration time 92.440 sec (91.980 sec minimum, 92.159 sec on average)
pins2lts-mc-linux64( 0/ 8), 92.717: States per second: 10619, Transitions per second: 396691
pins2lts-mc-linux64( 0/ 8), 92.717:
pins2lts-mc-linux64( 0/ 8), 92.717: Progress states detected: 9052028
pins2lts-mc-linux64( 0/ 8), 92.717: Redundant explorations: -89.1556
pins2lts-mc-linux64( 0/ 8), 92.717:
pins2lts-mc-linux64( 0/ 8), 92.717: Queue width: 8B, total height: 9705368, memory: 74.05MB
pins2lts-mc-linux64( 0/ 8), 92.717: Tree memory: 325.1MB, 37.7 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 92.717: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 92.717: Stored 375 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 92.717: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 92.717: Est. total memory use: 399.1MB (~1098.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16842394570523254173;'/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/ltsmin16842394570523254173;'/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 20:27:36] [INFO ] Flatten gal took : 324 ms
[2023-03-16 20:27:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality10037821882016545627.gal : 44 ms
[2023-03-16 20:27:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality9499804146104487511.ltl : 12 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/LTLCardinality10037821882016545627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9499804146104487511.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("((((((Cstart_1+Cstart_0)+(Cstart_9+Cstart_8))+((Cstart_7+Cstart_6)+(Cstart_5+Cstart_4)))+(((Cstart_3+Cstart_2)+(Cstart_16+Csta...471
Formula 0 simplified : XF!"((((((Cstart_1+Cstart_0)+(Cstart_9+Cstart_8))+((Cstart_7+Cstart_6)+(Cstart_5+Cstart_4)))+(((Cstart_3+Cstart_2)+(Cstart_16+Cstart...465
Detected timeout of ITS tools.
[2023-03-16 20:50:59] [INFO ] Flatten gal took : 408 ms
[2023-03-16 20:51:00] [INFO ] Input system was already deterministic with 356 transitions.
[2023-03-16 20:51:01] [INFO ] Transformed 1941 places.
[2023-03-16 20:51:01] [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 20:51:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality1621614227559096725.gal : 6 ms
[2023-03-16 20:51:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality11039194750907147612.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/LTLCardinality1621614227559096725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11039194750907147612.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_1+Cstart_0)+(Cstart_9+Cstart_8))+((Cstart_7+Cstart_6)+(Cstart_5+Cstart_4)))+(((Cstart_3+Cstart_2)+(Cstart_16+Csta...471
Formula 0 simplified : XF!"((((((Cstart_1+Cstart_0)+(Cstart_9+Cstart_8))+((Cstart_7+Cstart_6)+(Cstart_5+Cstart_4)))+(((Cstart_3+Cstart_2)+(Cstart_16+Cstart...465
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8424196 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15980984 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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-PT-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-PT-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-167873946000891"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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