Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254700803.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is QuasiCertifProtocol-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254700803
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 226K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 556K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 219K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 360K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749145042330

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 17:37:23] [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]
[2025-06-05 17:37:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 17:37:23] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-06-05 17:37:23] [INFO ] Transformed 1398 places.
[2025-06-05 17:37:23] [INFO ] Transformed 296 transitions.
[2025-06-05 17:37:23] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 565 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1377 transition count 296
Applied a total of 21 rules in 112 ms. Remains 1377 /1398 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1377 cols
[2025-06-05 17:37:24] [INFO ] Computed 1083 invariants in 54 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:37:25] [INFO ] Implicit Places using invariants in 1715 ms returned []
[2025-06-05 17:37:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:37:28] [INFO ] Implicit Places using invariants and state equation in 3201 ms returned []
Implicit Place search using SMT with State Equation took 4947 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 17:37:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 738/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 21/1376 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1376 variables, 343/1083 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:54] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:54] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:54] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:54] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:54] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:54] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:54] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:55] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:56] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:37:56] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1376/1673 variables, and 1101 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1081/1081 constraints, State Equation: 0/1377 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 738/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 21/1376 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1376 variables, 343/1083 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1376 variables, 18/1101 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1376 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 296/1672 variables, 1376/2477 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1672 variables, 276/2753 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1672/1673 variables, and 2753 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1081/1081 constraints, State Equation: 1376/1377 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Starting structural reductions in LTL mode, iteration 1 : 1377/1398 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65454 ms. Remains : 1377/1398 places, 296/296 transitions.
Support contains 565 out of 1377 places after structural reductions.
[2025-06-05 17:38:29] [INFO ] Flatten gal took : 104 ms
[2025-06-05 17:38:29] [INFO ] Flatten gal took : 63 ms
[2025-06-05 17:38:29] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 40000 steps (1766 resets) in 2560 ms. (15 steps per ms) remains 25/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 52 ms. (75 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (13 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
[2025-06-05 17:38:30] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 360/361 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 57/582 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 765/1347 variables, 706/1068 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1347 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 30/1377 variables, 15/1083 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1377 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 9 (OVERLAPS) 296/1673 variables, 1377/2460 constraints. Problems are: Problem set: 10 solved, 15 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1673/1673 variables, and 2460 constraints, problems are : Problem set: 10 solved, 15 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1081/1081 constraints, State Equation: 1377/1377 constraints, PredecessorRefiner: 25/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 360/361 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 0/361 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 57/579 variables, 1/362 constraints. Problems are: Problem set: 10 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:36] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:36] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:37] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:37] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:37] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:37] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:37] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:37] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:37] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:37] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/382 constraints. Problems are: Problem set: 10 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:39] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:39] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:39] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:39] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:39] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 7/389 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 0/389 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 764/1343 variables, 705/1094 constraints. Problems are: Problem set: 10 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:40] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1343 variables, 1/1095 constraints. Problems are: Problem set: 10 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1343/1673 variables, and 1095 constraints, problems are : Problem set: 10 solved, 15 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1065/1081 constraints, State Equation: 0/1377 constraints, PredecessorRefiner: 2/23 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10053ms problems are : Problem set: 10 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 522 out of 1377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Graph (complete) has 9203 edges and 1377 vertex of which 1016 are kept as prefixes of interest. Removing 361 places using SCC suffix rule.7 ms
Discarding 361 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 1016 transition count 275
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 40 place count 998 transition count 257
Iterating global reduction 1 with 18 rules applied. Total rules applied 58 place count 998 transition count 257
Applied a total of 58 rules in 92 ms. Remains 998 /1377 variables (removed 379) and now considering 257/296 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 998/1377 places, 257/296 transitions.
RANDOM walk for 40000 steps (1767 resets) in 1225 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 446118 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 15
Probabilistic random walk after 446118 steps, saw 66364 distinct states, run finished after 3007 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 257 rows 998 cols
[2025-06-05 17:38:44] [INFO ] Computed 741 invariants in 25 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 360/361 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 57/579 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 385/964 variables, 363/725 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/964 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 32/996 variables, 16/741 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/996 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 257/1253 variables, 996/1737 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1253 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 2/1255 variables, 2/1739 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1255 variables, 0/1739 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/1255 variables, 0/1739 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1255/1255 variables, and 1739 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 739/739 constraints, State Equation: 998/998 constraints, PredecessorRefiner: 15/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 360/361 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 57/579 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 385/964 variables, 363/725 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:52] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:52] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:53] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:53] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:53] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:54] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:54] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:54] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:54] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:55] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:55] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:55] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:55] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:56] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:56] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:56] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:56] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:57] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:57] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:57] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/964 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:57] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:57] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:57] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:57] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:38:57] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/964 variables, 5/750 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/964 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 32/996 variables, 16/766 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/996 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 257/1253 variables, 996/1762 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1253 variables, 11/1773 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/1255 variables, and 1773 constraints, problems are : Problem set: 0 solved, 15 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 739/739 constraints, State Equation: 996/998 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51678ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 522 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 257/257 transitions.
Applied a total of 0 rules in 27 ms. Remains 998 /998 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 998/998 places, 257/257 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 257/257 transitions.
Applied a total of 0 rules in 28 ms. Remains 998 /998 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2025-06-05 17:39:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:39:36] [INFO ] Implicit Places using invariants in 757 ms returned []
[2025-06-05 17:39:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:39:38] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1839 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:39:38] [INFO ] Redundant transitions in 14 ms returned []
Running 237 sub problems to find dead transitions.
[2025-06-05 17:39:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 738/738 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/976 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 21/997 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/997 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:53] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:54] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:54] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:54] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:54] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:54] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:39:56] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/997 variables, 18/759 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 257/1254 variables, 997/1756 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1254/1255 variables, and 1756 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 739/739 constraints, State Equation: 997/998 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 738/738 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/976 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 21/997 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/997 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/997 variables, 18/759 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 257/1254 variables, 997/1756 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1254 variables, 237/1993 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1254/1255 variables, and 1993 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 739/739 constraints, State Equation: 997/998 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62045 ms. Remains : 998/998 places, 257/257 transitions.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1377 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1377 transition count 296
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-18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X(X(p2))))'
Support contains 402 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1357 transition count 296
Applied a total of 20 rules in 35 ms. Remains 1357 /1377 variables (removed 20) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2025-06-05 17:40:38] [INFO ] Computed 1063 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:40:39] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2025-06-05 17:40:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:40:44] [INFO ] Implicit Places using invariants and state equation in 4689 ms returned [814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 927, 928, 929, 930, 931, 932, 933, 934, 935]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 5953 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1377 places, 296/296 transitions.
Applied a total of 0 rules in 64 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6052 ms. Remains : 1338/1377 places, 296/296 transitions.
Stuttering acceptance computed with spot in 659 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 581 ms.
Product exploration explored 100000 steps with 33333 reset in 516 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 28 ms. Reduced automaton from 13 states, 27 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-01 finished in 8225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G(p0)) U p1) U X(X(p0)))))'
Support contains 39 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1357 transition count 296
Applied a total of 20 rules in 55 ms. Remains 1357 /1377 variables (removed 20) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:40:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:40:48] [INFO ] Implicit Places using invariants in 1467 ms returned []
[2025-06-05 17:40:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:40:53] [INFO ] Implicit Places using invariants and state equation in 5064 ms returned [814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 927, 928, 929, 930, 931, 932, 933, 934, 935]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 6534 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1377 places, 296/296 transitions.
Applied a total of 0 rules in 46 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6636 ms. Remains : 1338/1377 places, 296/296 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-02
Product exploration explored 100000 steps with 25021 reset in 433 ms.
Product exploration explored 100000 steps with 25068 reset in 345 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
RANDOM walk for 40000 steps (1768 resets) in 502 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (131 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (127 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (131 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 724732 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 6
Probabilistic random walk after 724732 steps, saw 105625 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
// Phase 1: matrix 296 rows 1338 cols
[2025-06-05 17:40:58] [INFO ] Computed 1044 invariants in 21 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 171/210 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 934/1144 variables, 837/876 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1144 variables, 684/1560 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1144 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 483/1627 variables, 458/2018 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1627 variables, 360/2378 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1627 variables, 0/2378 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/1634 variables, 4/2382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1634 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1634 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1288 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 171/210 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 934/1144 variables, 837/876 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1144 variables, 684/1560 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1144 variables, 2/1562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 483/1627 variables, 458/2020 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1627 variables, 360/2380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1627 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 7/1634 variables, 4/2384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1634/1634 variables, and 2384 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6361ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 1338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8784 edges and 1338 vertex of which 938 are kept as prefixes of interest. Removing 400 places using SCC suffix rule.4 ms
Discarding 400 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 938 transition count 231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 936 transition count 231
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 65 place count 918 transition count 213
Iterating global reduction 2 with 18 rules applied. Total rules applied 83 place count 918 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 917 transition count 212
Applied a total of 84 rules in 109 ms. Remains 917 /1338 variables (removed 421) and now considering 212/296 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 917/1338 places, 212/296 transitions.
RANDOM walk for 40000 steps (1759 resets) in 500 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 111 ms. (357 steps per ms) remains 1/6 properties
BEST_FIRST walk for 5351 steps (0 resets) in 15 ms. (334 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 397 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
Support contains 39 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8784 edges and 1338 vertex of which 957 are kept as prefixes of interest. Removing 381 places using SCC suffix rule.11 ms
Discarding 381 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 920 transition count 221
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 920 transition count 221
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 77 place count 918 transition count 219
Applied a total of 77 rules in 102 ms. Remains 918 /1338 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 918 cols
[2025-06-05 17:41:06] [INFO ] Computed 702 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:41:07] [INFO ] Implicit Places using invariants in 888 ms returned []
[2025-06-05 17:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:41:09] [INFO ] Implicit Places using invariants and state equation in 2743 ms returned [757, 758, 759, 760, 761, 762, 765, 766, 767, 768, 769, 770, 771, 772, 878, 879, 880, 881, 884]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3633 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 899/1338 places, 219/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 899 /899 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3774 ms. Remains : 899/1338 places, 219/296 transitions.
Computed a total of 899 stabilizing places and 219 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 899 transition count 219
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 267 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
RANDOM walk for 40000 steps (1682 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (74 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (52 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 39040 steps (49 resets) in 105 ms. (368 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 15 factoid took 551 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
Product exploration explored 100000 steps with 4214 reset in 463 ms.
Product exploration explored 100000 steps with 4214 reset in 510 ms.
Built C files in :
/tmp/ltsmin8159413495683420682
[2025-06-05 17:41:13] [INFO ] Computing symmetric may disable matrix : 219 transitions.
[2025-06-05 17:41:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:41:13] [INFO ] Computing symmetric may enable matrix : 219 transitions.
[2025-06-05 17:41:13] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:41:13] [INFO ] Computing Do-Not-Accords matrix : 219 transitions.
[2025-06-05 17:41:13] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:41:13] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8159413495683420682
Running compilation step : cd /tmp/ltsmin8159413495683420682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 864 ms.
Running link step : cd /tmp/ltsmin8159413495683420682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin8159413495683420682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13675111413477601545.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 899 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 899/899 places, 219/219 transitions.
Applied a total of 0 rules in 48 ms. Remains 899 /899 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 899 cols
[2025-06-05 17:41:28] [INFO ] Computed 684 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:41:29] [INFO ] Implicit Places using invariants in 859 ms returned []
[2025-06-05 17:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:41:31] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:41:31] [INFO ] Redundant transitions in 22 ms returned []
Running 180 sub problems to find dead transitions.
[2025-06-05 17:41:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/879 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 219/1098 variables, 879/1563 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1098 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 20/1118 variables, 20/1583 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 1583 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 684/684 constraints, State Equation: 899/899 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/879 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 219/1098 variables, 879/1563 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1098 variables, 25/1588 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1098 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 20/1118 variables, 20/1608 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 1763 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 684/684 constraints, State Equation: 899/899 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62982 ms. Remains : 899/899 places, 219/219 transitions.
Built C files in :
/tmp/ltsmin18364430277809907305
[2025-06-05 17:42:31] [INFO ] Computing symmetric may disable matrix : 219 transitions.
[2025-06-05 17:42:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:42:31] [INFO ] Computing symmetric may enable matrix : 219 transitions.
[2025-06-05 17:42:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:42:31] [INFO ] Computing Do-Not-Accords matrix : 219 transitions.
[2025-06-05 17:42:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:42:31] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18364430277809907305
Running compilation step : cd /tmp/ltsmin18364430277809907305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 759 ms.
Running link step : cd /tmp/ltsmin18364430277809907305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18364430277809907305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3002632260365619762.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 17:42:46] [INFO ] Flatten gal took : 31 ms
[2025-06-05 17:42:46] [INFO ] Flatten gal took : 44 ms
[2025-06-05 17:42:46] [INFO ] Time to serialize gal into /tmp/LTL14562944279534026157.gal : 8 ms
[2025-06-05 17:42:46] [INFO ] Time to serialize properties into /tmp/LTL7007609110586461307.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14562944279534026157.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9050530013655986754.hoa' '-atoms' '/tmp/LTL7007609110586461307.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7007609110586461307.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9050530013655986754.hoa
Detected timeout of ITS tools.
[2025-06-05 17:43:01] [INFO ] Flatten gal took : 30 ms
[2025-06-05 17:43:01] [INFO ] Flatten gal took : 27 ms
[2025-06-05 17:43:01] [INFO ] Time to serialize gal into /tmp/LTL6214122570875257032.gal : 5 ms
[2025-06-05 17:43:01] [INFO ] Time to serialize properties into /tmp/LTL1094736545105036431.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6214122570875257032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1094736545105036431.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((F(G("((((((s5_2+s5_3)+(s5_0+s5_1))+((s5_7+s5_6)+(s5_5+s5_4)))+(((s5_11+s5_10)+(s5_9+s5_8))+((s5_15+s5_14)+(s5_13+s5_12))))+((s5...645
Formula 0 simplified : F((GF!"((((((s5_2+s5_3)+(s5_0+s5_1))+((s5_7+s5_6)+(s5_5+s5_4)))+(((s5_11+s5_10)+(s5_9+s5_8))+((s5_15+s5_14)+(s5_13+s5_12))))+((s5_18...635
Detected timeout of ITS tools.
[2025-06-05 17:43:17] [INFO ] Flatten gal took : 25 ms
[2025-06-05 17:43:17] [INFO ] Applying decomposition
[2025-06-05 17:43:17] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4885054134039937087.txt' '-o' '/tmp/graph4885054134039937087.bin' '-w' '/tmp/graph4885054134039937087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4885054134039937087.bin' '-l' '-1' '-v' '-w' '/tmp/graph4885054134039937087.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:43:17] [INFO ] Decomposing Gal with order
[2025-06-05 17:43:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:43:17] [INFO ] Removed a total of 172 redundant transitions.
[2025-06-05 17:43:17] [INFO ] Flatten gal took : 87 ms
[2025-06-05 17:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 12 ms.
[2025-06-05 17:43:17] [INFO ] Time to serialize gal into /tmp/LTL7130195521498059576.gal : 6 ms
[2025-06-05 17:43:17] [INFO ] Time to serialize properties into /tmp/LTL18222638384710417874.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7130195521498059576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18222638384710417874.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((F(G("((((((gu1.s5_2+gu1.s5_3)+(gu1.s5_0+gu1.s5_1))+((gu1.s5_7+gu1.s5_6)+(gu1.s5_5+gu1.s5_4)))+(((gu1.s5_11+gu1.s5_10)+(gu1.s5_9...957
Formula 0 simplified : F((GF!"((((((gu1.s5_2+gu1.s5_3)+(gu1.s5_0+gu1.s5_1))+((gu1.s5_7+gu1.s5_6)+(gu1.s5_5+gu1.s5_4)))+(((gu1.s5_11+gu1.s5_10)+(gu1.s5_9+gu...947
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-02 finished in 165863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((((p0 U X(G(p0))) U p1) U X(X(p2)))))))'
Support contains 77 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1375 transition count 296
Applied a total of 2 rules in 47 ms. Remains 1375 /1377 variables (removed 2) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1375 cols
[2025-06-05 17:43:32] [INFO ] Computed 1081 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:33] [INFO ] Implicit Places using invariants in 1373 ms returned []
[2025-06-05 17:43:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:37] [INFO ] Implicit Places using invariants and state equation in 3999 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 5381 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1356/1377 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5465 ms. Remains : 1356/1377 places, 296/296 transitions.
Stuttering acceptance computed with spot in 845 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 18850 steps with 1352 reset in 68 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-03 finished in 6429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 1377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Graph (complete) has 9203 edges and 1377 vertex of which 968 are kept as prefixes of interest. Removing 409 places using SCC suffix rule.4 ms
Discarding 409 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 968 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 938 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 938 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 937 transition count 220
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 937 transition count 220
Applied a total of 70 rules in 117 ms. Remains 937 /1377 variables (removed 440) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 937 cols
[2025-06-05 17:43:39] [INFO ] Computed 720 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:39] [INFO ] Implicit Places using invariants in 906 ms returned []
[2025-06-05 17:43:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:41] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned [413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 526, 527, 528, 529, 530, 531, 532, 533, 534]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2894 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/1377 places, 220/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3043 ms. Remains : 918/1377 places, 220/296 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04
Product exploration explored 100000 steps with 4318 reset in 240 ms.
Product exploration explored 100000 steps with 4317 reset in 256 ms.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1576 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (70 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1978770 steps, run timeout after 3001 ms. (steps per millisecond=659 ) properties seen :0 out of 1
Probabilistic random walk after 1978770 steps, saw 279229 distinct states, run finished after 3001 ms. (steps per millisecond=659 ) properties seen :0
// Phase 1: matrix 220 rows 918 cols
[2025-06-05 17:43:45] [INFO ] Computed 702 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/218 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 19/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 557/775 variables, 458/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 18/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/775 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/804 variables, 342/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/804 variables, 29/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/804 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 332/1136 variables, 324/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1136 variables, 332/1619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1136 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1138 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1138 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1138 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 1620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/218 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 19/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 557/775 variables, 458/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/775 variables, 18/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/775 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 29/804 variables, 342/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/804 variables, 29/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/804 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 332/1136 variables, 324/1288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1136 variables, 332/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1136 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1138 variables, 1/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1138 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1138 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 1621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 620 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 124 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 20 out of 918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 50 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-06-05 17:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:48] [INFO ] Implicit Places using invariants in 993 ms returned []
[2025-06-05 17:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:50] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2709 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:43:50] [INFO ] Redundant transitions in 20 ms returned [184]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 198 sub problems to find dead transitions.
// Phase 1: matrix 219 rows 918 cols
[2025-06-05 17:43:50] [INFO ] Computed 702 invariants in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/917 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/917 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 219/1136 variables, 917/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1136 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/1137 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1137/1137 variables, and 1620 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/917 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/917 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 219/1136 variables, 917/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1136 variables, 198/1817 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/1137 variables, and 1817 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/918 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 918/918 places, 219/220 transitions.
Graph (complete) has 8496 edges and 918 vertex of which 195 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.2 ms
Discarding 723 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 177 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 177 transition count 163
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 159 transition count 127
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 159 transition count 127
Applied a total of 73 rules in 14 ms. Remains 159 /918 variables (removed 759) and now considering 127/219 (removed 92) transitions.
// Phase 1: matrix 127 rows 159 cols
[2025-06-05 17:44:50] [INFO ] Computed 36 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:44:50] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-05 17:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:44:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/918 places, 127/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63200 ms. Remains : 159/918 places, 127/220 transitions.
Computed a total of 159 stabilizing places and 127 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 127
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40005 steps (1575 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (69 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2342203 steps, run timeout after 3001 ms. (steps per millisecond=780 ) properties seen :0 out of 1
Probabilistic random walk after 2342203 steps, saw 326876 distinct states, run finished after 3001 ms. (steps per millisecond=780 ) properties seen :0
[2025-06-05 17:44:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/145 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/164 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 122/286 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 18/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/286 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/145 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/164 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 122/286 variables, 79/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 18/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/286 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 111 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 p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4316 reset in 224 ms.
Product exploration explored 100000 steps with 4317 reset in 239 ms.
Built C files in :
/tmp/ltsmin17992088931413138003
[2025-06-05 17:44:54] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2025-06-05 17:44:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:44:54] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2025-06-05 17:44:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:44:54] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2025-06-05 17:44:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:44:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17992088931413138003
Running compilation step : cd /tmp/ltsmin17992088931413138003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin17992088931413138003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17992088931413138003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3648544084135275565.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 127/127 transitions.
Applied a total of 0 rules in 12 ms. Remains 159 /159 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2025-06-05 17:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:10] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-05 17:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:10] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:45:10] [INFO ] Redundant transitions in 19 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 105 sub problems to find dead transitions.
// Phase 1: matrix 126 rows 159 cols
[2025-06-05 17:45:10] [INFO ] Computed 36 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 126/284 variables, 158/194 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/285 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 195 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4736 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 126/284 variables, 158/194 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 105/299 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/285 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 300 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15413 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20175ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 20176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/159 places, 126/127 transitions.
Graph (complete) has 650 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 10 ms. Remains 158 /159 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 158 cols
[2025-06-05 17:45:30] [INFO ] Computed 36 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:30] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-05 17:45:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/159 places, 125/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20746 ms. Remains : 158/159 places, 125/127 transitions.
Built C files in :
/tmp/ltsmin1874266454798313972
[2025-06-05 17:45:30] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2025-06-05 17:45:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:45:30] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2025-06-05 17:45:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:45:30] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2025-06-05 17:45:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:45:30] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1874266454798313972
Running compilation step : cd /tmp/ltsmin1874266454798313972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 297 ms.
Running link step : cd /tmp/ltsmin1874266454798313972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1874266454798313972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2401580113527528557.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 17:45:45] [INFO ] Flatten gal took : 7 ms
[2025-06-05 17:45:46] [INFO ] Flatten gal took : 6 ms
[2025-06-05 17:45:46] [INFO ] Time to serialize gal into /tmp/LTL9367018605291965933.gal : 1 ms
[2025-06-05 17:45:46] [INFO ] Time to serialize properties into /tmp/LTL2015522186578395229.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9367018605291965933.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6422361518545967838.hoa' '-atoms' '/tmp/LTL2015522186578395229.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2015522186578395229.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6422361518545967838.hoa
Detected timeout of ITS tools.
[2025-06-05 17:46:01] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:46:01] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:46:01] [INFO ] Time to serialize gal into /tmp/LTL17075897530125679060.gal : 1 ms
[2025-06-05 17:46:01] [INFO ] Time to serialize properties into /tmp/LTL7004403094383153011.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17075897530125679060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7004403094383153011.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((n5_18+n5_16)+(n5_17+n5_14))+((n5_15+n5_12)+(n5_13+n5_10)))+(((n5_11+n5_8)+(n5_9+n5_6))+((n5_7+n5_4)+(n5_5+n5_2))))+((n5_...183
Formula 0 simplified : FG!"((((((n5_18+n5_16)+(n5_17+n5_14))+((n5_15+n5_12)+(n5_13+n5_10)))+(((n5_11+n5_8)+(n5_9+n5_6))+((n5_7+n5_4)+(n5_5+n5_2))))+((n5_3+...177
Detected timeout of ITS tools.
[2025-06-05 17:46:16] [INFO ] Flatten gal took : 8 ms
[2025-06-05 17:46:16] [INFO ] Applying decomposition
[2025-06-05 17:46:16] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3229610479102468682.txt' '-o' '/tmp/graph3229610479102468682.bin' '-w' '/tmp/graph3229610479102468682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3229610479102468682.bin' '-l' '-1' '-v' '-w' '/tmp/graph3229610479102468682.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:46:16] [INFO ] Decomposing Gal with order
[2025-06-05 17:46:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:46:16] [INFO ] Removed a total of 115 redundant transitions.
[2025-06-05 17:46:16] [INFO ] Flatten gal took : 16 ms
[2025-06-05 17:46:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 9 ms.
[2025-06-05 17:46:16] [INFO ] Time to serialize gal into /tmp/LTL12324642436311865253.gal : 1 ms
[2025-06-05 17:46:16] [INFO ] Time to serialize properties into /tmp/LTL16936744009768504330.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12324642436311865253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16936744009768504330.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((gu24.n5_18+gu24.n5_16)+(gu24.n5_17+gu24.n5_14))+((gu24.n5_15+gu24.n5_12)+(gu24.n5_13+gu24.n5_10)))+(((gu24.n5_11+gu24.n5...283
Formula 0 simplified : FG!"((((((gu24.n5_18+gu24.n5_16)+(gu24.n5_17+gu24.n5_14))+((gu24.n5_15+gu24.n5_12)+(gu24.n5_13+gu24.n5_10)))+(((gu24.n5_11+gu24.n5_8...277
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 172390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 362 out of 1377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Graph (complete) has 9203 edges and 1377 vertex of which 968 are kept as prefixes of interest. Removing 409 places using SCC suffix rule.3 ms
Discarding 409 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 968 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 938 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 938 transition count 221
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 1 with 4 rules applied. Total rules applied 71 place count 936 transition count 219
Applied a total of 71 rules in 70 ms. Remains 936 /1377 variables (removed 441) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 936 cols
[2025-06-05 17:46:31] [INFO ] Computed 720 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:46:32] [INFO ] Implicit Places using invariants in 815 ms returned []
[2025-06-05 17:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:46:33] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned [412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 525, 526, 527, 528, 529, 530, 531, 532, 533]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2268 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/1377 places, 219/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 917 /917 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2372 ms. Remains : 917/1377 places, 219/296 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-05
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-05 finished in 2422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((X(X(F(p1)))||G(p0))))))'
Support contains 39 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1356 transition count 296
Applied a total of 21 rules in 72 ms. Remains 1356 /1377 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2025-06-05 17:46:33] [INFO ] Computed 1062 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:46:35] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2025-06-05 17:46:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:46:38] [INFO ] Implicit Places using invariants and state equation in 3260 ms returned []
Implicit Place search using SMT with State Equation took 4605 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 17:46:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/1652 variables, and 2417 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 1356/1377 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64863 ms. Remains : 1356/1377 places, 296/296 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-06
Product exploration explored 100000 steps with 4423 reset in 278 ms.
Product exploration explored 100000 steps with 4425 reset in 350 ms.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1770 resets) in 228 ms. (174 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (125 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2025-06-05 17:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/64 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 696/760 variables, 666/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1426 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 135/1561 variables, 95/2282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1561 variables, 18/2300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1561 variables, 0/2300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 84/1645 variables, 78/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1645 variables, 36/2414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1645 variables, 0/2414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1652 variables, 4/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 701 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/64 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 696/760 variables, 666/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1426/1652 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1313 ms.
Refiners :[Generalized P Invariants (flows): 1008/1062 constraints, State Equation: 1179/1356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2025ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 956 are kept as prefixes of interest. Removing 400 places using SCC suffix rule.3 ms
Discarding 400 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 177 rules applied. Total rules applied 178 place count 918 transition count 136
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 199 place count 897 transition count 136
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 199 place count 897 transition count 98
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 331 place count 803 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 803 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 802 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 333 place count 802 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 800 transition count 96
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 342 places
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 716 place count 439 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 717 place count 438 transition count 76
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 736 place count 419 transition count 76
Applied a total of 736 rules in 97 ms. Remains 419 /1356 variables (removed 937) and now considering 76/296 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 419/1356 places, 76/296 transitions.
RANDOM walk for 80 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 17:47:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:47:44] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 1631 ms returned sat
[2025-06-05 17:47:56] [INFO ] [Real]Absence check using state equation in 11441 ms returned sat
[2025-06-05 17:47:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:47:58] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 1636 ms returned sat
[2025-06-05 17:48:11] [INFO ] [Nat]Absence check using state equation in 12925 ms returned unknown
Could not prove EG (NOT p0)
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 56 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:48:12] [INFO ] Implicit Places using invariants in 1430 ms returned []
[2025-06-05 17:48:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:48:16] [INFO ] Implicit Places using invariants and state equation in 3492 ms returned []
Implicit Place search using SMT with State Equation took 4924 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 17:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/1652 variables, and 2417 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Finished structural reductions in LTL mode , in 1 iterations and 65148 ms. Remains : 1356/1356 places, 296/296 transitions.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1768 resets) in 148 ms. (268 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (135 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2025-06-05 17:49:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/64 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 696/760 variables, 666/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1426 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 135/1561 variables, 95/2282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1561 variables, 18/2300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1561 variables, 0/2300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 84/1645 variables, 78/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1645 variables, 36/2414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1645 variables, 0/2414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1652 variables, 4/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/64 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 696/760 variables, 666/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1426/1652 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1341 ms.
Refiners :[Generalized P Invariants (flows): 1008/1062 constraints, State Equation: 1179/1356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2081ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 956 are kept as prefixes of interest. Removing 400 places using SCC suffix rule.1 ms
Discarding 400 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 177 rules applied. Total rules applied 178 place count 918 transition count 136
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 199 place count 897 transition count 136
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 199 place count 897 transition count 98
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 56 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 331 place count 803 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 803 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 802 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 333 place count 802 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 800 transition count 96
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 342 places
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 716 place count 439 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 717 place count 438 transition count 76
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 736 place count 419 transition count 76
Applied a total of 736 rules in 86 ms. Remains 419 /1356 variables (removed 937) and now considering 76/296 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 419/1356 places, 76/296 transitions.
RANDOM walk for 80 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 17:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:49:22] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 1609 ms returned sat
[2025-06-05 17:49:33] [INFO ] [Real]Absence check using state equation in 11194 ms returned sat
[2025-06-05 17:49:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:49:35] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 1578 ms returned sat
[2025-06-05 17:49:48] [INFO ] [Nat]Absence check using state equation in 12991 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4417 reset in 235 ms.
Product exploration explored 100000 steps with 4422 reset in 259 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.5 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 1336 transition count 296
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 231 ms. Remains 1336 /1356 variables (removed 20) and now considering 296/296 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:49:49] [INFO ] Redundant transitions in 29 ms returned []
Running 276 sub problems to find dead transitions.
// Phase 1: matrix 296 rows 1336 cols
[2025-06-05 17:49:49] [INFO ] Computed 1044 invariants in 18 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1335 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1335 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 2 (OVERLAPS) 296/1631 variables, 1335/2379 constraints. Problems are: Problem set: 4 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1631/1632 variables, and 2379 constraints, problems are : Problem set: 4 solved, 272 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1336 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1333 variables, 1044/1044 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1333 variables, 0/1044 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 294/1627 variables, 1333/2377 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1627 variables, 272/2649 constraints. Problems are: Problem set: 4 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1632 variables, and 2649 constraints, problems are : Problem set: 4 solved, 272 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1333/1336 constraints, PredecessorRefiner: 272/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 4 solved, 272 unsolved
Search for dead transitions found 4 dead transitions in 60172ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1356 places, 292/296 transitions.
Graph (complete) has 9711 edges and 1336 vertex of which 1334 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 59 ms. Remains 1334 /1336 variables (removed 2) and now considering 292/292 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1334/1356 places, 292/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60500 ms. Remains : 1334/1356 places, 292/296 transitions.
Built C files in :
/tmp/ltsmin397660136274458545
[2025-06-05 17:50:49] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin397660136274458545
Running compilation step : cd /tmp/ltsmin397660136274458545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 943 ms.
Running link step : cd /tmp/ltsmin397660136274458545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin397660136274458545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2095325595831420927.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 56 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2025-06-05 17:51:05] [INFO ] Computed 1062 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:51:06] [INFO ] Implicit Places using invariants in 1396 ms returned []
[2025-06-05 17:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:51:09] [INFO ] Implicit Places using invariants and state equation in 3466 ms returned []
Implicit Place search using SMT with State Equation took 4867 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 17:51:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/1652 variables, and 2417 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Finished structural reductions in LTL mode , in 1 iterations and 65106 ms. Remains : 1356/1356 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin16142499606689665653
[2025-06-05 17:52:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16142499606689665653
Running compilation step : cd /tmp/ltsmin16142499606689665653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 898 ms.
Running link step : cd /tmp/ltsmin16142499606689665653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16142499606689665653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5704333653484257716.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 17:52:25] [INFO ] Flatten gal took : 30 ms
[2025-06-05 17:52:25] [INFO ] Flatten gal took : 27 ms
[2025-06-05 17:52:25] [INFO ] Time to serialize gal into /tmp/LTL14541205696546305677.gal : 5 ms
[2025-06-05 17:52:25] [INFO ] Time to serialize properties into /tmp/LTL88496489290578092.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14541205696546305677.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11273343057895966298.hoa' '-atoms' '/tmp/LTL88496489290578092.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL88496489290578092.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11273343057895966298.hoa
Detected timeout of ITS tools.
[2025-06-05 17:52:40] [INFO ] Flatten gal took : 25 ms
[2025-06-05 17:52:40] [INFO ] Flatten gal took : 29 ms
[2025-06-05 17:52:40] [INFO ] Time to serialize gal into /tmp/LTL11744096096840056829.gal : 5 ms
[2025-06-05 17:52:40] [INFO ] Time to serialize properties into /tmp/LTL9213636380552489548.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11744096096840056829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9213636380552489548.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(malicious_reservoir<1)")&&(X((X(X(F("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))+((s...465
Formula 0 simplified : G(!"(malicious_reservoir<1)" | X(XXG!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))+((s6_14+...451
Detected timeout of ITS tools.
[2025-06-05 17:52:55] [INFO ] Flatten gal took : 28 ms
[2025-06-05 17:52:55] [INFO ] Applying decomposition
[2025-06-05 17:52:55] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1732591438488321931.txt' '-o' '/tmp/graph1732591438488321931.bin' '-w' '/tmp/graph1732591438488321931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1732591438488321931.bin' '-l' '-1' '-v' '-w' '/tmp/graph1732591438488321931.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:52:55] [INFO ] Decomposing Gal with order
[2025-06-05 17:52:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:52:55] [INFO ] Removed a total of 179 redundant transitions.
[2025-06-05 17:52:55] [INFO ] Flatten gal took : 63 ms
[2025-06-05 17:52:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 268 labels/synchronizations in 51 ms.
[2025-06-05 17:52:56] [INFO ] Time to serialize gal into /tmp/LTL5545319586170276297.gal : 10 ms
[2025-06-05 17:52:56] [INFO ] Time to serialize properties into /tmp/LTL16590655562130430322.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5545319586170276297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16590655562130430322.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(gu0.malicious_reservoir<1)")&&(X((X(X(F("((((((gu66.s6_1+gu66.s6_0)+(gu66.s6_3+gu66.s6_2))+((gu66.s6_5+gu66.s6_4)+(gu66.s6_7+g...663
Formula 0 simplified : G(!"(gu0.malicious_reservoir<1)" | X(XXG!"((((((gu66.s6_1+gu66.s6_0)+(gu66.s6_3+gu66.s6_2))+((gu66.s6_5+gu66.s6_4)+(gu66.s6_7+gu66.s...649
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-06 finished in 397383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1356 transition count 296
Applied a total of 21 rules in 62 ms. Remains 1356 /1377 variables (removed 21) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:53:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:12] [INFO ] Implicit Places using invariants in 1472 ms returned []
[2025-06-05 17:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:18] [INFO ] Implicit Places using invariants and state equation in 6201 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 7689 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1377 places, 296/296 transitions.
Applied a total of 0 rules in 49 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7801 ms. Remains : 1337/1377 places, 296/296 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-08
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-08 finished in 7903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(p1))))'
Support contains 4 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1357 transition count 296
Applied a total of 20 rules in 62 ms. Remains 1357 /1377 variables (removed 20) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2025-06-05 17:53:19] [INFO ] Computed 1063 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:20] [INFO ] Implicit Places using invariants in 1499 ms returned []
[2025-06-05 17:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:25] [INFO ] Implicit Places using invariants and state equation in 5096 ms returned [814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 927, 928, 929, 930, 931, 932, 933, 934, 935]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 6604 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1377 places, 296/296 transitions.
Applied a total of 0 rules in 44 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6710 ms. Remains : 1338/1377 places, 296/296 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-09
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-09 finished in 6932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1358 transition count 296
Applied a total of 19 rules in 59 ms. Remains 1358 /1377 variables (removed 19) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1358 cols
[2025-06-05 17:53:26] [INFO ] Computed 1064 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:27] [INFO ] Implicit Places using invariants in 1519 ms returned []
[2025-06-05 17:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:33] [INFO ] Implicit Places using invariants and state equation in 5767 ms returned [815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 928, 929, 930, 931, 932, 933, 934, 935, 936]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 7288 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1339/1377 places, 296/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7392 ms. Remains : 1339/1377 places, 296/296 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 7522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1356 transition count 296
Applied a total of 21 rules in 55 ms. Remains 1356 /1377 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2025-06-05 17:53:33] [INFO ] Computed 1062 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:34] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2025-06-05 17:53:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:41] [INFO ] Implicit Places using invariants and state equation in 6257 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 7692 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1377 places, 296/296 transitions.
Applied a total of 0 rules in 45 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7793 ms. Remains : 1337/1377 places, 296/296 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-12 finished in 7903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 1377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Graph (complete) has 9203 edges and 1377 vertex of which 975 are kept as prefixes of interest. Removing 402 places using SCC suffix rule.4 ms
Discarding 402 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 938 transition count 220
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 938 transition count 220
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 77 place count 937 transition count 219
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 937 transition count 219
Applied a total of 78 rules in 124 ms. Remains 937 /1377 variables (removed 440) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 937 cols
[2025-06-05 17:53:41] [INFO ] Computed 720 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:42] [INFO ] Implicit Places using invariants in 923 ms returned []
[2025-06-05 17:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:44] [INFO ] Implicit Places using invariants and state equation in 2423 ms returned [413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 526, 527, 528, 529, 530, 531, 532, 533, 534]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3355 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/1377 places, 219/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 918 /918 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3508 ms. Remains : 918/1377 places, 219/296 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-15
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-15 finished in 3615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G(p0)) U p1) U X(X(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((X(X(F(p1)))||G(p0))))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-06
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 39 out of 1377 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1377/1377 places, 296/296 transitions.
Graph (complete) has 9203 edges and 1377 vertex of which 1336 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.7 ms
Discarding 41 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 1333 transition count 291
Applied a total of 5 rules in 110 ms. Remains 1333 /1377 variables (removed 44) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2025-06-05 17:53:45] [INFO ] Computed 1044 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:47] [INFO ] Implicit Places using invariants in 1460 ms returned []
[2025-06-05 17:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:53:49] [INFO ] Implicit Places using invariants and state equation in 2826 ms returned [1172, 1173, 1174, 1175, 1176, 1177, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1293, 1294, 1295, 1296, 1299]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 4293 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1314/1377 places, 291/296 transitions.
Applied a total of 0 rules in 49 ms. Remains 1314 /1314 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4453 ms. Remains : 1314/1377 places, 291/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-06
Product exploration explored 100000 steps with 4209 reset in 299 ms.
Product exploration explored 100000 steps with 4204 reset in 342 ms.
Computed a total of 1314 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1314 transition count 291
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1681 resets) in 207 ms. (192 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (74 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
// Phase 1: matrix 291 rows 1314 cols
[2025-06-05 17:53:51] [INFO ] Computed 1026 invariants in 12 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/63 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 697/760 variables, 666/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1426 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 115/1541 variables, 76/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1541 variables, 0/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1603 variables, 58/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1603 variables, 18/2339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1603 variables, 0/2339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1605 variables, 1/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1605 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1605 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1605/1605 variables, and 2340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 594 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/63 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 697/760 variables, 666/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1426 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1426 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 115/1541 variables, 76/2264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1541 variables, 0/2264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1603 variables, 58/2322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1603 variables, 18/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1603 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1605 variables, 1/2341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1605 variables, 0/2341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1605 variables, 0/2341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1605/1605 variables, and 2341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4979 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5594ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 100 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 17:53:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:53:59] [INFO ] [Real]Absence check using 0 positive and 1026 generalized place invariants in 1456 ms returned sat
[2025-06-05 17:54:09] [INFO ] [Real]Absence check using state equation in 9562 ms returned sat
[2025-06-05 17:54:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:54:11] [INFO ] [Nat]Absence check using 0 positive and 1026 generalized place invariants in 1533 ms returned sat
[2025-06-05 17:54:24] [INFO ] [Nat]Absence check using state equation in 13029 ms returned unknown
Could not prove EG (NOT p0)
Support contains 39 out of 1314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Applied a total of 0 rules in 46 ms. Remains 1314 /1314 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2025-06-05 17:54:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:54:25] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2025-06-05 17:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:54:27] [INFO ] Implicit Places using invariants and state equation in 2514 ms returned []
Implicit Place search using SMT with State Equation took 3816 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-05 17:54:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1295 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1295 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1586 variables, 1295/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1586 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 30133ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 30135ms
Finished structural reductions in LTL mode , in 1 iterations and 33998 ms. Remains : 1314/1314 places, 291/291 transitions.
Computed a total of 1314 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1314 transition count 291
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1684 resets) in 150 ms. (264 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (74 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2025-06-05 17:54:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/63 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 697/760 variables, 666/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1426 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 115/1541 variables, 76/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1541 variables, 0/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1603 variables, 58/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1603 variables, 18/2339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1603 variables, 0/2339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1605 variables, 1/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1605 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1605 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1605/1605 variables, and 2340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 614 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/63 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 697/760 variables, 666/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1426/1605 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1453 ms.
Refiners :[Generalized P Invariants (flows): 1008/1026 constraints, State Equation: 1179/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2077ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 1314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Graph (complete) has 9653 edges and 1314 vertex of which 934 are kept as prefixes of interest. Removing 380 places using SCC suffix rule.4 ms
Discarding 380 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 175 rules applied. Total rules applied 176 place count 896 transition count 135
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 195 place count 877 transition count 135
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 195 place count 877 transition count 97
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 38 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 309 place count 801 transition count 97
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 310 place count 801 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 800 transition count 96
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 342 places
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 691 place count 439 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 692 place count 438 transition count 76
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 711 place count 419 transition count 76
Applied a total of 711 rules in 69 ms. Remains 419 /1314 variables (removed 895) and now considering 76/291 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 419/1314 places, 76/291 transitions.
RANDOM walk for 80 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 17:55:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:55:03] [INFO ] [Real]Absence check using 0 positive and 1026 generalized place invariants in 1529 ms returned sat
[2025-06-05 17:55:13] [INFO ] [Real]Absence check using state equation in 9486 ms returned sat
[2025-06-05 17:55:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:55:15] [INFO ] [Nat]Absence check using 0 positive and 1026 generalized place invariants in 1545 ms returned sat
[2025-06-05 17:55:28] [INFO ] [Nat]Absence check using state equation in 13053 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4207 reset in 289 ms.
Product exploration explored 100000 steps with 4205 reset in 294 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 39 out of 1314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Applied a total of 0 rules in 60 ms. Remains 1314 /1314 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:55:29] [INFO ] Redundant transitions in 22 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-05 17:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1295 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1295 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1586 variables, 1295/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1586 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 30111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30202 ms. Remains : 1314/1314 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin1069140317230813655
[2025-06-05 17:55:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1069140317230813655
Running compilation step : cd /tmp/ltsmin1069140317230813655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 899 ms.
Running link step : cd /tmp/ltsmin1069140317230813655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1069140317230813655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3328045751228737938.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 1314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Applied a total of 0 rules in 41 ms. Remains 1314 /1314 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2025-06-05 17:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:56:16] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2025-06-05 17:56:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:56:18] [INFO ] Implicit Places using invariants and state equation in 2670 ms returned []
Implicit Place search using SMT with State Equation took 4083 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-05 17:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1295 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1295 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1586 variables, 1295/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1586 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 30124ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Finished structural reductions in LTL mode , in 1 iterations and 34250 ms. Remains : 1314/1314 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin16018629417633911945
[2025-06-05 17:56:48] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16018629417633911945
Running compilation step : cd /tmp/ltsmin16018629417633911945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 960 ms.
Running link step : cd /tmp/ltsmin16018629417633911945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16018629417633911945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12013768016460837718.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 17:57:04] [INFO ] Flatten gal took : 32 ms
[2025-06-05 17:57:04] [INFO ] Flatten gal took : 24 ms
[2025-06-05 17:57:04] [INFO ] Time to serialize gal into /tmp/LTL1232391897235277739.gal : 5 ms
[2025-06-05 17:57:04] [INFO ] Time to serialize properties into /tmp/LTL14913891943465588527.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1232391897235277739.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9272216108336988788.hoa' '-atoms' '/tmp/LTL14913891943465588527.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14913891943465588527.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9272216108336988788.hoa
Detected timeout of ITS tools.
[2025-06-05 17:57:19] [INFO ] Flatten gal took : 24 ms
[2025-06-05 17:57:19] [INFO ] Flatten gal took : 25 ms
[2025-06-05 17:57:19] [INFO ] Time to serialize gal into /tmp/LTL14098912271117614356.gal : 4 ms
[2025-06-05 17:57:19] [INFO ] Time to serialize properties into /tmp/LTL7830199488753382881.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14098912271117614356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7830199488753382881.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(malicious_reservoir<1)")&&(X((X(X(F("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))+((s...465
Formula 0 simplified : G(!"(malicious_reservoir<1)" | X(XXG!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))+((s6_14+...451
Detected timeout of ITS tools.
[2025-06-05 17:57:34] [INFO ] Flatten gal took : 25 ms
[2025-06-05 17:57:34] [INFO ] Applying decomposition
[2025-06-05 17:57:34] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15041918315439314255.txt' '-o' '/tmp/graph15041918315439314255.bin' '-w' '/tmp/graph15041918315439314255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15041918315439314255.bin' '-l' '-1' '-v' '-w' '/tmp/graph15041918315439314255.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:57:34] [INFO ] Decomposing Gal with order
[2025-06-05 17:57:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:57:34] [INFO ] Removed a total of 214 redundant transitions.
[2025-06-05 17:57:34] [INFO ] Flatten gal took : 50 ms
[2025-06-05 17:57:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 49 ms.
[2025-06-05 17:57:34] [INFO ] Time to serialize gal into /tmp/LTL17249858174118829340.gal : 11 ms
[2025-06-05 17:57:34] [INFO ] Time to serialize properties into /tmp/LTL11117069720503442999.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17249858174118829340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11117069720503442999.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(gu0.malicious_reservoir<1)")&&(X((X(X(F("((((((gu45.s6_1+gu45.s6_0)+(gu45.s6_3+gu45.s6_2))+((gu45.s6_5+gu45.s6_4)+(gu45.s6_7+g...663
Formula 0 simplified : G(!"(gu0.malicious_reservoir<1)" | X(XXG!"((((((gu45.s6_1+gu45.s6_0)+(gu45.s6_3+gu45.s6_2))+((gu45.s6_5+gu45.s6_4)+(gu45.s6_7+gu45.s...649
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-06 finished in 244507 ms.
[2025-06-05 17:57:49] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14086001447410886615
[2025-06-05 17:57:49] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2025-06-05 17:57:49] [INFO ] Applying decomposition
[2025-06-05 17:57:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:57:49] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2025-06-05 17:57:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:57:49] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2025-06-05 17:57:49] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:57:49] [INFO ] Flatten gal took : 23 ms
[2025-06-05 17:57:49] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14086001447410886615
Running compilation step : cd /tmp/ltsmin14086001447410886615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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.202505121319/bin/convert-linux64' '-i' '/tmp/graph12930957408935884433.txt' '-o' '/tmp/graph12930957408935884433.bin' '-w' '/tmp/graph12930957408935884433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12930957408935884433.bin' '-l' '-1' '-v' '-w' '/tmp/graph12930957408935884433.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:57:49] [INFO ] Decomposing Gal with order
[2025-06-05 17:57:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:57:49] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-05 17:57:49] [INFO ] Flatten gal took : 46 ms
[2025-06-05 17:57:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 277 labels/synchronizations in 24 ms.
[2025-06-05 17:57:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality6308888103436454945.gal : 6 ms
[2025-06-05 17:57:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality17992622181025006794.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6308888103436454945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17992622181025006794.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((G(((F(G("((((((gu18.s5_2+gu18.s5_3)+(gu18.s5_0+gu18.s5_1))+((gu18.s5_7+gu18.s5_6)+(gu18.s5_5+gu18.s5_4)))+(((gu18.s5_11+gu18.s5_10)...1035
Formula 0 simplified : F((GF!"((((((gu18.s5_2+gu18.s5_3)+(gu18.s5_0+gu18.s5_1))+((gu18.s5_7+gu18.s5_6)+(gu18.s5_5+gu18.s5_4)))+(((gu18.s5_11+gu18.s5_10)+(g...1025
Compilation finished in 1142 ms.
Running link step : cd /tmp/ltsmin14086001447410886615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14086001447410886615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: LTL layer: formula: [](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))
pins2lts-mc-linux64( 1/ 8), 0.022: "[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.022: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.152: There are 302 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.152: State length is 1378, there are 315 groups
pins2lts-mc-linux64( 0/ 8), 0.152: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.152: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.152: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.152: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.213: [Blue] ~9 levels ~960 states ~2800 transitions
pins2lts-mc-linux64( 0/ 8), 0.265: [Blue] ~22 levels ~1920 states ~5056 transitions
pins2lts-mc-linux64( 0/ 8), 0.329: [Blue] ~22 levels ~3840 states ~11408 transitions
pins2lts-mc-linux64( 0/ 8), 0.448: [Blue] ~22 levels ~7680 states ~28976 transitions
pins2lts-mc-linux64( 0/ 8), 0.680: [Blue] ~22 levels ~15360 states ~65840 transitions
pins2lts-mc-linux64( 0/ 8), 1.078: [Blue] ~22 levels ~30720 states ~144072 transitions
pins2lts-mc-linux64( 2/ 8), 1.728: [Blue] ~22 levels ~61440 states ~299584 transitions
pins2lts-mc-linux64( 2/ 8), 3.102: [Blue] ~23 levels ~122880 states ~584504 transitions
pins2lts-mc-linux64( 2/ 8), 5.856: [Blue] ~23 levels ~245760 states ~1273464 transitions
pins2lts-mc-linux64( 2/ 8), 11.072: [Blue] ~23 levels ~491520 states ~2834856 transitions
pins2lts-mc-linux64( 0/ 8), 20.784: [Blue] ~23 levels ~983040 states ~5794120 transitions
pins2lts-mc-linux64( 2/ 8), 39.345: [Blue] ~24 levels ~1966080 states ~11546032 transitions
pins2lts-mc-linux64( 2/ 8), 77.906: [Blue] ~24 levels ~3932160 states ~25300424 transitions
pins2lts-mc-linux64( 2/ 8), 154.300: [Blue] ~24 levels ~7864320 states ~53080104 transitions
pins2lts-mc-linux64( 2/ 8), 316.165: [Blue] ~24 levels ~15728640 states ~109848608 transitions
pins2lts-mc-linux64( 6/ 8), 328.408: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 328.583:
pins2lts-mc-linux64( 0/ 8), 328.583: Explored 15219451 states 106683509 transitions, fanout: 7.010
pins2lts-mc-linux64( 0/ 8), 328.583: Total exploration time 328.420 sec (328.250 sec minimum, 328.333 sec on average)
pins2lts-mc-linux64( 0/ 8), 328.583: States per second: 46341, Transitions per second: 324839
pins2lts-mc-linux64( 0/ 8), 328.583:
pins2lts-mc-linux64( 0/ 8), 328.583: State space has 15219411 states, 5073106 are accepting
pins2lts-mc-linux64( 0/ 8), 328.583: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 328.583: blue states: 15219451 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 328.583: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 328.583: all-red states: 10144409 (66.65%), bogus 1378 (0.01%)
pins2lts-mc-linux64( 0/ 8), 328.583:
pins2lts-mc-linux64( 0/ 8), 328.583: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 328.583:
pins2lts-mc-linux64( 0/ 8), 328.583: Queue width: 8B, total height: 199, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 328.583: Tree memory: 372.1MB, 25.6 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 328.583: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 328.583: Stored 298 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 328.584: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 328.584: Est. total memory use: 372.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14086001447410886615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14086001447410886615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 18:24:40] [INFO ] Flatten gal took : 219 ms
[2025-06-05 18:24:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality8733809018228048905.gal : 61 ms
[2025-06-05 18:24:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality9074932934433787260.ltl : 23 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8733809018228048905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9074932934433787260.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((G(((F(G("((((((s5_2+s5_3)+(s5_0+s5_1))+((s5_7+s5_6)+(s5_5+s5_4)))+(((s5_11+s5_10)+(s5_9+s5_8))+((s5_15+s5_14)+(s5_13+s5_12))))+((s5...645
Formula 0 simplified : F((GF!"((((((s5_2+s5_3)+(s5_0+s5_1))+((s5_7+s5_6)+(s5_5+s5_4)))+(((s5_11+s5_10)+(s5_9+s5_8))+((s5_15+s5_14)+(s5_13+s5_12))))+((s5_18...635

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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-18, 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 r156-tall-174881254700803"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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