Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 942K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716773538993

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 01:32:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 01:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:32:20] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-27 01:32:20] [INFO ] Transformed 3806 places.
[2024-05-27 01:32:20] [INFO ] Transformed 506 transitions.
[2024-05-27 01:32:20] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1340 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3805 transition count 506
Applied a total of 1 rules in 313 ms. Remains 3805 /3806 variables (removed 1) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3805 cols
[2024-05-27 01:32:21] [INFO ] Computed 3300 invariants in 97 ms
[2024-05-27 01:32:24] [INFO ] Implicit Places using invariants in 2791 ms returned []
[2024-05-27 01:32:24] [INFO ] Invariant cache hit.
[2024-05-27 01:32:26] [INFO ] Implicit Places using invariants and state equation in 2329 ms returned []
Implicit Place search using SMT with State Equation took 5164 ms to find 0 implicit places.
[2024-05-27 01:32:26] [INFO ] Invariant cache hit.
[2024-05-27 01:32:27] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3805/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6172 ms. Remains : 3805/3806 places, 506/506 transitions.
Support contains 1340 out of 3805 places after structural reductions.
[2024-05-27 01:32:27] [INFO ] Flatten gal took : 248 ms
[2024-05-27 01:32:27] [INFO ] Flatten gal took : 130 ms
[2024-05-27 01:32:28] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 1338 out of 3805 places (down from 1340) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 957 ms. (steps per millisecond=10 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-27 01:32:29] [INFO ] Invariant cache hit.
[2024-05-27 01:32:30] [INFO ] After 1685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-27 01:32:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 01:32:33] [INFO ] [Nat]Absence check using 1 positive and 3299 generalized place invariants in 785 ms returned sat
[2024-05-27 01:32:55] [INFO ] After 20528ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :15
[2024-05-27 01:32:55] [INFO ] After 20535ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-27 01:32:55] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Fused 19 Parikh solutions to 8 different solutions.
Parikh walk visited 11 properties in 70 ms.
Support contains 75 out of 3805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 2648 are kept as prefixes of interest. Removing 1157 places using SCC suffix rule.19 ms
Discarding 1157 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Drop transitions removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 328 rules applied. Total rules applied 329 place count 2582 transition count 212
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 363 place count 2551 transition count 209
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 366 place count 2548 transition count 209
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 366 place count 2548 transition count 114
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 1053 places
Reduce places removed 1148 places and 0 transitions.
Iterating global reduction 3 with 1243 rules applied. Total rules applied 1609 place count 1400 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1609 place count 1400 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1611 place count 1399 transition count 113
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1673 place count 1368 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1674 place count 1367 transition count 81
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 1366 transition count 81
Applied a total of 1675 rules in 456 ms. Remains 1366 /3805 variables (removed 2439) and now considering 81/506 (removed 425) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 1366/3805 places, 81/506 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 81 rows 1366 cols
[2024-05-27 01:32:56] [INFO ] Computed 1285 invariants in 11 ms
[2024-05-27 01:32:57] [INFO ] [Real]Absence check using 0 positive and 1285 generalized place invariants in 247 ms returned sat
[2024-05-27 01:32:57] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3805 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3805 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 99 out of 3805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 2615 are kept as prefixes of interest. Removing 1190 places using SCC suffix rule.32 ms
Discarding 1190 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2614 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2613 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2613 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 2612 transition count 439
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 2612 transition count 439
Applied a total of 36 rules in 912 ms. Remains 2612 /3805 variables (removed 1193) and now considering 439/506 (removed 67) transitions.
// Phase 1: matrix 439 rows 2612 cols
[2024-05-27 01:32:59] [INFO ] Computed 2176 invariants in 23 ms
[2024-05-27 01:33:02] [INFO ] Implicit Places using invariants in 3395 ms returned []
[2024-05-27 01:33:02] [INFO ] Invariant cache hit.
[2024-05-27 01:33:09] [INFO ] Implicit Places using invariants and state equation in 6607 ms returned [1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1170, 1171, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 2222, 2223, 2224, 2225, 2226, 2227, 2228, 2229, 2585, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2604, 2605, 2606, 2607, 2608, 2609, 2610, 2611]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 10012 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2546/3805 places, 439/506 transitions.
Applied a total of 0 rules in 160 ms. Remains 2546 /2546 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11084 ms. Remains : 2546/3805 places, 439/506 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s2414 s2415 s2416 s2417 s2418 s2419 s2420 s2421 s2422 s2423 s2424 s2425 s2426 s2427 s2428 s2429 s2430 s2431 s2432 s2433 s2434 s2435 s2436 s243...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2442 reset in 1052 ms.
Product exploration explored 100000 steps with 2441 reset in 905 ms.
Computed a total of 2546 stabilizing places and 439 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2546 transition count 439
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 194 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 702569 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 702569 steps, saw 86711 distinct states, run finished after 3002 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 439 rows 2546 cols
[2024-05-27 01:33:15] [INFO ] Computed 2112 invariants in 29 ms
[2024-05-27 01:33:16] [INFO ] [Real]Absence check using 0 positive and 2112 generalized place invariants in 438 ms returned sat
[2024-05-27 01:33:26] [INFO ] After 10859ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 01:33:26] [INFO ] [Nat]Absence check using 0 positive and 2112 generalized place invariants in 454 ms returned sat
[2024-05-27 01:33:41] [INFO ] After 14705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 01:33:47] [INFO ] After 20486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1893 ms.
[2024-05-27 01:33:49] [INFO ] After 23381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 30 ms.
Support contains 99 out of 2546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2546/2546 places, 439/439 transitions.
Graph (complete) has 39767 edges and 2546 vertex of which 2544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 2478 transition count 202
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 334 place count 2445 transition count 202
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 334 place count 2445 transition count 135
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 167 rules applied. Total rules applied 501 place count 2345 transition count 135
Applied a total of 501 rules in 183 ms. Remains 2345 /2546 variables (removed 201) and now considering 135/439 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 2345/2546 places, 135/439 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 524195 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 524195 steps, saw 64399 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 2345 cols
[2024-05-27 01:33:53] [INFO ] Computed 2210 invariants in 23 ms
[2024-05-27 01:33:53] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 01:33:54] [INFO ] [Nat]Absence check using 0 positive and 2210 generalized place invariants in 452 ms returned sat
[2024-05-27 01:33:56] [INFO ] After 3298ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 411 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Support contains 33 out of 2546 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2546/2546 places, 439/439 transitions.
Applied a total of 0 rules in 136 ms. Remains 2546 /2546 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 2546 cols
[2024-05-27 01:33:57] [INFO ] Computed 2112 invariants in 17 ms
[2024-05-27 01:34:00] [INFO ] Implicit Places using invariants in 3192 ms returned []
[2024-05-27 01:34:00] [INFO ] Invariant cache hit.
[2024-05-27 01:34:07] [INFO ] Implicit Places using invariants and state equation in 6790 ms returned []
Implicit Place search using SMT with State Equation took 9984 ms to find 0 implicit places.
[2024-05-27 01:34:07] [INFO ] Redundant transitions in 54 ms returned [419]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 438 rows 2546 cols
[2024-05-27 01:34:07] [INFO ] Computed 2112 invariants in 11 ms
[2024-05-27 01:34:08] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2546/2546 places, 438/439 transitions.
Graph (complete) has 39767 edges and 2546 vertex of which 2545 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 137 ms. Remains 2545 /2546 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 2545 cols
[2024-05-27 01:34:08] [INFO ] Computed 2112 invariants in 18 ms
[2024-05-27 01:34:11] [INFO ] Implicit Places using invariants in 3380 ms returned []
[2024-05-27 01:34:11] [INFO ] Invariant cache hit.
[2024-05-27 01:34:18] [INFO ] Implicit Places using invariants and state equation in 6260 ms returned []
Implicit Place search using SMT with State Equation took 9656 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2545/2546 places, 437/439 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21012 ms. Remains : 2545/2546 places, 437/439 transitions.
Computed a total of 2545 stabilizing places and 437 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2545 transition count 437
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 : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 226 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 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1880444 steps, run timeout after 3001 ms. (steps per millisecond=626 ) properties seen :{}
Probabilistic random walk after 1880444 steps, saw 225189 distinct states, run finished after 3001 ms. (steps per millisecond=626 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 01:34:21] [INFO ] Invariant cache hit.
[2024-05-27 01:34:22] [INFO ] [Real]Absence check using 0 positive and 2112 generalized place invariants in 438 ms returned sat
[2024-05-27 01:34:23] [INFO ] After 1866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 01:34:24] [INFO ] [Nat]Absence check using 0 positive and 2112 generalized place invariants in 449 ms returned sat
[2024-05-27 01:34:25] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 01:34:25] [INFO ] After 1248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-27 01:34:25] [INFO ] After 2062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 201 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2444 reset in 592 ms.
Product exploration explored 100000 steps with 2438 reset in 500 ms.
Built C files in :
/tmp/ltsmin6221670914304317471
[2024-05-27 01:34:27] [INFO ] Computing symmetric may disable matrix : 437 transitions.
[2024-05-27 01:34:27] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:34:27] [INFO ] Computing symmetric may enable matrix : 437 transitions.
[2024-05-27 01:34:27] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:34:27] [INFO ] Computing Do-Not-Accords matrix : 437 transitions.
[2024-05-27 01:34:27] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:34:27] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6221670914304317471
Running compilation step : cd /tmp/ltsmin6221670914304317471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2391 ms.
Running link step : cd /tmp/ltsmin6221670914304317471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6221670914304317471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased825036011157744937.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 2545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2545/2545 places, 437/437 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2545 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2544 transition count 436
Applied a total of 2 rules in 201 ms. Remains 2544 /2545 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 2544 cols
[2024-05-27 01:34:42] [INFO ] Computed 2112 invariants in 12 ms
[2024-05-27 01:34:45] [INFO ] Implicit Places using invariants in 3371 ms returned []
[2024-05-27 01:34:45] [INFO ] Invariant cache hit.
[2024-05-27 01:34:52] [INFO ] Implicit Places using invariants and state equation in 6630 ms returned []
Implicit Place search using SMT with State Equation took 10015 ms to find 0 implicit places.
[2024-05-27 01:34:52] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-27 01:34:52] [INFO ] Invariant cache hit.
[2024-05-27 01:34:53] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2544/2545 places, 436/437 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11208 ms. Remains : 2544/2545 places, 436/437 transitions.
Built C files in :
/tmp/ltsmin11645506035194571848
[2024-05-27 01:34:53] [INFO ] Computing symmetric may disable matrix : 436 transitions.
[2024-05-27 01:34:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:34:53] [INFO ] Computing symmetric may enable matrix : 436 transitions.
[2024-05-27 01:34:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:34:53] [INFO ] Computing Do-Not-Accords matrix : 436 transitions.
[2024-05-27 01:34:53] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:34:53] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11645506035194571848
Running compilation step : cd /tmp/ltsmin11645506035194571848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2131 ms.
Running link step : cd /tmp/ltsmin11645506035194571848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11645506035194571848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17343614536126680708.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:35:08] [INFO ] Flatten gal took : 69 ms
[2024-05-27 01:35:08] [INFO ] Flatten gal took : 81 ms
[2024-05-27 01:35:08] [INFO ] Time to serialize gal into /tmp/LTL884922220922370356.gal : 15 ms
[2024-05-27 01:35:08] [INFO ] Time to serialize properties into /tmp/LTL10457729814674182180.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL884922220922370356.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1862662108646104376.hoa' '-atoms' '/tmp/LTL10457729814674182180.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10457729814674182180.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1862662108646104376.hoa
Detected timeout of ITS tools.
[2024-05-27 01:35:23] [INFO ] Flatten gal took : 78 ms
[2024-05-27 01:35:23] [INFO ] Flatten gal took : 69 ms
[2024-05-27 01:35:24] [INFO ] Time to serialize gal into /tmp/LTL3532116109956678037.gal : 9 ms
[2024-05-27 01:35:24] [INFO ] Time to serialize properties into /tmp/LTL10136562477519760045.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3532116109956678037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10136562477519760045.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((((n5_24+n5_25)+(n5_26+n5_27))+((n5_20+n5_21)+(n5_22+n5_23)))+(((n5_32+n5_28)+(n5_29+n5_30))+((n5_31+n5_9)+(n5_8+n5_11)))...970
Formula 0 simplified : G(F!"(((((((n5_24+n5_25)+(n5_26+n5_27))+((n5_20+n5_21)+(n5_22+n5_23)))+(((n5_32+n5_28)+(n5_29+n5_30))+((n5_31+n5_9)+(n5_8+n5_11))))+...962
Detected timeout of ITS tools.
[2024-05-27 01:35:39] [INFO ] Flatten gal took : 58 ms
[2024-05-27 01:35:39] [INFO ] Applying decomposition
[2024-05-27 01:35:39] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4247640277768975919.txt' '-o' '/tmp/graph4247640277768975919.bin' '-w' '/tmp/graph4247640277768975919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4247640277768975919.bin' '-l' '-1' '-v' '-w' '/tmp/graph4247640277768975919.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:35:39] [INFO ] Decomposing Gal with order
[2024-05-27 01:35:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:35:40] [INFO ] Removed a total of 296 redundant transitions.
[2024-05-27 01:35:40] [INFO ] Flatten gal took : 448 ms
[2024-05-27 01:35:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 520 labels/synchronizations in 224 ms.
[2024-05-27 01:35:40] [INFO ] Time to serialize gal into /tmp/LTL18195020571667738600.gal : 23 ms
[2024-05-27 01:35:40] [INFO ] Time to serialize properties into /tmp/LTL9558720197948799974.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18195020571667738600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9558720197948799974.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((((gu125.n5_24+gu125.n5_25)+(gu125.n5_26+gu125.n5_27))+((gu125.n5_20+gu125.n5_21)+(gu125.n5_22+gu125.n5_23)))+(((gu125.n5...1663
Formula 0 simplified : G(F!"(((((((gu125.n5_24+gu125.n5_25)+(gu125.n5_26+gu125.n5_27))+((gu125.n5_20+gu125.n5_21)+(gu125.n5_22+gu125.n5_23)))+(((gu125.n5_3...1655
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17880404380505230807
[2024-05-27 01:35:56] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17880404380505230807
Running compilation step : cd /tmp/ltsmin17880404380505230807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1628 ms.
Running link step : cd /tmp/ltsmin17880404380505230807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17880404380505230807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-01 finished in 193090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 100 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3769 transition count 506
Applied a total of 36 rules in 243 ms. Remains 3769 /3805 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3769 cols
[2024-05-27 01:36:11] [INFO ] Computed 3265 invariants in 25 ms
[2024-05-27 01:36:14] [INFO ] Implicit Places using invariants in 3289 ms returned []
[2024-05-27 01:36:14] [INFO ] Invariant cache hit.
[2024-05-27 01:36:24] [INFO ] Implicit Places using invariants and state equation in 9720 ms returned [2314, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2326, 2327, 2330, 2331, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2340, 2341, 2342, 2343, 2344, 2345, 2354, 2355, 2356, 2357, 2358, 2359, 2360]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13018 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3805 places, 506/506 transitions.
Applied a total of 0 rules in 234 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13496 ms. Remains : 3736/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s220 (ADD s3678 s3679 s3680 s3681 s3682 s3683 s3684 s3685 s3686 s3687 s3688 s3689 s3690 s3691 s3692 s3693 s3694 s3695 s3696 s3697 s3698 s3699 s370...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2674 reset in 368 ms.
Product exploration explored 100000 steps with 2669 reset in 390 ms.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-27 01:36:26] [INFO ] Computed 3232 invariants in 29 ms
[2024-05-27 01:36:27] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 01:36:28] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 760 ms returned sat
[2024-05-27 01:36:29] [INFO ] After 2732ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-02 finished in 18661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(G(p1)))))))'
Support contains 1123 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3769 transition count 506
Applied a total of 36 rules in 138 ms. Remains 3769 /3805 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3769 cols
[2024-05-27 01:36:29] [INFO ] Computed 3265 invariants in 27 ms
[2024-05-27 01:36:32] [INFO ] Implicit Places using invariants in 2475 ms returned []
[2024-05-27 01:36:32] [INFO ] Invariant cache hit.
[2024-05-27 01:36:40] [INFO ] Implicit Places using invariants and state equation in 7566 ms returned [2314, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2326, 2327, 2330, 2331, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2340, 2341, 2342, 2343, 2344, 2345, 2354, 2355, 2356, 2357, 2358, 2359, 2360]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 10063 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3805 places, 506/506 transitions.
Applied a total of 0 rules in 133 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10341 ms. Remains : 3736/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 (ADD s1274 s1275 s1276 s1277 s1278 s1279 s1280 s1281 s1282 s1283 s1284 s1306 s1307 s1308 s1309 s1310 s1311 s1312 s1313 s1314 s1315 s1316 s1317 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-03 finished in 10630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G((p0||(p1 U G(p2))))&&F(p0)) U p3)))'
Support contains 103 out of 3805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 3771 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.16 ms
Discarding 34 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3770 transition count 505
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 3770 transition count 505
Applied a total of 4 rules in 813 ms. Remains 3770 /3805 variables (removed 35) and now considering 505/506 (removed 1) transitions.
// Phase 1: matrix 505 rows 3770 cols
[2024-05-27 01:36:41] [INFO ] Computed 3266 invariants in 30 ms
[2024-05-27 01:36:47] [INFO ] Implicit Places using invariants in 6244 ms returned []
[2024-05-27 01:36:47] [INFO ] Invariant cache hit.
[2024-05-27 01:36:58] [INFO ] Implicit Places using invariants and state equation in 10841 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17101 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3737/3805 places, 505/506 transitions.
Applied a total of 0 rules in 627 ms. Remains 3737 /3737 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18544 ms. Remains : 3737/3805 places, 505/506 transitions.
Stuttering acceptance computed with spot in 374 ms :[(NOT p3), true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR p3 p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(LEQ s3528 (ADD s156 s160 s161 s162 s163 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s192 s193 s194 s195 s196 s197 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2678 reset in 900 ms.
Product exploration explored 100000 steps with 2673 reset in 932 ms.
Computed a total of 3737 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3737 transition count 505
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)))), (X (OR p3 p0 p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p2 p1)), (X p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p3) (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1))))), (X (X (OR p3 p0 p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (NOT (AND (NOT p3) p0)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 35 factoid took 3162 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p3), true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p3)]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 505 rows 3737 cols
[2024-05-27 01:37:06] [INFO ] Computed 3233 invariants in 311 ms
[2024-05-27 01:37:07] [INFO ] After 1158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-27 01:37:09] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 809 ms returned sat
[2024-05-27 01:37:32] [INFO ] After 22430ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2024-05-27 01:37:32] [INFO ] After 22434ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-27 01:37:32] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 21 ms.
Support contains 69 out of 3737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3737/3737 places, 505/505 transitions.
Graph (complete) has 42114 edges and 3737 vertex of which 2613 are kept as prefixes of interest. Removing 1124 places using SCC suffix rule.4 ms
Discarding 1124 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 330 rules applied. Total rules applied 331 place count 2547 transition count 239
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 364 place count 2514 transition count 239
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 364 place count 2514 transition count 173
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 32 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 528 place count 2416 transition count 173
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 560 place count 2384 transition count 141
Iterating global reduction 2 with 32 rules applied. Total rules applied 592 place count 2384 transition count 141
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 1056 places
Reduce places removed 1089 places and 0 transitions.
Iterating global reduction 2 with 1122 rules applied. Total rules applied 1714 place count 1295 transition count 108
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 1089 places
Reduce places removed 1122 places and 0 transitions.
Iterating global reduction 2 with 1155 rules applied. Total rules applied 2869 place count 173 transition count 75
Applied a total of 2869 rules in 430 ms. Remains 173 /3737 variables (removed 3564) and now considering 75/505 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 173/3737 places, 75/505 transitions.
Incomplete random walk after 10000 steps, including 277 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 75 rows 173 cols
[2024-05-27 01:37:33] [INFO ] Computed 99 invariants in 0 ms
[2024-05-27 01:37:33] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 01:37:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 01:37:33] [INFO ] [Nat]Absence check using 1 positive and 98 generalized place invariants in 17 ms returned sat
[2024-05-27 01:37:33] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)))), (X (OR p3 p0 p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p2 p1)), (X p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p3) (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1))))), (X (X (OR p3 p0 p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (NOT (AND (NOT p3) p0)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p3)))), (G (NOT p0)), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND (NOT p0) p1))), (F (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))), (F (NOT (OR p0 p1 p2 p3))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND p1 (NOT p2))), (F (NOT (AND p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1 (NOT p3)))
Knowledge based reduction with 39 factoid took 3921 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-05 finished in 57335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 66 out of 3805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 2616 are kept as prefixes of interest. Removing 1189 places using SCC suffix rule.9 ms
Discarding 1189 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2615 transition count 444
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2581 transition count 376
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2581 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 2580 transition count 375
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 2580 transition count 375
Applied a total of 102 rules in 634 ms. Remains 2580 /3805 variables (removed 1225) and now considering 375/506 (removed 131) transitions.
// Phase 1: matrix 375 rows 2580 cols
[2024-05-27 01:37:38] [INFO ] Computed 2208 invariants in 16 ms
[2024-05-27 01:37:41] [INFO ] Implicit Places using invariants in 3411 ms returned []
[2024-05-27 01:37:41] [INFO ] Invariant cache hit.
[2024-05-27 01:37:48] [INFO ] Implicit Places using invariants and state equation in 7144 ms returned [1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1138, 1139, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 2190, 2191, 2192, 2193, 2194, 2195, 2196, 2197, 2553, 2556, 2557, 2558, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 10567 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2514/3805 places, 375/506 transitions.
Applied a total of 0 rules in 183 ms. Remains 2514 /2514 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11400 ms. Remains : 2514/3805 places, 375/506 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, true, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GT (ADD s2379 s2380 s2381 s2382 s2383 s2384 s2385 s2386 s2387 s2391 s2392 s2393 s2394 s2395 s2396 s2397 s2398 s2399 s2400 s2401 s2402 s2403 s2404 s240...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2443 reset in 592 ms.
Product exploration explored 100000 steps with 2441 reset in 575 ms.
Computed a total of 2514 stabilizing places and 375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2514 transition count 375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, p0]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2060007 steps, run timeout after 3001 ms. (steps per millisecond=686 ) properties seen :{}
Probabilistic random walk after 2060007 steps, saw 246432 distinct states, run finished after 3001 ms. (steps per millisecond=686 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 2514 cols
[2024-05-27 01:37:54] [INFO ] Computed 2144 invariants in 17 ms
[2024-05-27 01:37:54] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 01:37:55] [INFO ] [Nat]Absence check using 0 positive and 2144 generalized place invariants in 449 ms returned sat
[2024-05-27 01:37:55] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 01:37:55] [INFO ] After 854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-27 01:37:56] [INFO ] After 1715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-06 finished in 18426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 68 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3769 transition count 506
Applied a total of 36 rules in 257 ms. Remains 3769 /3805 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3769 cols
[2024-05-27 01:37:56] [INFO ] Computed 3265 invariants in 27 ms
[2024-05-27 01:37:59] [INFO ] Implicit Places using invariants in 3405 ms returned []
[2024-05-27 01:37:59] [INFO ] Invariant cache hit.
[2024-05-27 01:38:10] [INFO ] Implicit Places using invariants and state equation in 10677 ms returned [2314, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2326, 2327, 2330, 2331, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2340, 2341, 2342, 2343, 2344, 2345, 2354, 2355, 2356, 2357, 2358, 2359, 2360]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14095 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3805 places, 506/506 transitions.
Applied a total of 0 rules in 259 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14612 ms. Remains : 3736/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s1285 s1286 s1287 s1288 s1289 s1290 s1291 s1292 s1293 s1294 s1295 s1296 s1297 s1298 s1299 s1300 s1301 s1302 s1303 s1304 s1305 s1370 s1371 s137...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-07 finished in 14748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3737 transition count 506
Applied a total of 68 rules in 253 ms. Remains 3737 /3805 variables (removed 68) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2024-05-27 01:38:11] [INFO ] Computed 3232 invariants in 28 ms
[2024-05-27 01:38:14] [INFO ] Implicit Places using invariants in 3249 ms returned []
[2024-05-27 01:38:14] [INFO ] Invariant cache hit.
[2024-05-27 01:38:26] [INFO ] Implicit Places using invariants and state equation in 12310 ms returned [2282, 2283, 2284, 2285, 2286, 2287, 2288, 2289, 2294, 2295, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2313, 2322, 2323, 2324, 2325, 2326, 2327, 2328]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15588 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3805 places, 506/506 transitions.
Applied a total of 0 rules in 252 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16093 ms. Remains : 3704/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s220 s3531)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1894 ms.
Product exploration explored 100000 steps with 50000 reset in 1847 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-08 finished in 20665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p0 U (p1||G(p0)))) U (p2&&X((p0 U (p1||G(p0)))))))))'
Support contains 3 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 3736 transition count 506
Applied a total of 69 rules in 249 ms. Remains 3736 /3805 variables (removed 69) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-27 01:38:31] [INFO ] Computed 3232 invariants in 44 ms
[2024-05-27 01:38:35] [INFO ] Implicit Places using invariants in 3294 ms returned []
[2024-05-27 01:38:35] [INFO ] Invariant cache hit.
[2024-05-27 01:38:45] [INFO ] Implicit Places using invariants and state equation in 9982 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13301 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3805 places, 506/506 transitions.
Applied a total of 0 rules in 252 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13803 ms. Remains : 3703/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT 1 s0), p1:(AND (GT 1 s2676) (GT 3 s217)), p0:(GT 3 s217)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22284 reset in 963 ms.
Product exploration explored 100000 steps with 22177 reset in 986 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 506 rows 3703 cols
[2024-05-27 01:38:49] [INFO ] Computed 3200 invariants in 413 ms
[2024-05-27 01:38:50] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 733 ms returned sat
[2024-05-27 01:38:51] [INFO ] After 1470ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-27 01:38:52] [INFO ] After 1604ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-27 01:38:52] [INFO ] After 2941ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 139 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 589 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
[2024-05-27 01:38:52] [INFO ] Invariant cache hit.
[2024-05-27 01:39:07] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 12915 ms returned sat
[2024-05-27 01:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:39:07] [INFO ] [Real]Absence check using state equation in 614 ms returned unknown
Could not prove EG (NOT p2)
Support contains 1 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.12 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3666 transition count 501
Applied a total of 5 rules in 544 ms. Remains 3666 /3703 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3666 cols
[2024-05-27 01:39:09] [INFO ] Computed 3168 invariants in 603 ms
[2024-05-27 01:39:15] [INFO ] Implicit Places using invariants in 6605 ms returned []
[2024-05-27 01:39:15] [INFO ] Invariant cache hit.
[2024-05-27 01:39:29] [INFO ] Implicit Places using invariants and state equation in 14104 ms returned [3309, 3310, 3311, 3312, 3313, 3314, 3315, 3316, 3639, 3642, 3643, 3644, 3645, 3646, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 20738 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3703 places, 501/506 transitions.
Applied a total of 0 rules in 272 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21556 ms. Remains : 3633/3703 places, 501/506 transitions.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 501 rows 3633 cols
[2024-05-27 01:39:31] [INFO ] Computed 3136 invariants in 572 ms
[2024-05-27 01:39:43] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 10754 ms returned sat
[2024-05-27 01:39:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:39:46] [INFO ] [Real]Absence check using state equation in 2825 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 2945 reset in 508 ms.
Product exploration explored 100000 steps with 2941 reset in 503 ms.
Built C files in :
/tmp/ltsmin4615432605323366251
[2024-05-27 01:39:47] [INFO ] Computing symmetric may disable matrix : 501 transitions.
[2024-05-27 01:39:47] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:39:47] [INFO ] Computing symmetric may enable matrix : 501 transitions.
[2024-05-27 01:39:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:39:47] [INFO ] Computing Do-Not-Accords matrix : 501 transitions.
[2024-05-27 01:39:47] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:39:47] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4615432605323366251
Running compilation step : cd /tmp/ltsmin4615432605323366251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2758 ms.
Running link step : cd /tmp/ltsmin4615432605323366251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4615432605323366251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17068684442619945974.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 3633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 261 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-27 01:40:02] [INFO ] Invariant cache hit.
[2024-05-27 01:40:08] [INFO ] Implicit Places using invariants in 5888 ms returned []
[2024-05-27 01:40:08] [INFO ] Invariant cache hit.
[2024-05-27 01:40:19] [INFO ] Implicit Places using invariants and state equation in 11656 ms returned []
Implicit Place search using SMT with State Equation took 17547 ms to find 0 implicit places.
[2024-05-27 01:40:20] [INFO ] Redundant transitions in 57 ms returned []
[2024-05-27 01:40:20] [INFO ] Invariant cache hit.
[2024-05-27 01:40:21] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19425 ms. Remains : 3633/3633 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin2777131491854679113
[2024-05-27 01:40:21] [INFO ] Computing symmetric may disable matrix : 501 transitions.
[2024-05-27 01:40:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:40:21] [INFO ] Computing symmetric may enable matrix : 501 transitions.
[2024-05-27 01:40:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:40:21] [INFO ] Computing Do-Not-Accords matrix : 501 transitions.
[2024-05-27 01:40:21] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:40:21] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2777131491854679113
Running compilation step : cd /tmp/ltsmin2777131491854679113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2596 ms.
Running link step : cd /tmp/ltsmin2777131491854679113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2777131491854679113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17451148930336842519.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:40:36] [INFO ] Flatten gal took : 103 ms
[2024-05-27 01:40:36] [INFO ] Flatten gal took : 92 ms
[2024-05-27 01:40:36] [INFO ] Time to serialize gal into /tmp/LTL12140976980754038577.gal : 10 ms
[2024-05-27 01:40:36] [INFO ] Time to serialize properties into /tmp/LTL12485033036078012128.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12140976980754038577.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14826597813045883728.hoa' '-atoms' '/tmp/LTL12485033036078012128.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12485033036078012128.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14826597813045883728.hoa
Detected timeout of ITS tools.
[2024-05-27 01:40:52] [INFO ] Flatten gal took : 81 ms
[2024-05-27 01:40:52] [INFO ] Flatten gal took : 76 ms
[2024-05-27 01:40:52] [INFO ] Time to serialize gal into /tmp/LTL10860806409198281682.gal : 10 ms
[2024-05-27 01:40:52] [INFO ] Time to serialize properties into /tmp/LTL1094438706130576647.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10860806409198281682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1094438706130576647.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(("(Sstart_6<3)")U((G("(Sstart_6<3)"))||("((n8_15_2<1)&&(Sstart_6<3))"))))U(("(malicious_reservoir<1)")&&(X(("(Sstart_6<3)")U...216
Formula 0 simplified : XF(!"(malicious_reservoir<1)" W X(!"(Sstart_6<3)" M !"((n8_15_2<1)&&(Sstart_6<3))"))
Detected timeout of ITS tools.
[2024-05-27 01:41:07] [INFO ] Flatten gal took : 76 ms
[2024-05-27 01:41:07] [INFO ] Applying decomposition
[2024-05-27 01:41:07] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph644515865242626824.txt' '-o' '/tmp/graph644515865242626824.bin' '-w' '/tmp/graph644515865242626824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph644515865242626824.bin' '-l' '-1' '-v' '-w' '/tmp/graph644515865242626824.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:41:07] [INFO ] Decomposing Gal with order
[2024-05-27 01:41:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:41:08] [INFO ] Removed a total of 363 redundant transitions.
[2024-05-27 01:41:08] [INFO ] Flatten gal took : 229 ms
[2024-05-27 01:41:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 87 ms.
[2024-05-27 01:41:08] [INFO ] Time to serialize gal into /tmp/LTL15186253417282032085.gal : 51 ms
[2024-05-27 01:41:08] [INFO ] Time to serialize properties into /tmp/LTL9489695048342661495.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15186253417282032085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9489695048342661495.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(("(i45.u70.Sstart_6<3)")U((G("(i45.u70.Sstart_6<3)"))||("((u17.n8_15_2<1)&&(i45.u70.Sstart_6<3))"))))U(("(u0.malicious_reser...275
Formula 0 simplified : XF(!"(u0.malicious_reservoir<1)" W X(!"(i45.u70.Sstart_6<3)" M !"((u17.n8_15_2<1)&&(i45.u70.Sstart_6<3))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2358547991215836532
[2024-05-27 01:41:23] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2358547991215836532
Running compilation step : cd /tmp/ltsmin2358547991215836532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2205 ms.
Running link step : cd /tmp/ltsmin2358547991215836532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2358547991215836532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ((LTLAPp2==true)&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-12 finished in 186836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 3 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 3738 transition count 506
Applied a total of 67 rules in 240 ms. Remains 3738 /3805 variables (removed 67) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3738 cols
[2024-05-27 01:41:38] [INFO ] Computed 3233 invariants in 80 ms
[2024-05-27 01:41:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 01:41:42] [INFO ] Implicit Places using invariants in 3646 ms returned []
[2024-05-27 01:41:42] [INFO ] Invariant cache hit.
[2024-05-27 01:41:53] [INFO ] Implicit Places using invariants and state equation in 10798 ms returned [2282, 2283, 2284, 2285, 2286, 2287, 2288, 2289, 2294, 2295, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2313, 2322, 2323, 2324, 2325, 2326, 2327, 2328]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14447 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3705/3805 places, 506/506 transitions.
Applied a total of 0 rules in 257 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14944 ms. Remains : 3705/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(LEQ s233 s3514), p0:(LEQ 1 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5195 reset in 520 ms.
Product exploration explored 100000 steps with 5264 reset in 543 ms.
Computed a total of 3705 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3705 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 506 rows 3705 cols
[2024-05-27 01:41:56] [INFO ] Computed 3200 invariants in 44 ms
[2024-05-27 01:42:07] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 9383 ms returned sat
[2024-05-27 01:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:42:11] [INFO ] [Real]Absence check using state equation in 4100 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 252 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-27 01:42:11] [INFO ] Invariant cache hit.
[2024-05-27 01:42:17] [INFO ] Implicit Places using invariants in 5913 ms returned []
[2024-05-27 01:42:17] [INFO ] Invariant cache hit.
[2024-05-27 01:42:30] [INFO ] Implicit Places using invariants and state equation in 13307 ms returned []
Implicit Place search using SMT with State Equation took 19222 ms to find 0 implicit places.
[2024-05-27 01:42:30] [INFO ] Invariant cache hit.
[2024-05-27 01:42:32] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20991 ms. Remains : 3705/3705 places, 506/506 transitions.
Computed a total of 3705 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3705 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 20 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 3 factoid took 322 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-27 01:42:33] [INFO ] Invariant cache hit.
[2024-05-27 01:42:44] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 9408 ms returned sat
[2024-05-27 01:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:42:48] [INFO ] [Real]Absence check using state equation in 4073 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5156 reset in 513 ms.
Product exploration explored 100000 steps with 5152 reset in 525 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 3705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3705 transition count 508
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 889 ms. Remains 3705 /3705 variables (removed 0) and now considering 508/506 (removed -2) transitions.
[2024-05-27 01:42:51] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 508 rows 3705 cols
[2024-05-27 01:42:51] [INFO ] Computed 3200 invariants in 32 ms
[2024-05-27 01:42:52] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3705/3705 places, 508/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1665 ms. Remains : 3705/3705 places, 508/506 transitions.
Built C files in :
/tmp/ltsmin1322796971187035095
[2024-05-27 01:42:52] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1322796971187035095
Running compilation step : cd /tmp/ltsmin1322796971187035095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2370 ms.
Running link step : cd /tmp/ltsmin1322796971187035095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1322796971187035095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9861662406191737669.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 245 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2024-05-27 01:43:07] [INFO ] Computed 3200 invariants in 43 ms
[2024-05-27 01:43:13] [INFO ] Implicit Places using invariants in 6043 ms returned []
[2024-05-27 01:43:13] [INFO ] Invariant cache hit.
[2024-05-27 01:43:26] [INFO ] Implicit Places using invariants and state equation in 13137 ms returned []
Implicit Place search using SMT with State Equation took 19184 ms to find 0 implicit places.
[2024-05-27 01:43:26] [INFO ] Invariant cache hit.
[2024-05-27 01:43:28] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20953 ms. Remains : 3705/3705 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin10373250104301145043
[2024-05-27 01:43:28] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10373250104301145043
Running compilation step : cd /tmp/ltsmin10373250104301145043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2292 ms.
Running link step : cd /tmp/ltsmin10373250104301145043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10373250104301145043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5401209858900003482.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:43:43] [INFO ] Flatten gal took : 73 ms
[2024-05-27 01:43:43] [INFO ] Flatten gal took : 73 ms
[2024-05-27 01:43:43] [INFO ] Time to serialize gal into /tmp/LTL16236521504463987264.gal : 12 ms
[2024-05-27 01:43:43] [INFO ] Time to serialize properties into /tmp/LTL12102610079097561158.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16236521504463987264.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15212452392357512256.hoa' '-atoms' '/tmp/LTL12102610079097561158.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12102610079097561158.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15212452392357512256.hoa
Detected timeout of ITS tools.
[2024-05-27 01:43:58] [INFO ] Flatten gal took : 70 ms
[2024-05-27 01:43:58] [INFO ] Flatten gal took : 72 ms
[2024-05-27 01:43:58] [INFO ] Time to serialize gal into /tmp/LTL1078580767911984631.gal : 10 ms
[2024-05-27 01:43:58] [INFO ] Time to serialize properties into /tmp/LTL4817990107324491997.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1078580767911984631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4817990107324491997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X("(CstopAbort>=1)")))||(F("(Sstart_21<=AstopOK)"))))
Formula 0 simplified : XX!"(CstopAbort>=1)" & G!"(Sstart_21<=AstopOK)"
Detected timeout of ITS tools.
[2024-05-27 01:44:13] [INFO ] Flatten gal took : 86 ms
[2024-05-27 01:44:13] [INFO ] Applying decomposition
[2024-05-27 01:44:14] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8590408415737189769.txt' '-o' '/tmp/graph8590408415737189769.bin' '-w' '/tmp/graph8590408415737189769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8590408415737189769.bin' '-l' '-1' '-v' '-w' '/tmp/graph8590408415737189769.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:44:14] [INFO ] Decomposing Gal with order
[2024-05-27 01:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:44:14] [INFO ] Removed a total of 267 redundant transitions.
[2024-05-27 01:44:14] [INFO ] Flatten gal took : 438 ms
[2024-05-27 01:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 317 labels/synchronizations in 127 ms.
[2024-05-27 01:44:15] [INFO ] Time to serialize gal into /tmp/LTL13420794799808359661.gal : 52 ms
[2024-05-27 01:44:15] [INFO ] Time to serialize properties into /tmp/LTL5561731555384679242.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13420794799808359661.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5561731555384679242.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X("(gi1.gi20.gi1.gu2.CstopAbort>=1)")))||(F("(gu94.Sstart_21<=gu94.AstopOK)"))))
Formula 0 simplified : XX!"(gi1.gi20.gi1.gu2.CstopAbort>=1)" & G!"(gu94.Sstart_21<=gu94.AstopOK)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12721238811096427875
[2024-05-27 01:44:30] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12721238811096427875
Running compilation step : cd /tmp/ltsmin12721238811096427875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2186 ms.
Running link step : cd /tmp/ltsmin12721238811096427875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12721238811096427875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X((LTLAPp0==true)))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-13 finished in 187338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 6 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3737 transition count 506
Applied a total of 68 rules in 249 ms. Remains 3737 /3805 variables (removed 68) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2024-05-27 01:44:46] [INFO ] Computed 3232 invariants in 33 ms
[2024-05-27 01:44:52] [INFO ] Implicit Places using invariants in 5966 ms returned []
[2024-05-27 01:44:52] [INFO ] Invariant cache hit.
[2024-05-27 01:45:01] [INFO ] Implicit Places using invariants and state equation in 9240 ms returned [2282, 2283, 2284, 2285, 2286, 2287, 2288, 2289, 2294, 2295, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2313, 2322, 2323, 2324, 2325, 2326, 2327, 2328]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15242 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3805 places, 506/506 transitions.
Applied a total of 0 rules in 261 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15752 ms. Remains : 3704/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (LEQ s85 s1922) (LEQ 3 s30)), p0:(OR (GT s220 s30) (GT s180 s64))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2678 reset in 300 ms.
Product exploration explored 100000 steps with 2676 reset in 333 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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 p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1633993 steps, run timeout after 3001 ms. (steps per millisecond=544 ) properties seen :{}
Probabilistic random walk after 1633993 steps, saw 195964 distinct states, run finished after 3001 ms. (steps per millisecond=544 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3704 cols
[2024-05-27 01:45:06] [INFO ] Computed 3200 invariants in 91 ms
[2024-05-27 01:45:06] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 01:45:07] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 712 ms returned sat
[2024-05-27 01:45:09] [INFO ] After 1308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 01:45:09] [INFO ] After 1435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 314 ms.
[2024-05-27 01:45:09] [INFO ] After 2912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 151 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 3704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 230 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-27 01:45:10] [INFO ] Invariant cache hit.
[2024-05-27 01:45:16] [INFO ] Implicit Places using invariants in 5768 ms returned []
[2024-05-27 01:45:16] [INFO ] Invariant cache hit.
[2024-05-27 01:45:26] [INFO ] Implicit Places using invariants and state equation in 10065 ms returned []
Implicit Place search using SMT with State Equation took 15868 ms to find 0 implicit places.
[2024-05-27 01:45:26] [INFO ] Invariant cache hit.
[2024-05-27 01:45:27] [INFO ] Dead Transitions using invariants and state equation in 1389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17501 ms. Remains : 3704/3704 places, 506/506 transitions.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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 : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1646327 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :{}
Probabilistic random walk after 1646327 steps, saw 197535 distinct states, run finished after 3001 ms. (steps per millisecond=548 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 01:45:31] [INFO ] Invariant cache hit.
[2024-05-27 01:45:32] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 01:45:33] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 754 ms returned sat
[2024-05-27 01:45:34] [INFO ] After 1367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 01:45:34] [INFO ] After 1506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 293 ms.
[2024-05-27 01:45:35] [INFO ] After 2923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2679 reset in 326 ms.
Product exploration explored 100000 steps with 2681 reset in 348 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 3704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3704/3704 places, 506/506 transitions.
Graph (complete) has 40930 edges and 3704 vertex of which 3636 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.10 ms
Discarding 68 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3636 transition count 506
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 485 ms. Remains 3636 /3704 variables (removed 68) and now considering 506/506 (removed 0) transitions.
[2024-05-27 01:45:36] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 506 rows 3636 cols
[2024-05-27 01:45:37] [INFO ] Computed 3136 invariants in 21 ms
[2024-05-27 01:45:38] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3636/3704 places, 506/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2047 ms. Remains : 3636/3704 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin11315436467308988680
[2024-05-27 01:45:38] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11315436467308988680
Running compilation step : cd /tmp/ltsmin11315436467308988680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2171 ms.
Running link step : cd /tmp/ltsmin11315436467308988680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11315436467308988680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1479730306132855087.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 3704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3704/3704 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3703 transition count 506
Applied a total of 1 rules in 259 ms. Remains 3703 /3704 variables (removed 1) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2024-05-27 01:45:54] [INFO ] Computed 3200 invariants in 395 ms
[2024-05-27 01:45:59] [INFO ] Implicit Places using invariants in 6143 ms returned []
[2024-05-27 01:45:59] [INFO ] Invariant cache hit.
[2024-05-27 01:46:11] [INFO ] Implicit Places using invariants and state equation in 11329 ms returned []
Implicit Place search using SMT with State Equation took 17485 ms to find 0 implicit places.
[2024-05-27 01:46:11] [INFO ] Invariant cache hit.
[2024-05-27 01:46:12] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3703/3704 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19134 ms. Remains : 3703/3704 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin4037391949847680006
[2024-05-27 01:46:12] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4037391949847680006
Running compilation step : cd /tmp/ltsmin4037391949847680006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2160 ms.
Running link step : cd /tmp/ltsmin4037391949847680006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4037391949847680006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5576966616995621280.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:46:27] [INFO ] Flatten gal took : 71 ms
[2024-05-27 01:46:27] [INFO ] Flatten gal took : 70 ms
[2024-05-27 01:46:27] [INFO ] Time to serialize gal into /tmp/LTL2974458322606983632.gal : 10 ms
[2024-05-27 01:46:27] [INFO ] Time to serialize properties into /tmp/LTL3590181073923030122.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2974458322606983632.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10468992647643621051.hoa' '-atoms' '/tmp/LTL3590181073923030122.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3590181073923030122.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10468992647643621051.hoa
Detected timeout of ITS tools.
[2024-05-27 01:46:43] [INFO ] Flatten gal took : 69 ms
[2024-05-27 01:46:43] [INFO ] Flatten gal took : 71 ms
[2024-05-27 01:46:43] [INFO ] Time to serialize gal into /tmp/LTL3307371296476074236.gal : 10 ms
[2024-05-27 01:46:43] [INFO ] Time to serialize properties into /tmp/LTL8914918062600840728.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3307371296476074236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8914918062600840728.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("((AstopAbort>c1_31)||(s2_8>s6_27))"))||(X(G("((s5_23<=n7_18_19)||(c1_31>=3))"))))))
Formula 0 simplified : X(F!"((AstopAbort>c1_31)||(s2_8>s6_27))" & XF!"((s5_23<=n7_18_19)||(c1_31>=3))")
Detected timeout of ITS tools.
[2024-05-27 01:46:58] [INFO ] Flatten gal took : 85 ms
[2024-05-27 01:46:58] [INFO ] Applying decomposition
[2024-05-27 01:46:58] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6961336469354544129.txt' '-o' '/tmp/graph6961336469354544129.bin' '-w' '/tmp/graph6961336469354544129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6961336469354544129.bin' '-l' '-1' '-v' '-w' '/tmp/graph6961336469354544129.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:46:58] [INFO ] Decomposing Gal with order
[2024-05-27 01:46:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:46:58] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-27 01:46:59] [INFO ] Flatten gal took : 190 ms
[2024-05-27 01:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 691 labels/synchronizations in 253 ms.
[2024-05-27 01:47:00] [INFO ] Time to serialize gal into /tmp/LTL9212128653285884512.gal : 36 ms
[2024-05-27 01:47:00] [INFO ] Time to serialize properties into /tmp/LTL11093065192827320179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9212128653285884512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11093065192827320179.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((gu1.AstopAbort>gu1.c1_31)||(gu64.s2_8>gu64.s6_27))"))||(X(G("((gu95.s5_23<=gu95.n7_18_19)||(gu1.c1_31>=3))"))))))
Formula 0 simplified : X(F!"((gu1.AstopAbort>gu1.c1_31)||(gu64.s2_8>gu64.s6_27))" & XF!"((gu95.s5_23<=gu95.n7_18_19)||(gu1.c1_31>=3))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15701759586358219970
[2024-05-27 01:47:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15701759586358219970
Running compilation step : cd /tmp/ltsmin15701759586358219970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2168 ms.
Running link step : cd /tmp/ltsmin15701759586358219970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15701759586358219970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-15 finished in 164685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p0 U (p1||G(p0)))) U (p2&&X((p0 U (p1||G(p0)))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-32-LTLCardinality-12
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Support contains 3 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 3702 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.14 ms
Discarding 103 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3699 transition count 501
Applied a total of 5 rules in 618 ms. Remains 3699 /3805 variables (removed 106) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2024-05-27 01:47:31] [INFO ] Computed 3200 invariants in 39 ms
[2024-05-27 01:47:37] [INFO ] Implicit Places using invariants in 5752 ms returned []
[2024-05-27 01:47:37] [INFO ] Invariant cache hit.
[2024-05-27 01:47:49] [INFO ] Implicit Places using invariants and state equation in 12091 ms returned [2278, 2279, 2280, 2281, 2282, 2283, 2284, 2285, 2290, 2291, 2294, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 3342, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3672, 3675, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 17858 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3633/3805 places, 501/506 transitions.
Applied a total of 0 rules in 270 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 18746 ms. Remains : 3633/3805 places, 501/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT 1 s0), p1:(AND (GT 1 s2673) (GT 3 s217)), p0:(GT 3 s217)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22146 reset in 1068 ms.
Product exploration explored 100000 steps with 22222 reset in 1089 ms.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 265 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 501 rows 3633 cols
[2024-05-27 01:47:53] [INFO ] Computed 3136 invariants in 516 ms
[2024-05-27 01:47:54] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 734 ms returned sat
[2024-05-27 01:47:55] [INFO ] After 1314ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-27 01:47:56] [INFO ] After 1441ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-27 01:47:56] [INFO ] After 2764ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 544 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
[2024-05-27 01:47:56] [INFO ] Invariant cache hit.
[2024-05-27 01:48:08] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 9997 ms returned sat
[2024-05-27 01:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:48:11] [INFO ] [Real]Absence check using state equation in 3534 ms returned unknown
Could not prove EG (NOT p2)
Support contains 1 out of 3633 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 247 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-27 01:48:12] [INFO ] Invariant cache hit.
[2024-05-27 01:48:17] [INFO ] Implicit Places using invariants in 5763 ms returned []
[2024-05-27 01:48:17] [INFO ] Invariant cache hit.
[2024-05-27 01:48:29] [INFO ] Implicit Places using invariants and state equation in 11822 ms returned []
Implicit Place search using SMT with State Equation took 17600 ms to find 0 implicit places.
[2024-05-27 01:48:29] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-27 01:48:29] [INFO ] Invariant cache hit.
[2024-05-27 01:48:31] [INFO ] Dead Transitions using invariants and state equation in 1304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19210 ms. Remains : 3633/3633 places, 501/501 transitions.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p2), (NOT p2)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p2), (NOT p2)]
[2024-05-27 01:48:31] [INFO ] Invariant cache hit.
[2024-05-27 01:48:43] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 9915 ms returned sat
[2024-05-27 01:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:48:46] [INFO ] [Real]Absence check using state equation in 3704 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 2946 reset in 493 ms.
Product exploration explored 100000 steps with 2937 reset in 505 ms.
Built C files in :
/tmp/ltsmin16069898137856087920
[2024-05-27 01:48:48] [INFO ] Computing symmetric may disable matrix : 501 transitions.
[2024-05-27 01:48:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:48:48] [INFO ] Computing symmetric may enable matrix : 501 transitions.
[2024-05-27 01:48:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:48:48] [INFO ] Computing Do-Not-Accords matrix : 501 transitions.
[2024-05-27 01:48:48] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:48:48] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16069898137856087920
Running compilation step : cd /tmp/ltsmin16069898137856087920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2696 ms.
Running link step : cd /tmp/ltsmin16069898137856087920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16069898137856087920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12248711133795465688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 3633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 251 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-27 01:49:03] [INFO ] Invariant cache hit.
[2024-05-27 01:49:08] [INFO ] Implicit Places using invariants in 5594 ms returned []
[2024-05-27 01:49:08] [INFO ] Invariant cache hit.
[2024-05-27 01:49:20] [INFO ] Implicit Places using invariants and state equation in 11319 ms returned []
Implicit Place search using SMT with State Equation took 16950 ms to find 0 implicit places.
[2024-05-27 01:49:20] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-27 01:49:20] [INFO ] Invariant cache hit.
[2024-05-27 01:49:21] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18655 ms. Remains : 3633/3633 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin18395888932650642670
[2024-05-27 01:49:21] [INFO ] Computing symmetric may disable matrix : 501 transitions.
[2024-05-27 01:49:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:49:21] [INFO ] Computing symmetric may enable matrix : 501 transitions.
[2024-05-27 01:49:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:49:21] [INFO ] Computing Do-Not-Accords matrix : 501 transitions.
[2024-05-27 01:49:21] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:49:21] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18395888932650642670
Running compilation step : cd /tmp/ltsmin18395888932650642670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2561 ms.
Running link step : cd /tmp/ltsmin18395888932650642670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18395888932650642670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10417624395877236905.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:49:36] [INFO ] Flatten gal took : 83 ms
[2024-05-27 01:49:36] [INFO ] Flatten gal took : 80 ms
[2024-05-27 01:49:36] [INFO ] Time to serialize gal into /tmp/LTL3976585218424309568.gal : 10 ms
[2024-05-27 01:49:36] [INFO ] Time to serialize properties into /tmp/LTL5286066677461316167.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3976585218424309568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14906503679485170967.hoa' '-atoms' '/tmp/LTL5286066677461316167.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5286066677461316167.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14906503679485170967.hoa
Detected timeout of ITS tools.
[2024-05-27 01:49:52] [INFO ] Flatten gal took : 81 ms
[2024-05-27 01:49:52] [INFO ] Flatten gal took : 72 ms
[2024-05-27 01:49:52] [INFO ] Time to serialize gal into /tmp/LTL16435279395039252170.gal : 9 ms
[2024-05-27 01:49:52] [INFO ] Time to serialize properties into /tmp/LTL2580211632151255748.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16435279395039252170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2580211632151255748.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(("(Sstart_6<3)")U((G("(Sstart_6<3)"))||("((n8_15_2<1)&&(Sstart_6<3))"))))U(("(malicious_reservoir<1)")&&(X(("(Sstart_6<3)")U...216
Formula 0 simplified : XF(!"(malicious_reservoir<1)" W X(!"(Sstart_6<3)" M !"((n8_15_2<1)&&(Sstart_6<3))"))
Detected timeout of ITS tools.
[2024-05-27 01:50:07] [INFO ] Flatten gal took : 72 ms
[2024-05-27 01:50:07] [INFO ] Applying decomposition
[2024-05-27 01:50:07] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4581730972529801664.txt' '-o' '/tmp/graph4581730972529801664.bin' '-w' '/tmp/graph4581730972529801664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4581730972529801664.bin' '-l' '-1' '-v' '-w' '/tmp/graph4581730972529801664.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:50:07] [INFO ] Decomposing Gal with order
[2024-05-27 01:50:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:50:07] [INFO ] Removed a total of 363 redundant transitions.
[2024-05-27 01:50:07] [INFO ] Flatten gal took : 197 ms
[2024-05-27 01:50:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 66 ms.
[2024-05-27 01:50:08] [INFO ] Time to serialize gal into /tmp/LTL6641666262757314321.gal : 20 ms
[2024-05-27 01:50:08] [INFO ] Time to serialize properties into /tmp/LTL13221229805787247143.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6641666262757314321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13221229805787247143.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(("(i53.u133.Sstart_6<3)")U((G("(i53.u133.Sstart_6<3)"))||("((u16.n8_15_2<1)&&(i53.u133.Sstart_6<3))"))))U(("(u0.malicious_re...281
Formula 0 simplified : XF(!"(u0.malicious_reservoir<1)" W X(!"(i53.u133.Sstart_6<3)" M !"((u16.n8_15_2<1)&&(i53.u133.Sstart_6<3))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5600457907362019769
[2024-05-27 01:50:23] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5600457907362019769
Running compilation step : cd /tmp/ltsmin5600457907362019769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2451 ms.
Running link step : cd /tmp/ltsmin5600457907362019769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5600457907362019769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ((LTLAPp2==true)&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-12 finished in 187642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-32-LTLCardinality-15
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 3704 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.11 ms
Discarding 101 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3703 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 3702 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 3702 transition count 504
Applied a total of 5 rules in 867 ms. Remains 3702 /3805 variables (removed 103) and now considering 504/506 (removed 2) transitions.
// Phase 1: matrix 504 rows 3702 cols
[2024-05-27 01:50:39] [INFO ] Computed 3200 invariants in 16 ms
[2024-05-27 01:50:42] [INFO ] Implicit Places using invariants in 3322 ms returned []
[2024-05-27 01:50:42] [INFO ] Invariant cache hit.
[2024-05-27 01:50:51] [INFO ] Implicit Places using invariants and state equation in 8759 ms returned [2248, 2249, 2250, 2251, 2252, 2253, 2254, 2255, 2260, 2261, 2264, 2265, 2266, 2267, 2268, 2269, 2270, 2271, 2272, 2273, 2274, 2275, 2276, 2277, 2278, 2279, 2288, 2289, 2290, 2291, 2292, 2293, 2294, 3312, 3313, 3314, 3315, 3316, 3317, 3318, 3319, 3675, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699, 3700, 3701]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 12085 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3636/3805 places, 504/506 transitions.
Applied a total of 0 rules in 271 ms. Remains 3636 /3636 variables (removed 0) and now considering 504/504 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 13223 ms. Remains : 3636/3805 places, 504/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (LEQ s85 s1888) (LEQ 3 s30)), p0:(OR (GT s220 s30) (GT s180 s64))], 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2461 reset in 380 ms.
Product exploration explored 100000 steps with 2462 reset in 414 ms.
Computed a total of 3636 stabilizing places and 504 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3636 transition count 504
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 (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 371 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 504 rows 3636 cols
[2024-05-27 01:50:53] [INFO ] Computed 3136 invariants in 21 ms
[2024-05-27 01:50:54] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 01:50:55] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 732 ms returned sat
[2024-05-27 01:50:57] [INFO ] After 1751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 01:50:58] [INFO ] After 3014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 561 ms.
[2024-05-27 01:50:59] [INFO ] After 4943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 158 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=31 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 588 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 3636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3636/3636 places, 504/504 transitions.
Applied a total of 0 rules in 232 ms. Remains 3636 /3636 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-05-27 01:51:00] [INFO ] Invariant cache hit.
[2024-05-27 01:51:06] [INFO ] Implicit Places using invariants in 5817 ms returned []
[2024-05-27 01:51:06] [INFO ] Invariant cache hit.
[2024-05-27 01:51:17] [INFO ] Implicit Places using invariants and state equation in 10985 ms returned []
Implicit Place search using SMT with State Equation took 16827 ms to find 0 implicit places.
[2024-05-27 01:51:17] [INFO ] Invariant cache hit.
[2024-05-27 01:51:18] [INFO ] Dead Transitions using invariants and state equation in 1578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18656 ms. Remains : 3636/3636 places, 504/504 transitions.
Computed a total of 3636 stabilizing places and 504 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3636 transition count 504
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 (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 356 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 01:51:20] [INFO ] Invariant cache hit.
[2024-05-27 01:51:20] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 01:51:21] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 730 ms returned sat
[2024-05-27 01:51:23] [INFO ] After 1753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 01:51:25] [INFO ] After 3009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 553 ms.
[2024-05-27 01:51:25] [INFO ] After 4911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 641 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2461 reset in 387 ms.
Product exploration explored 100000 steps with 2464 reset in 399 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 3636 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3636/3636 places, 504/504 transitions.
Applied a total of 0 rules in 261 ms. Remains 3636 /3636 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-05-27 01:51:28] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-27 01:51:28] [INFO ] Invariant cache hit.
[2024-05-27 01:51:29] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1881 ms. Remains : 3636/3636 places, 504/504 transitions.
Built C files in :
/tmp/ltsmin76174523929773989
[2024-05-27 01:51:29] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin76174523929773989
Running compilation step : cd /tmp/ltsmin76174523929773989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2253 ms.
Running link step : cd /tmp/ltsmin76174523929773989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin76174523929773989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11827491585839498241.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 3636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3636/3636 places, 504/504 transitions.
Applied a total of 0 rules in 228 ms. Remains 3636 /3636 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-05-27 01:51:44] [INFO ] Invariant cache hit.
[2024-05-27 01:51:50] [INFO ] Implicit Places using invariants in 5734 ms returned []
[2024-05-27 01:51:50] [INFO ] Invariant cache hit.
[2024-05-27 01:52:01] [INFO ] Implicit Places using invariants and state equation in 10598 ms returned []
Implicit Place search using SMT with State Equation took 16371 ms to find 0 implicit places.
[2024-05-27 01:52:01] [INFO ] Invariant cache hit.
[2024-05-27 01:52:02] [INFO ] Dead Transitions using invariants and state equation in 1406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18015 ms. Remains : 3636/3636 places, 504/504 transitions.
Built C files in :
/tmp/ltsmin17575098949796490458
[2024-05-27 01:52:02] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17575098949796490458
Running compilation step : cd /tmp/ltsmin17575098949796490458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2162 ms.
Running link step : cd /tmp/ltsmin17575098949796490458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17575098949796490458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5277568971810088220.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 01:52:17] [INFO ] Flatten gal took : 79 ms
[2024-05-27 01:52:18] [INFO ] Flatten gal took : 74 ms
[2024-05-27 01:52:18] [INFO ] Time to serialize gal into /tmp/LTL4903841889876063163.gal : 10 ms
[2024-05-27 01:52:18] [INFO ] Time to serialize properties into /tmp/LTL13075536853730638356.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4903841889876063163.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1688287559996298869.hoa' '-atoms' '/tmp/LTL13075536853730638356.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13075536853730638356.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1688287559996298869.hoa
Detected timeout of ITS tools.
[2024-05-27 01:52:33] [INFO ] Flatten gal took : 73 ms
[2024-05-27 01:52:33] [INFO ] Flatten gal took : 74 ms
[2024-05-27 01:52:33] [INFO ] Time to serialize gal into /tmp/LTL17827910916349426120.gal : 9 ms
[2024-05-27 01:52:33] [INFO ] Time to serialize properties into /tmp/LTL3858534418234248678.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17827910916349426120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3858534418234248678.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((AstopAbort>c1_31)||(s2_8>s6_27))"))||(X(G("((s5_23<=n7_18_19)||(c1_31>=3))"))))))
Formula 0 simplified : X(F!"((AstopAbort>c1_31)||(s2_8>s6_27))" & XF!"((s5_23<=n7_18_19)||(c1_31>=3))")
Detected timeout of ITS tools.
[2024-05-27 01:52:48] [INFO ] Flatten gal took : 75 ms
[2024-05-27 01:52:48] [INFO ] Applying decomposition
[2024-05-27 01:52:48] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13439604790092518904.txt' '-o' '/tmp/graph13439604790092518904.bin' '-w' '/tmp/graph13439604790092518904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13439604790092518904.bin' '-l' '-1' '-v' '-w' '/tmp/graph13439604790092518904.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:52:48] [INFO ] Decomposing Gal with order
[2024-05-27 01:52:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:52:48] [INFO ] Removed a total of 395 redundant transitions.
[2024-05-27 01:52:49] [INFO ] Flatten gal took : 180 ms
[2024-05-27 01:52:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 171 ms.
[2024-05-27 01:52:49] [INFO ] Time to serialize gal into /tmp/LTL11138428685934840133.gal : 61 ms
[2024-05-27 01:52:49] [INFO ] Time to serialize properties into /tmp/LTL6904289164714175087.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11138428685934840133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6904289164714175087.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((gu74.AstopAbort>gu74.c1_31)||(gu30.s2_8>gu30.s6_27))"))||(X(G("((gu80.s5_23<=gu80.n7_18_19)||(gu74.c1_31>=3))"))))))
Formula 0 simplified : X(F!"((gu74.AstopAbort>gu74.c1_31)||(gu30.s2_8>gu30.s6_27))" & XF!"((gu80.s5_23<=gu80.n7_18_19)||(gu74.c1_31>=3))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17330721738810799303
[2024-05-27 01:53:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17330721738810799303
Running compilation step : cd /tmp/ltsmin17330721738810799303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2217 ms.
Running link step : cd /tmp/ltsmin17330721738810799303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17330721738810799303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-15 finished in 161763 ms.
[2024-05-27 01:53:20] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13847673785394070250
[2024-05-27 01:53:20] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-27 01:53:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:53:20] [INFO ] Applying decomposition
[2024-05-27 01:53:20] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-27 01:53:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:53:20] [INFO ] Flatten gal took : 72 ms
[2024-05-27 01:53:20] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2024-05-27 01:53:20] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 01:53:20] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13847673785394070250
Running compilation step : cd /tmp/ltsmin13847673785394070250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7178487275954005037.txt' '-o' '/tmp/graph7178487275954005037.bin' '-w' '/tmp/graph7178487275954005037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7178487275954005037.bin' '-l' '-1' '-v' '-w' '/tmp/graph7178487275954005037.weights' '-q' '0' '-e' '0.001'
[2024-05-27 01:53:20] [INFO ] Decomposing Gal with order
[2024-05-27 01:53:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 01:53:20] [INFO ] Removed a total of 293 redundant transitions.
[2024-05-27 01:53:20] [INFO ] Flatten gal took : 158 ms
[2024-05-27 01:53:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 89 ms.
[2024-05-27 01:53:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality17093762526812209687.gal : 27 ms
[2024-05-27 01:53:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality7435889344724275232.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17093762526812209687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7435889344724275232.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((F((G("(((((((gu163.n5_24+gu163.n5_25)+(gu163.n5_26+gu163.n5_27))+((gu163.n5_20+gu163.n5_21)+(gu163.n5_22+gu163.n5_23)))+(((gu163.n5...1564
Formula 0 simplified : G(F!"(((((((gu163.n5_24+gu163.n5_25)+(gu163.n5_26+gu163.n5_27))+((gu163.n5_20+gu163.n5_21)+(gu163.n5_22+gu163.n5_23)))+(((gu163.n5_3...1556
Compilation finished in 3019 ms.
Running link step : cd /tmp/ltsmin13847673785394070250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13847673785394070250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13847673785394070250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13847673785394070250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U ((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true)))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.079: LTL layer: formula: X([]((X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U ((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true)))))))))
pins2lts-mc-linux64( 0/ 8), 0.079: "X([]((X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U ((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.080: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.100: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.113: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.529: DFS-FIFO for weak LTL, using special progress label 516
pins2lts-mc-linux64( 0/ 8), 0.529: There are 517 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.529: State length is 3806, there are 515 groups
pins2lts-mc-linux64( 0/ 8), 0.529: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.529: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.529: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.529: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.906: ~36 levels ~960 states ~15376 transitions
pins2lts-mc-linux64( 2/ 8), 0.985: ~36 levels ~1920 states ~19208 transitions
pins2lts-mc-linux64( 1/ 8), 1.154: ~36 levels ~3840 states ~28376 transitions
pins2lts-mc-linux64( 1/ 8), 1.500: ~36 levels ~7680 states ~47512 transitions
pins2lts-mc-linux64( 1/ 8), 2.164: ~36 levels ~15360 states ~91144 transitions
pins2lts-mc-linux64( 1/ 8), 3.435: ~36 levels ~30720 states ~186352 transitions
pins2lts-mc-linux64( 1/ 8), 5.995: ~36 levels ~61440 states ~392536 transitions
pins2lts-mc-linux64( 1/ 8), 11.124: ~36 levels ~122880 states ~840784 transitions
pins2lts-mc-linux64( 1/ 8), 21.265: ~36 levels ~245760 states ~1795216 transitions
pins2lts-mc-linux64( 1/ 8), 41.455: ~36 levels ~491520 states ~3827680 transitions
pins2lts-mc-linux64( 1/ 8), 81.404: ~36 levels ~983040 states ~8139344 transitions
pins2lts-mc-linux64( 1/ 8), 163.041: ~36 levels ~1966080 states ~17254344 transitions
pins2lts-mc-linux64( 6/ 8), 383.745: ~36 levels ~3932160 states ~36468136 transitions
pins2lts-mc-linux64( 2/ 8), 632.339: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 633.266:
pins2lts-mc-linux64( 0/ 8), 633.267: mean standard work distribution: 1.9% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 633.267:
pins2lts-mc-linux64( 0/ 8), 633.267: Explored 5855931 states 56009487 transitions, fanout: 9.565
pins2lts-mc-linux64( 0/ 8), 633.267: Total exploration time 632.730 sec (631.830 sec minimum, 632.261 sec on average)
pins2lts-mc-linux64( 0/ 8), 633.267: States per second: 9255, Transitions per second: 88520
pins2lts-mc-linux64( 0/ 8), 633.267:
pins2lts-mc-linux64( 0/ 8), 633.267: Progress states detected: 5862495
pins2lts-mc-linux64( 0/ 8), 633.267: Redundant explorations: -50.0521
pins2lts-mc-linux64( 0/ 8), 633.267:
pins2lts-mc-linux64( 0/ 8), 633.267: Queue width: 8B, total height: 5862768, memory: 44.73MB
pins2lts-mc-linux64( 0/ 8), 633.267: Tree memory: 345.4MB, 30.9 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 633.267: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 633.267: Stored 510 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 633.267: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 633.267: Est. total memory use: 390.2MB (~1068.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13847673785394070250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U ((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13847673785394070250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U ((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-27 02:20:21] [INFO ] Flatten gal took : 181 ms
[2024-05-27 02:20:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality12205836591275920469.gal : 16 ms
[2024-05-27 02:20:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality9119625703318147285.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12205836591275920469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9119625703318147285.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((F((G("(((((((n5_24+n5_25)+(n5_26+n5_27))+((n5_20+n5_21)+(n5_22+n5_23)))+(((n5_32+n5_28)+(n5_29+n5_30))+((n5_31+n5_9)+(n5_8+n5_11)))...970
Formula 0 simplified : G(F!"(((((((n5_24+n5_25)+(n5_26+n5_27))+((n5_20+n5_21)+(n5_22+n5_23)))+(((n5_32+n5_28)+(n5_29+n5_30))+((n5_31+n5_9)+(n5_8+n5_11))))+...962
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 185516 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16126864 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-32, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361500067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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