Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254700811.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-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254700811
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 26K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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 39K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 950K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 270K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K 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 503K 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-22-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749148652150

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 18:37:33] [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 18:37:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:37:33] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-05 18:37:33] [INFO ] Transformed 1966 places.
[2025-06-05 18:37:33] [INFO ] Transformed 356 transitions.
[2025-06-05 18:37:33] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1328 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 76 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1966 cols
[2025-06-05 18:37:33] [INFO ] Computed 1611 invariants in 95 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:37:37] [INFO ] Implicit Places using invariants in 3602 ms returned []
[2025-06-05 18:37:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:38:05] [INFO ] Implicit Places using invariants and state equation in 28356 ms returned []
Implicit Place search using SMT with State Equation took 31989 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 18:38:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 28/1943 variables, 3/1081 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:35] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:35] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:35] [INFO ] Deduced a trap composed of 8 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 18:38:35] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:35] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:35] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:35] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:35] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:36] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
SMT process timed out in 30395ms, After SMT, problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 30409ms
Finished structural reductions in LTL mode , in 1 iterations and 62499 ms. Remains : 1966/1966 places, 356/356 transitions.
Support contains 1328 out of 1966 places after structural reductions.
[2025-06-05 18:38:36] [INFO ] Flatten gal took : 136 ms
[2025-06-05 18:38:36] [INFO ] Flatten gal took : 85 ms
[2025-06-05 18:38:36] [INFO ] Input system was already deterministic with 356 transitions.
RANDOM walk for 40000 steps (1483 resets) in 2700 ms. (14 steps per ms) remains 29/34 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (11 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (9 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 81 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 71 ms. (55 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (12 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
[2025-06-05 18:38:37] [INFO ] Invariant cache hit.
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/1257 variables, 1035/1035 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1257 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (OVERLAPS) 70/1327 variables, 3/1038 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1327 variables, 0/1038 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 4 (OVERLAPS) 557/1884 variables, 532/1570 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1884 variables, 0/1570 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 82/1966 variables, 41/1611 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1966 variables, 0/1611 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 356/2322 variables, 1966/3577 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2322/2322 variables, and 3577 constraints, problems are : Problem set: 3 solved, 26 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1608/1608 constraints, State Equation: 1966/1966 constraints, PredecessorRefiner: 29/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1257 variables, 1035/1035 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1257 variables, 0/1035 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 70/1327 variables, 3/1038 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:45] [INFO ] Deduced a trap composed of 5 places in 609 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:46] [INFO ] Deduced a trap composed of 5 places in 592 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:46] [INFO ] Deduced a trap composed of 5 places in 573 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:47] [INFO ] Deduced a trap composed of 5 places in 530 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:47] [INFO ] Deduced a trap composed of 5 places in 494 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:48] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 28 ms to minimize.
SMT process timed out in 10278ms, After SMT, problems are : Problem set: 3 solved, 26 unsolved
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1257 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1965 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 1943 transition count 290
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 89 place count 1943 transition count 269
Deduced a syphon composed of 21 places in 2 ms
Ensure Unique test removed 40 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 1 with 82 rules applied. Total rules applied 171 place count 1882 transition count 269
Applied a total of 171 rules in 136 ms. Remains 1882 /1966 variables (removed 84) and now considering 269/356 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 1882/1966 places, 269/356 transitions.
RANDOM walk for 40000 steps (4499 resets) in 1572 ms. (25 steps per ms) remains 11/26 properties
BEST_FIRST walk for 40003 steps (552 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (510 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (689 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (601 resets) in 502 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (620 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (60 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (555 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (608 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (363 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (603 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (589 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
// Phase 1: matrix 269 rows 1882 cols
[2025-06-05 18:38:49] [INFO ] Computed 1613 invariants in 21 ms
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/632 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 16/648 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/648 variables, 270/299 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1770 variables, 1291/1590 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1770 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 44/1814 variables, 23/1613 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1814 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 9 (OVERLAPS) 202/2016 variables, 1814/3427 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2016 variables, 0/3427 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 135/2151 variables, 68/3495 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2151 variables, 0/3495 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/2151 variables, 0/3495 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2151/2151 variables, and 3495 constraints, problems are : Problem set: 3 solved, 8 unsolved in 3226 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1591/1591 constraints, State Equation: 1882/1882 constraints, PredecessorRefiner: 11/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 16/645 variables, 22/29 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/645 variables, 270/299 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1123/1768 variables, 1291/1590 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:53] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:53] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:54] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1768 variables, 3/1593 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1768 variables, 0/1593 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 44/1812 variables, 23/1616 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1812 variables, 0/1616 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 200/2012 variables, 1812/3428 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2012 variables, 5/3433 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2012 variables, 0/3433 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 13 (OVERLAPS) 139/2151 variables, 70/3503 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2151 variables, 1/3504 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2151 variables, 0/3504 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2151/2151 variables, and 3504 constraints, problems are : Problem set: 4 solved, 7 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1591/1591 constraints, State Equation: 1882/1882 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48303ms problems are : Problem set: 4 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 625 out of 1882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1882/1882 places, 269/269 transitions.
Graph (complete) has 15736 edges and 1882 vertex of which 1879 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Discarding 24 places :
Implicit places reduction removed 24 places
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 0 with 122 rules applied. Total rules applied 123 place count 1855 transition count 171
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 1853 transition count 171
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 125 place count 1853 transition count 146
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 27 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 202 place count 1801 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 202 place count 1801 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 207 place count 1798 transition count 144
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 253 place count 1775 transition count 121
Applied a total of 253 rules in 260 ms. Remains 1775 /1882 variables (removed 107) and now considering 121/269 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 1775/1882 places, 121/269 transitions.
RANDOM walk for 6814 steps (117 resets) in 195 ms. (34 steps per ms) remains 0/7 properties
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1966 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1966 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(F(p2)||p1))))'
Support contains 92 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1939 transition count 356
Applied a total of 27 rules in 76 ms. Remains 1939 /1966 variables (removed 27) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1939 cols
[2025-06-05 18:39:38] [INFO ] Computed 1585 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:39:40] [INFO ] Implicit Places using invariants in 2299 ms returned []
[2025-06-05 18:39:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:39:48] [INFO ] Implicit Places using invariants and state equation in 7968 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10271 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Applied a total of 0 rules in 161 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10508 ms. Remains : 1916/1966 places, 356/356 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-00
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-00 finished in 10830 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&&X(X(p1))&&(p1||F(p2)))) U ((p1&&X((p0&&X(X(p1))&&(p1||F(p2)))))||X(G((p0&&X(X(p1))&&(p1||F(p2))))))))'
Support contains 93 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1917 transition count 356
Applied a total of 49 rules in 67 ms. Remains 1917 /1966 variables (removed 49) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2025-06-05 18:39:49] [INFO ] Computed 1563 invariants in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:39:51] [INFO ] Implicit Places using invariants in 2494 ms returned []
[2025-06-05 18:39:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:04] [INFO ] Implicit Places using invariants and state equation in 12806 ms returned [1156, 1157, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1182, 1184, 1185, 1186, 1187]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 15304 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1966 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15435 ms. Remains : 1894/1966 places, 356/356 transitions.
Stuttering acceptance computed with spot in 535 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-01
Stuttering criterion allowed to conclude after 84 steps with 12 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-01 finished in 16006 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)&&F(p1))))'
Support contains 554 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1917 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.16 ms
Discarding 49 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1915 transition count 354
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 4 place count 1915 transition count 354
Applied a total of 4 rules in 381 ms. Remains 1915 /1966 variables (removed 51) and now considering 354/356 (removed 2) transitions.
// Phase 1: matrix 354 rows 1915 cols
[2025-06-05 18:40:05] [INFO ] Computed 1563 invariants in 61 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:07] [INFO ] Implicit Places using invariants in 1820 ms returned []
[2025-06-05 18:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:14] [INFO ] Implicit Places using invariants and state equation in 7054 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186, 1851, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 8878 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1966 places, 354/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1869 /1869 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9319 ms. Remains : 1869/1966 places, 354/356 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-02
Product exploration explored 100000 steps with 3476 reset in 971 ms.
Product exploration explored 100000 steps with 3479 reset in 893 ms.
Computed a total of 1869 stabilizing places and 354 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 354
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 p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1387 resets) in 419 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1445911 steps, run timeout after 3001 ms. (steps per millisecond=481 ) properties seen :0 out of 1
Probabilistic random walk after 1445911 steps, saw 200103 distinct states, run finished after 3005 ms. (steps per millisecond=481 ) properties seen :0
// Phase 1: matrix 354 rows 1869 cols
[2025-06-05 18:40:20] [INFO ] Computed 1518 invariants in 176 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/530 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/562 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 497/1059 variables, 484/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1059 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1151 variables, 1059/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1151 variables, 0/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 300/1451 variables, 93/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1451 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 692/2143 variables, 644/2786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2143 variables, 506/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2143 variables, 0/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/2219 variables, 71/3363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 22/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/2223 variables, 2/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2223 variables, 0/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2223 variables, 0/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2223/2223 variables, and 3387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1100 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1869/1869 constraints, PredecessorRefiner: 1/0 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/530 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/562 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 497/1059 variables, 484/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1059 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1151 variables, 1059/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1151 variables, 0/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 300/1451 variables, 93/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1451 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 692/2143 variables, 644/2786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2143 variables, 506/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2143 variables, 0/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/2219 variables, 71/3363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 22/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/2223 variables, 2/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2223 variables, 0/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2223 variables, 0/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2223/2223 variables, and 3387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1307 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1869/1869 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2602ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 163 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 530 out of 1869 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1869/1869 places, 354/354 transitions.
Applied a total of 0 rules in 58 ms. Remains 1869 /1869 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-05 18:40:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:24] [INFO ] Implicit Places using invariants in 1625 ms returned []
[2025-06-05 18:40:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:30] [INFO ] Implicit Places using invariants and state equation in 5515 ms returned []
Implicit Place search using SMT with State Equation took 7144 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:40:30] [INFO ] Redundant transitions in 50 ms returned []
Running 307 sub problems to find dead transitions.
[2025-06-05 18:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1845 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 354/2199 variables, 1845/3363 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2199/2223 variables, and 3363 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1845/1869 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1845 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 354/2199 variables, 1845/3363 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2199 variables, 146/3509 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2199/2223 variables, and 3509 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1845/1869 constraints, PredecessorRefiner: 146/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67531 ms. Remains : 1869/1869 places, 354/354 transitions.
Computed a total of 1869 stabilizing places and 354 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 354
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 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1386 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 293 ms. (136 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1443174 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 1
Probabilistic random walk after 1443174 steps, saw 199715 distinct states, run finished after 3001 ms. (steps per millisecond=480 ) properties seen :0
[2025-06-05 18:41:34] [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/530 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/562 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 497/1059 variables, 484/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1059 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1151 variables, 1059/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1151 variables, 0/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 300/1451 variables, 93/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1451 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 692/2143 variables, 644/2786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2143 variables, 506/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2143 variables, 0/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/2219 variables, 71/3363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 22/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/2223 variables, 2/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2223 variables, 0/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2223 variables, 0/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2223/2223 variables, and 3387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1108 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1869/1869 constraints, PredecessorRefiner: 1/0 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/530 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/562 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 497/1059 variables, 484/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1059 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1151 variables, 1059/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1151 variables, 0/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 300/1451 variables, 93/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1451 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 692/2143 variables, 644/2786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2143 variables, 506/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2143 variables, 0/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/2219 variables, 71/3363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 22/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/2223 variables, 2/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2223 variables, 0/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2223 variables, 0/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2223/2223 variables, and 3387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1302 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1869/1869 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2420ms 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 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3481 reset in 835 ms.
Product exploration explored 100000 steps with 3474 reset in 847 ms.
Built C files in :
/tmp/ltsmin14969827822030380750
[2025-06-05 18:41:38] [INFO ] Computing symmetric may disable matrix : 354 transitions.
[2025-06-05 18:41:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:38] [INFO ] Computing symmetric may enable matrix : 354 transitions.
[2025-06-05 18:41:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:38] [INFO ] Computing Do-Not-Accords matrix : 354 transitions.
[2025-06-05 18:41:38] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:38] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14969827822030380750
Running compilation step : cd /tmp/ltsmin14969827822030380750;'/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 1707 ms.
Running link step : cd /tmp/ltsmin14969827822030380750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14969827822030380750;'/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/stateBased11385527445911161519.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 530 out of 1869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1869/1869 places, 354/354 transitions.
Graph (complete) has 15207 edges and 1869 vertex of which 1845 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
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 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1844 transition count 351
Applied a total of 3 rules in 75 ms. Remains 1844 /1869 variables (removed 25) and now considering 351/354 (removed 3) transitions.
// Phase 1: matrix 351 rows 1844 cols
[2025-06-05 18:41:54] [INFO ] Computed 1496 invariants in 136 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:41:55] [INFO ] Implicit Places using invariants in 1698 ms returned []
[2025-06-05 18:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:01] [INFO ] Implicit Places using invariants and state equation in 5650 ms returned []
Implicit Place search using SMT with State Equation took 7352 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:42:01] [INFO ] Redundant transitions in 32 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-05 18:42:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/2195 variables, and 3316 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1844 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2171 variables, 143/3459 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/2195 variables, and 3459 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1844 constraints, PredecessorRefiner: 143/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/1869 places, 351/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67699 ms. Remains : 1844/1869 places, 351/354 transitions.
Built C files in :
/tmp/ltsmin2738438847588061742
[2025-06-05 18:43:01] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2025-06-05 18:43:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:43:01] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2025-06-05 18:43:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:43:01] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2025-06-05 18:43:01] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:43:01] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2738438847588061742
Running compilation step : cd /tmp/ltsmin2738438847588061742;'/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 1465 ms.
Running link step : cd /tmp/ltsmin2738438847588061742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2738438847588061742;'/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/stateBased9880339837575836237.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 18:43:16] [INFO ] Flatten gal took : 47 ms
[2025-06-05 18:43:16] [INFO ] Flatten gal took : 45 ms
[2025-06-05 18:43:16] [INFO ] Time to serialize gal into /tmp/LTL16906901832909892467.gal : 12 ms
[2025-06-05 18:43:16] [INFO ] Time to serialize properties into /tmp/LTL6785819843620773609.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16906901832909892467.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11306692052230192019.hoa' '-atoms' '/tmp/LTL6785819843620773609.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...319
Loading property file /tmp/LTL6785819843620773609.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11306692052230192019.hoa
Detected timeout of ITS tools.
[2025-06-05 18:43:32] [INFO ] Flatten gal took : 59 ms
[2025-06-05 18:43:32] [INFO ] Flatten gal took : 46 ms
[2025-06-05 18:43:32] [INFO ] Time to serialize gal into /tmp/LTL9312830511730441914.gal : 14 ms
[2025-06-05 18:43:32] [INFO ] Time to serialize properties into /tmp/LTL13826222723527232905.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9312830511730441914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13826222723527232905.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("(((((((((((n7_22_0+n7_21_0)+(n7_20_0+n7_19_0))+((n7_3_1+n7_2_1)+(n7_1_1+n7_0_1)))+(((n7_14_0+n7_13_0)+(n7_12_0+n7_11_0))+((n7...5592
Formula 0 simplified : F(G!"(((((((((((n7_22_0+n7_21_0)+(n7_20_0+n7_19_0))+((n7_3_1+n7_2_1)+(n7_1_1+n7_0_1)))+(((n7_14_0+n7_13_0)+(n7_12_0+n7_11_0))+((n7_1...5584
Detected timeout of ITS tools.
[2025-06-05 18:43:47] [INFO ] Flatten gal took : 47 ms
[2025-06-05 18:43:47] [INFO ] Applying decomposition
[2025-06-05 18:43:47] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7539661456998472253.txt' '-o' '/tmp/graph7539661456998472253.bin' '-w' '/tmp/graph7539661456998472253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7539661456998472253.bin' '-l' '-1' '-v' '-w' '/tmp/graph7539661456998472253.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:43:47] [INFO ] Decomposing Gal with order
[2025-06-05 18:43:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:43:48] [INFO ] Removed a total of 231 redundant transitions.
[2025-06-05 18:43:48] [INFO ] Flatten gal took : 234 ms
[2025-06-05 18:43:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 430 labels/synchronizations in 122 ms.
[2025-06-05 18:43:48] [INFO ] Time to serialize gal into /tmp/LTL10725264286204414167.gal : 17 ms
[2025-06-05 18:43:48] [INFO ] Time to serialize properties into /tmp/LTL9943564504858834101.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/LTL10725264286204414167.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9943564504858834101.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("(((((((((((gu47.n7_22_0+gu47.n7_21_0)+(gu47.n7_20_0+gu47.n7_19_0))+((gu47.n7_3_1+gu47.n7_2_1)+(gu47.n7_1_1+gu47.n7_0_1)))+(((...8650
Formula 0 simplified : F(G!"(((((((((((gu47.n7_22_0+gu47.n7_21_0)+(gu47.n7_20_0+gu47.n7_19_0))+((gu47.n7_3_1+gu47.n7_2_1)+(gu47.n7_1_1+gu47.n7_0_1)))+(((gu...8642
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-02 finished in 238798 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) U G((F(p2)||p1))) U X(X(p3))))'
Support contains 72 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 75 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 18:44:04] [INFO ] Computed 1562 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:44:06] [INFO ] Implicit Places using invariants in 2651 ms returned []
[2025-06-05 18:44:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:44:14] [INFO ] Implicit Places using invariants and state equation in 7985 ms returned []
Implicit Place search using SMT with State Equation took 10641 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 18:44:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70941 ms. Remains : 1916/1966 places, 356/356 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p3), (AND (NOT p2) (NOT p0) p1 (NOT p3)), (NOT p3), (AND p1 (NOT p2) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 501 ms.
Product exploration explored 100000 steps with 33333 reset in 484 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p2 (NOT p0) p3), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G p2)), (F (G (NOT p0))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 21 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-03 finished in 72592 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((G(p1)||p0))||G(!p1)))'
Support contains 1128 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1915 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.5 ms
Discarding 51 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1913 transition count 352
Applied a total of 3 rules in 51 ms. Remains 1913 /1966 variables (removed 53) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1913 cols
[2025-06-05 18:45:16] [INFO ] Computed 1563 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:19] [INFO ] Implicit Places using invariants in 2474 ms returned []
[2025-06-05 18:45:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:23] [INFO ] Implicit Places using invariants and state equation in 4127 ms returned [1872, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1897]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6604 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1890/1966 places, 352/356 transitions.
Applied a total of 0 rules in 34 ms. Remains 1890 /1890 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6690 ms. Remains : 1890/1966 places, 352/356 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, false, p1, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-04
Product exploration explored 100000 steps with 3479 reset in 4289 ms.
Product exploration explored 100000 steps with 3479 reset in 4307 ms.
Computed a total of 1890 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1890 transition count 352
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 p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 288 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[true, false, p1, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1386 resets) in 2739 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 953 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 901 ms. (44 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 760 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 741 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 444 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 322620 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 6
Probabilistic random walk after 322620 steps, saw 48157 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
// Phase 1: matrix 352 rows 1890 cols
[2025-06-05 18:45:37] [INFO ] Computed 1541 invariants in 8 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/1128 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1128 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 691/1819 variables, 507/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1819 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 348/2167 variables, 1819/3338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 73/2240 variables, 70/3408 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2240 variables, 22/3430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2240 variables, 0/3430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/2242 variables, 1/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2242 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/2242 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2242/2242 variables, and 3431 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5046 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 1890/1890 constraints, PredecessorRefiner: 6/0 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/1128 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1128 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 691/1819 variables, 507/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1819 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 348/2167 variables, 1819/3338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 73/2240 variables, 70/3408 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2240 variables, 22/3430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2240 variables, 0/3430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/2242 variables, 1/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2242 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/2242 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2242/2242 variables, and 3431 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5023 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 1890/1890 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10106ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1128 out of 1890 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1890/1890 places, 352/352 transitions.
Graph (complete) has 16240 edges and 1890 vertex of which 1889 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 1843 transition count 165
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 257 place count 1820 transition count 165
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 257 place count 1820 transition count 119
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 46 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 395 place count 1728 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 395 place count 1728 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 397 place count 1727 transition count 118
Applied a total of 397 rules in 66 ms. Remains 1727 /1890 variables (removed 163) and now considering 118/352 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1727/1890 places, 118/352 transitions.
RANDOM walk for 40000 steps (628 resets) in 1712 ms. (23 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
// Phase 1: matrix 118 rows 1727 cols
[2025-06-05 18:45:48] [INFO ] Computed 1609 invariants in 5 ms
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/1128 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1128 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/1152 variables, 24/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 574/1726 variables, 1057/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1726 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/1844 variables, 1726/3335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 0/3335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1845 variables, 1/3336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1845 variables, 0/3336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1845 variables, 0/3336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1845/1845 variables, and 3336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3649 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 1585/1585 constraints, State Equation: 1727/1727 constraints, PredecessorRefiner: 1/0 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1128 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1128 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/1152 variables, 24/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 574/1726 variables, 1057/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1726 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/1844 variables, 1726/3335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 0/3335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 1845/1845 variables, and 3336 constraints, problems are : Problem set: 1 solved, 0 unsolved in 5647 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 1585/1585 constraints, State Equation: 1727/1727 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9317ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 16 factoid took 474 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Support contains 1128 out of 1890 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1890/1890 places, 352/352 transitions.
Applied a total of 0 rules in 31 ms. Remains 1890 /1890 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2025-06-05 18:45:58] [INFO ] Computed 1541 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:46:01] [INFO ] Implicit Places using invariants in 2435 ms returned []
[2025-06-05 18:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:46:05] [INFO ] Implicit Places using invariants and state equation in 4652 ms returned []
Implicit Place search using SMT with State Equation took 7091 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:46:05] [INFO ] Redundant transitions in 20 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-05 18:46:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1034/1034 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 46/1890 variables, 507/1541 constraints. Problems are: Problem set: 0 solved, 305 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 1890/2242 variables, and 1541 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 0/1890 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1034/1034 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 46/1890 variables, 507/1541 constraints. Problems are: Problem set: 0 solved, 305 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 Int declared 1890/2242 variables, and 1541 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 0/1890 constraints, PredecessorRefiner: 0/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67431 ms. Remains : 1890/1890 places, 352/352 transitions.
Computed a total of 1890 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1890 transition count 352
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) p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 305 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (1388 resets) in 2407 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 655 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 668 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 678 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 729 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 431 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 360 ms. (110 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 324637 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 6
Probabilistic random walk after 324637 steps, saw 48445 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-05 18:47:11] [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/1128 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1128 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 691/1819 variables, 507/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1819 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 348/2167 variables, 1819/3338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 73/2240 variables, 70/3408 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2240 variables, 22/3430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2240 variables, 0/3430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/2242 variables, 1/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2242 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/2242 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2242/2242 variables, and 3431 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 1890/1890 constraints, PredecessorRefiner: 6/0 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/1128 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1128 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 691/1819 variables, 507/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1819 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 348/2167 variables, 1819/3338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 73/2240 variables, 70/3408 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2240 variables, 22/3430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2240 variables, 0/3430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/2242 variables, 1/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2242 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/2242 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2242/2242 variables, and 3431 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 1890/1890 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10063ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1128 out of 1890 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1890/1890 places, 352/352 transitions.
Graph (complete) has 16240 edges and 1890 vertex of which 1889 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 1843 transition count 165
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 257 place count 1820 transition count 165
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 257 place count 1820 transition count 119
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 46 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 395 place count 1728 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 395 place count 1728 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 397 place count 1727 transition count 118
Applied a total of 397 rules in 60 ms. Remains 1727 /1890 variables (removed 163) and now considering 118/352 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1727/1890 places, 118/352 transitions.
RANDOM walk for 40000 steps (632 resets) in 1510 ms. (26 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 407 ms. (98 steps per ms) remains 1/1 properties
// Phase 1: matrix 118 rows 1727 cols
[2025-06-05 18:47:22] [INFO ] Computed 1609 invariants in 5 ms
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/1128 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1128 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/1152 variables, 24/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 574/1726 variables, 1057/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1726 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/1844 variables, 1726/3335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 0/3335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1845 variables, 1/3336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1845 variables, 0/3336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1845 variables, 0/3336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1845/1845 variables, and 3336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3869 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 1585/1585 constraints, State Equation: 1727/1727 constraints, PredecessorRefiner: 1/0 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1128 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1128 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/1152 variables, 24/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 574/1726 variables, 1057/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1726 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/1844 variables, 1726/3335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 0/3335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 1845/1845 variables, and 3336 constraints, problems are : Problem set: 1 solved, 0 unsolved in 6015 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 1585/1585 constraints, State Equation: 1727/1727 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9901ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 16 factoid took 448 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 3478 reset in 5136 ms.
Product exploration explored 100000 steps with 3471 reset in 5132 ms.
Built C files in :
/tmp/ltsmin5346878831473722611
[2025-06-05 18:47:43] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2025-06-05 18:47:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:47:43] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2025-06-05 18:47:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:47:43] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2025-06-05 18:47:43] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:47:43] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5346878831473722611
Running compilation step : cd /tmp/ltsmin5346878831473722611;'/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 1591 ms.
Running link step : cd /tmp/ltsmin5346878831473722611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5346878831473722611;'/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/stateBased12445796578862122370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1128 out of 1890 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1890/1890 places, 352/352 transitions.
Applied a total of 0 rules in 32 ms. Remains 1890 /1890 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2025-06-05 18:47:58] [INFO ] Computed 1541 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:48:00] [INFO ] Implicit Places using invariants in 2590 ms returned []
[2025-06-05 18:48:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:48:05] [INFO ] Implicit Places using invariants and state equation in 4679 ms returned []
Implicit Place search using SMT with State Equation took 7270 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:48:05] [INFO ] Redundant transitions in 20 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-05 18:48:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1034/1034 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 46/1890 variables, 507/1541 constraints. Problems are: Problem set: 0 solved, 305 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 1890/2242 variables, and 1541 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 0/1890 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1034/1034 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 46/1890 variables, 507/1541 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1890/2242 variables, and 1541 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 0/1890 constraints, PredecessorRefiner: 0/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67549 ms. Remains : 1890/1890 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin1059001754940061897
[2025-06-05 18:49:05] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2025-06-05 18:49:05] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:49:05] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2025-06-05 18:49:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:49:05] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2025-06-05 18:49:05] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:49:05] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1059001754940061897
Running compilation step : cd /tmp/ltsmin1059001754940061897;'/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 1623 ms.
Running link step : cd /tmp/ltsmin1059001754940061897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1059001754940061897;'/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/stateBased15337351913683454619.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 18:49:21] [INFO ] Flatten gal took : 67 ms
[2025-06-05 18:49:21] [INFO ] Flatten gal took : 43 ms
[2025-06-05 18:49:21] [INFO ] Time to serialize gal into /tmp/LTL18327788466686399461.gal : 6 ms
[2025-06-05 18:49:21] [INFO ] Time to serialize properties into /tmp/LTL2280466635185585703.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/LTL18327788466686399461.gal' '-t' 'CGAL' '-hoa' '/tmp/aut305435749244873197.hoa' '-atoms' '/tmp/LTL2280466635185585703.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/LTL2280466635185585703.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut305435749244873197.hoa
Detected timeout of ITS tools.
[2025-06-05 18:49:36] [INFO ] Flatten gal took : 44 ms
[2025-06-05 18:49:36] [INFO ] Flatten gal took : 41 ms
[2025-06-05 18:49:36] [INFO ] Time to serialize gal into /tmp/LTL2946910925920935045.gal : 6 ms
[2025-06-05 18:49:36] [INFO ] Time to serialize properties into /tmp/LTL18048862297999777060.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/LTL2946910925920935045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18048862297999777060.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(("((a4>((((((((((n8_1_0+n8_2_0)+(n8_0_0+n8_6_4))+((n8_5_4+n8_4_4)+(n8_3_4+n8_2_4)))+(((n8_1_4+n8_0_4)+(n8_22_3+n8_21_3))+((n8_20...17124
Formula 0 simplified : F(!"((a4>((((((((((n8_1_0+n8_2_0)+(n8_0_0+n8_6_4))+((n8_5_4+n8_4_4)+(n8_3_4+n8_2_4)))+(((n8_1_4+n8_0_4)+(n8_22_3+n8_21_3))+((n8_20_3...17114
Detected timeout of ITS tools.
[2025-06-05 18:49:51] [INFO ] Flatten gal took : 39 ms
[2025-06-05 18:49:51] [INFO ] Applying decomposition
[2025-06-05 18:49:51] [INFO ] Flatten gal took : 37 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/graph2645617922526120599.txt' '-o' '/tmp/graph2645617922526120599.bin' '-w' '/tmp/graph2645617922526120599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2645617922526120599.bin' '-l' '-1' '-v' '-w' '/tmp/graph2645617922526120599.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:49:52] [INFO ] Decomposing Gal with order
[2025-06-05 18:49:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:49:52] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-05 18:49:52] [INFO ] Flatten gal took : 96 ms
[2025-06-05 18:49:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 315 labels/synchronizations in 17 ms.
[2025-06-05 18:49:52] [INFO ] Time to serialize gal into /tmp/LTL13620173119885397082.gal : 8 ms
[2025-06-05 18:49:52] [INFO ] Time to serialize properties into /tmp/LTL16810013551338287372.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/LTL13620173119885397082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16810013551338287372.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(("((gu60.a4>((((((((((gu60.n8_1_0+gu60.n8_2_0)+(gu60.n8_0_0+gu60.n8_6_4))+((gu60.n8_5_4+gu60.n8_4_4)+(gu60.n8_3_4+gu60.n8_2_4)))...25892
Formula 0 simplified : F(!"((gu60.a4>((((((((((gu60.n8_1_0+gu60.n8_2_0)+(gu60.n8_0_0+gu60.n8_6_4))+((gu60.n8_5_4+gu60.n8_4_4)+(gu60.n8_3_4+gu60.n8_2_4)))+(...25882
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-04 finished in 291267 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))&&F(!p0)))'
Support contains 23 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1939 transition count 356
Applied a total of 27 rules in 73 ms. Remains 1939 /1966 variables (removed 27) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1939 cols
[2025-06-05 18:50:07] [INFO ] Computed 1585 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:50:10] [INFO ] Implicit Places using invariants in 2420 ms returned []
[2025-06-05 18:50:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:50:18] [INFO ] Implicit Places using invariants and state equation in 8470 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10896 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Applied a total of 0 rules in 77 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11046 ms. Remains : 1916/1966 places, 356/356 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-05
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-05 finished in 11189 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)&&F(G(p1)))))'
Support contains 70 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1388 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.8 ms
Discarding 578 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1342 transition count 265
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1342 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 1340 transition count 263
Applied a total of 95 rules in 282 ms. Remains 1340 /1966 variables (removed 626) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1340 cols
[2025-06-05 18:50:19] [INFO ] Computed 1078 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:50:20] [INFO ] Implicit Places using invariants in 1524 ms returned []
[2025-06-05 18:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:50:30] [INFO ] Implicit Places using invariants and state equation in 9980 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 11506 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1294/1966 places, 263/356 transitions.
Applied a total of 0 rules in 50 ms. Remains 1294 /1294 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11838 ms. Remains : 1294/1966 places, 263/356 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-07
Product exploration explored 100000 steps with 3474 reset in 412 ms.
Product exploration explored 100000 steps with 3466 reset in 396 ms.
Computed a total of 1294 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1294 transition count 263
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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (1387 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (51 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1363478 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 2
Probabilistic random walk after 1363478 steps, saw 187829 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
// Phase 1: matrix 263 rows 1294 cols
[2025-06-05 18:50:35] [INFO ] Computed 1034 invariants in 13 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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/93 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/233 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1275/1508 variables, 1154/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1508 variables, 1012/2281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1508 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 49/1557 variables, 47/2328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1557 variables, 0/2328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1557 variables, 0/2328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1557/1557 variables, and 2328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 779 ms.
Refiners :[Generalized P Invariants (flows): 1034/1034 constraints, State Equation: 1294/1294 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/93 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/233 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1275/1508 variables, 1154/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1508 variables, 1012/2281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1508 variables, 2/2283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1508 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 49/1557 variables, 47/2330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1557 variables, 0/2330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1557 variables, 0/2330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1557/1557 variables, and 2330 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3267 ms.
Refiners :[Generalized P Invariants (flows): 1034/1034 constraints, State Equation: 1294/1294 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4072ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 69 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 18 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 70 out of 1294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1294/1294 places, 263/263 transitions.
Applied a total of 0 rules in 47 ms. Remains 1294 /1294 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-06-05 18:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:50:41] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2025-06-05 18:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:50:50] [INFO ] Implicit Places using invariants and state equation in 9173 ms returned []
Implicit Place search using SMT with State Equation took 10447 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:50:50] [INFO ] Redundant transitions in 23 ms returned []
Running 216 sub problems to find dead transitions.
[2025-06-05 18:50:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1270 variables, 1034/1034 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1270 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 263/1533 variables, 1270/2304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1533 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 30118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40643 ms. Remains : 1294/1294 places, 263/263 transitions.
Computed a total of 1294 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1294 transition count 263
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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (1388 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (51 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1345248 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 2
Probabilistic random walk after 1345248 steps, saw 184975 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2025-06-05 18:51:24] [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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/93 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/233 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1275/1508 variables, 1154/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1508 variables, 1012/2281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1508 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 49/1557 variables, 47/2328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1557 variables, 0/2328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1557 variables, 0/2328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1557/1557 variables, and 2328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 852 ms.
Refiners :[Generalized P Invariants (flows): 1034/1034 constraints, State Equation: 1294/1294 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/93 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/233 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1275/1508 variables, 1154/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1508 variables, 1012/2281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1508 variables, 2/2283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1508 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 49/1557 variables, 47/2330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1557 variables, 0/2330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1557 variables, 0/2330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1557/1557 variables, and 2330 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2161 ms.
Refiners :[Generalized P Invariants (flows): 1034/1034 constraints, State Equation: 1294/1294 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3023ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Parikh walk visited 2 properties in 16 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3476 reset in 418 ms.
Product exploration explored 100000 steps with 3474 reset in 426 ms.
Built C files in :
/tmp/ltsmin733454127251004318
[2025-06-05 18:51:28] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2025-06-05 18:51:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:51:28] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2025-06-05 18:51:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:51:28] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2025-06-05 18:51:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:51:28] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin733454127251004318
Running compilation step : cd /tmp/ltsmin733454127251004318;'/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 999 ms.
Running link step : cd /tmp/ltsmin733454127251004318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin733454127251004318;'/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/stateBased17224227181442419553.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 70 out of 1294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1294/1294 places, 263/263 transitions.
Applied a total of 0 rules in 52 ms. Remains 1294 /1294 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-06-05 18:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:51:45] [INFO ] Implicit Places using invariants in 1376 ms returned []
[2025-06-05 18:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:51:54] [INFO ] Implicit Places using invariants and state equation in 9231 ms returned []
Implicit Place search using SMT with State Equation took 10608 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:51:54] [INFO ] Redundant transitions in 24 ms returned []
Running 216 sub problems to find dead transitions.
[2025-06-05 18:51:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1270 variables, 1034/1034 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1270 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 263/1533 variables, 1270/2304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1533 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
SMT process timed out in 30133ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 30134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40826 ms. Remains : 1294/1294 places, 263/263 transitions.
Built C files in :
/tmp/ltsmin11170574781375188851
[2025-06-05 18:52:24] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2025-06-05 18:52:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:52:24] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2025-06-05 18:52:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:52:24] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2025-06-05 18:52:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:52:24] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11170574781375188851
Running compilation step : cd /tmp/ltsmin11170574781375188851;'/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 1011 ms.
Running link step : cd /tmp/ltsmin11170574781375188851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11170574781375188851;'/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/stateBased13746808971087113689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 18:52:39] [INFO ] Flatten gal took : 36 ms
[2025-06-05 18:52:39] [INFO ] Flatten gal took : 26 ms
[2025-06-05 18:52:39] [INFO ] Time to serialize gal into /tmp/LTL3401974695304031292.gal : 4 ms
[2025-06-05 18:52:39] [INFO ] Time to serialize properties into /tmp/LTL6451285972602304713.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/LTL3401974695304031292.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1247060910183579238.hoa' '-atoms' '/tmp/LTL6451285972602304713.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/LTL6451285972602304713.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1247060910183579238.hoa
Detected timeout of ITS tools.
[2025-06-05 18:52:55] [INFO ] Flatten gal took : 26 ms
[2025-06-05 18:52:55] [INFO ] Flatten gal took : 25 ms
[2025-06-05 18:52:55] [INFO ] Time to serialize gal into /tmp/LTL17352075819233891910.gal : 4 ms
[2025-06-05 18:52:55] [INFO ] Time to serialize properties into /tmp/LTL2431053023816012110.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/LTL17352075819233891910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2431053023816012110.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("((((((s5_3+s5_2)+(s5_1+s5_0))+((s5_7+s5_6)+(s5_5+s5_4)))+(((s5_11+s5_10)+(s5_9+s5_8))+((s5_16+s5_17)+(s5_18+s5_19))))+(((s5_1...584
Formula 0 simplified : F(G!"((((((s5_3+s5_2)+(s5_1+s5_0))+((s5_7+s5_6)+(s5_5+s5_4)))+(((s5_11+s5_10)+(s5_9+s5_8))+((s5_16+s5_17)+(s5_18+s5_19))))+(((s5_12+...574
Detected timeout of ITS tools.
[2025-06-05 18:53:10] [INFO ] Flatten gal took : 28 ms
[2025-06-05 18:53:10] [INFO ] Applying decomposition
[2025-06-05 18:53:10] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12948456343483311395.txt' '-o' '/tmp/graph12948456343483311395.bin' '-w' '/tmp/graph12948456343483311395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12948456343483311395.bin' '-l' '-1' '-v' '-w' '/tmp/graph12948456343483311395.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:53:10] [INFO ] Decomposing Gal with order
[2025-06-05 18:53:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:53:10] [INFO ] Removed a total of 222 redundant transitions.
[2025-06-05 18:53:10] [INFO ] Flatten gal took : 39 ms
[2025-06-05 18:53:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 6 ms.
[2025-06-05 18:53:10] [INFO ] Time to serialize gal into /tmp/LTL11171548794183443622.gal : 5 ms
[2025-06-05 18:53:10] [INFO ] Time to serialize properties into /tmp/LTL8149582426800825982.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/LTL11171548794183443622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8149582426800825982.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("((((((gu2.s5_3+gu2.s5_2)+(gu2.s5_1+gu2.s5_0))+((gu2.s5_7+gu2.s5_6)+(gu2.s5_5+gu2.s5_4)))+(((gu2.s5_11+gu2.s5_10)+(gu2.s5_9+gu...911
Formula 0 simplified : F(G!"((((((gu2.s5_3+gu2.s5_2)+(gu2.s5_1+gu2.s5_0))+((gu2.s5_7+gu2.s5_6)+(gu2.s5_5+gu2.s5_4)))+(((gu2.s5_11+gu2.s5_10)+(gu2.s5_9+gu2....901
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-07 finished in 186360 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&&G(p1))))'
Support contains 4 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1412 are kept as prefixes of interest. Removing 554 places using SCC suffix rule.13 ms
Discarding 554 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 1390 transition count 313
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 1390 transition count 313
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 45 place count 1390 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 46 place count 1389 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 1389 transition count 312
Applied a total of 47 rules in 239 ms. Remains 1389 /1966 variables (removed 577) and now considering 312/356 (removed 44) transitions.
// Phase 1: matrix 312 rows 1389 cols
[2025-06-05 18:53:25] [INFO ] Computed 1078 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:53:27] [INFO ] Implicit Places using invariants in 1563 ms returned []
[2025-06-05 18:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:53:31] [INFO ] Implicit Places using invariants and state equation in 3758 ms returned [629, 630, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 655, 657, 658, 659, 660, 1325, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 5325 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1966 places, 312/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1343 /1343 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5637 ms. Remains : 1343/1966 places, 312/356 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-08
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-08 finished in 5727 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))'
Support contains 2 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1363 are kept as prefixes of interest. Removing 603 places using SCC suffix rule.3 ms
Discarding 603 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 1316 transition count 262
Applied a total of 95 rules in 195 ms. Remains 1316 /1966 variables (removed 650) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2025-06-05 18:53:31] [INFO ] Computed 1056 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:53:32] [INFO ] Implicit Places using invariants in 1590 ms returned []
[2025-06-05 18:53:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:53:43] [INFO ] Implicit Places using invariants and state equation in 10222 ms returned [578, 579, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 604, 606, 607, 608, 609]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 11813 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1293/1966 places, 262/356 transitions.
Applied a total of 0 rules in 53 ms. Remains 1293 /1293 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12063 ms. Remains : 1293/1966 places, 262/356 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-11
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-11 finished in 12115 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(F((p0||G(F(p0)))))))'
Support contains 1 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 88 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 18:53:43] [INFO ] Computed 1562 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:53:45] [INFO ] Implicit Places using invariants in 2381 ms returned []
[2025-06-05 18:53:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:53:50] [INFO ] Implicit Places using invariants and state equation in 4745 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7131 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1966 places, 356/356 transitions.
Applied a total of 0 rules in 80 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7301 ms. Remains : 1893/1966 places, 356/356 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-12
Product exploration explored 100000 steps with 5672 reset in 298 ms.
Product exploration explored 100000 steps with 5687 reset in 317 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 91 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 356 rows 1893 cols
[2025-06-05 18:53:52] [INFO ] Computed 1540 invariants in 178 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:53:56] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 3474 ms returned sat
[2025-06-05 18:54:07] [INFO ] [Real]Absence check using state equation in 10917 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 98 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 18:54:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:54:09] [INFO ] Implicit Places using invariants in 2396 ms returned []
[2025-06-05 18:54:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:54:14] [INFO ] Implicit Places using invariants and state equation in 5017 ms returned []
Implicit Place search using SMT with State Equation took 7416 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 18:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Finished structural reductions in LTL mode , in 1 iterations and 67773 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 59 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-05 18:55:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:55:19] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 3368 ms returned sat
[2025-06-05 18:55:31] [INFO ] [Real]Absence check using state equation in 11060 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5683 reset in 313 ms.
Product exploration explored 100000 steps with 5666 reset in 331 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1869 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 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 1869 transition count 356
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 512 ms. Remains 1869 /1893 variables (removed 24) and now considering 356/356 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:55:32] [INFO ] Redundant transitions in 25 ms returned []
Running 332 sub problems to find dead transitions.
// Phase 1: matrix 356 rows 1869 cols
[2025-06-05 18:55:32] [INFO ] Computed 1518 invariants in 151 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1868 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1868 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
SMT process timed out in 30364ms, After SMT, problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 30367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1893 places, 356/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30910 ms. Remains : 1869/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin12505990783452225762
[2025-06-05 18:56:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12505990783452225762
Running compilation step : cd /tmp/ltsmin12505990783452225762;'/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 1245 ms.
Running link step : cd /tmp/ltsmin12505990783452225762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12505990783452225762;'/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/stateBased11301381840405686277.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 104 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2025-06-05 18:56:18] [INFO ] Computed 1540 invariants in 177 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:56:20] [INFO ] Implicit Places using invariants in 2560 ms returned []
[2025-06-05 18:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:56:25] [INFO ] Implicit Places using invariants and state equation in 5078 ms returned []
Implicit Place search using SMT with State Equation took 7641 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 18:56:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1892/2249 variables, and 1540 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 0/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in LTL mode , in 1 iterations and 68000 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin7349565245502771519
[2025-06-05 18:57:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7349565245502771519
Running compilation step : cd /tmp/ltsmin7349565245502771519;'/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 1349 ms.
Running link step : cd /tmp/ltsmin7349565245502771519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7349565245502771519;'/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/stateBased9657810629686904132.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 18:57:41] [INFO ] Flatten gal took : 34 ms
[2025-06-05 18:57:41] [INFO ] Flatten gal took : 34 ms
[2025-06-05 18:57:41] [INFO ] Time to serialize gal into /tmp/LTL7781283222138924889.gal : 6 ms
[2025-06-05 18:57:41] [INFO ] Time to serialize properties into /tmp/LTL8485287970118481157.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/LTL7781283222138924889.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10184967184371300357.hoa' '-atoms' '/tmp/LTL8485287970118481157.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/LTL8485287970118481157.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10184967184371300357.hoa
Detected timeout of ITS tools.
[2025-06-05 18:57:56] [INFO ] Flatten gal took : 34 ms
[2025-06-05 18:57:56] [INFO ] Flatten gal took : 33 ms
[2025-06-05 18:57:56] [INFO ] Time to serialize gal into /tmp/LTL2408327139691493850.gal : 4 ms
[2025-06-05 18:57:56] [INFO ] Time to serialize properties into /tmp/LTL12765322100635282024.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/LTL2408327139691493850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12765322100635282024.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 : !((X(X(F(("(malicious_reservoir<1)")||(G(F("(malicious_reservoir<1)"))))))))
Formula 0 simplified : XXG(!"(malicious_reservoir<1)" & FG!"(malicious_reservoir<1)")
Detected timeout of ITS tools.
[2025-06-05 18:58:11] [INFO ] Flatten gal took : 37 ms
[2025-06-05 18:58:11] [INFO ] Applying decomposition
[2025-06-05 18:58:11] [INFO ] Flatten gal took : 34 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/graph13307793201240081371.txt' '-o' '/tmp/graph13307793201240081371.bin' '-w' '/tmp/graph13307793201240081371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13307793201240081371.bin' '-l' '-1' '-v' '-w' '/tmp/graph13307793201240081371.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:58:11] [INFO ] Decomposing Gal with order
[2025-06-05 18:58:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:58:11] [INFO ] Removed a total of 228 redundant transitions.
[2025-06-05 18:58:11] [INFO ] Flatten gal took : 109 ms
[2025-06-05 18:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 27 ms.
[2025-06-05 18:58:11] [INFO ] Time to serialize gal into /tmp/LTL8346991401710915451.gal : 17 ms
[2025-06-05 18:58:11] [INFO ] Time to serialize properties into /tmp/LTL2938270707127072971.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/LTL8346991401710915451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2938270707127072971.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(u0.malicious_reservoir<1)")||(G(F("(u0.malicious_reservoir<1)"))))))))
Formula 0 simplified : XXG(!"(u0.malicious_reservoir<1)" & FG!"(u0.malicious_reservoir<1)")
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-12 finished in 283745 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((G(p0) U X(p1))))'
Support contains 4 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1917 transition count 356
Applied a total of 49 rules in 77 ms. Remains 1917 /1966 variables (removed 49) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2025-06-05 18:58:27] [INFO ] Computed 1563 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:58:29] [INFO ] Implicit Places using invariants in 2447 ms returned []
[2025-06-05 18:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:58:38] [INFO ] Implicit Places using invariants and state equation in 9124 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 11575 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1966 places, 356/356 transitions.
Applied a total of 0 rules in 73 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11726 ms. Remains : 1894/1966 places, 356/356 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 391 ms.
Product exploration explored 100000 steps with 33333 reset in 388 ms.
Computed a total of 1894 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1894 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-14 finished in 13016 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 U p1)||(X(p0) U ((X(p0)&&G(p2))||X(G(p0))))))))'
Support contains 6 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1917 transition count 356
Applied a total of 49 rules in 76 ms. Remains 1917 /1966 variables (removed 49) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2025-06-05 18:58:40] [INFO ] Computed 1562 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:58:42] [INFO ] Implicit Places using invariants in 2386 ms returned []
[2025-06-05 18:58:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:58:50] [INFO ] Implicit Places using invariants and state equation in 8213 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10603 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1966 places, 356/356 transitions.
Applied a total of 0 rules in 89 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10768 ms. Remains : 1894/1966 places, 356/356 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 381 ms.
Product exploration explored 100000 steps with 33333 reset in 386 ms.
Computed a total of 1894 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1894 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 11 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-15 finished in 12225 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)&&F(p1))))'
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((G(p1)||p0))||G(!p1)))'
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)&&F(G(p1)))))'
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(F((p0||G(F(p0)))))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-22-LTLCardinality-12
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1892 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.11 ms
Discarding 74 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 1889 transition count 351
Applied a total of 5 rules in 209 ms. Remains 1889 /1966 variables (removed 77) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2025-06-05 18:58:53] [INFO ] Computed 1540 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:58:55] [INFO ] Implicit Places using invariants in 2256 ms returned []
[2025-06-05 18:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:58:59] [INFO ] Implicit Places using invariants and state equation in 4290 ms returned [1152, 1153, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1178, 1180, 1181, 1182, 1183, 1848, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6548 ms to find 46 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1843/1966 places, 351/356 transitions.
Applied a total of 0 rules in 87 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6846 ms. Remains : 1843/1966 places, 351/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-12
Product exploration explored 100000 steps with 4205 reset in 321 ms.
Product exploration explored 100000 steps with 4212 reset in 333 ms.
Computed a total of 1843 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1843 transition count 351
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 : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 92 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 351 rows 1843 cols
[2025-06-05 18:59:01] [INFO ] Computed 1496 invariants in 266 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:59:04] [INFO ] [Real]Absence check using 0 positive and 1496 generalized place invariants in 2626 ms returned sat
[2025-06-05 18:59:16] [INFO ] [Real]Absence check using state equation in 11811 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1843/1843 places, 351/351 transitions.
Applied a total of 0 rules in 74 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2025-06-05 18:59:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:59:18] [INFO ] Implicit Places using invariants in 2168 ms returned []
[2025-06-05 18:59:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:59:23] [INFO ] Implicit Places using invariants and state equation in 5268 ms returned []
Implicit Place search using SMT with State Equation took 7439 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-05 18:59:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/2194 variables, and 3316 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2171 variables, 304/3620 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/2194 variables, and 3620 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in LTL mode , in 1 iterations and 67784 ms. Remains : 1843/1843 places, 351/351 transitions.
Computed a total of 1843 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1843 transition count 351
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 : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 90 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-05 19:00:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 19:00:28] [INFO ] [Real]Absence check using 0 positive and 1496 generalized place invariants in 3195 ms returned sat
[2025-06-05 19:00:40] [INFO ] [Real]Absence check using state equation in 11275 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4222 reset in 325 ms.
Product exploration explored 100000 steps with 4204 reset in 341 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1843/1843 places, 351/351 transitions.
Applied a total of 0 rules in 89 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:00:41] [INFO ] Redundant transitions in 29 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-05 19:00:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 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 2171/2194 variables, and 3316 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2171 variables, 304/3620 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/2194 variables, and 3620 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60354 ms. Remains : 1843/1843 places, 351/351 transitions.
Built C files in :
/tmp/ltsmin1544507903421423736
[2025-06-05 19:01:41] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1544507903421423736
Running compilation step : cd /tmp/ltsmin1544507903421423736;'/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 1188 ms.
Running link step : cd /tmp/ltsmin1544507903421423736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1544507903421423736;'/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/stateBased856533117816201108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1843/1843 places, 351/351 transitions.
Applied a total of 0 rules in 65 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2025-06-05 19:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:01:58] [INFO ] Implicit Places using invariants in 2198 ms returned []
[2025-06-05 19:01:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:02:03] [INFO ] Implicit Places using invariants and state equation in 4997 ms returned []
Implicit Place search using SMT with State Equation took 7197 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-05 19:02:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/2194 variables, and 3316 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2171 variables, 304/3620 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/2194 variables, and 3620 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in LTL mode , in 1 iterations and 67493 ms. Remains : 1843/1843 places, 351/351 transitions.
Built C files in :
/tmp/ltsmin15729003093219461252
[2025-06-05 19:03:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15729003093219461252
Running compilation step : cd /tmp/ltsmin15729003093219461252;'/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 1230 ms.
Running link step : cd /tmp/ltsmin15729003093219461252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15729003093219461252;'/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/stateBased5142845741249736271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 19:03:19] [INFO ] Flatten gal took : 32 ms
[2025-06-05 19:03:19] [INFO ] Flatten gal took : 32 ms
[2025-06-05 19:03:19] [INFO ] Time to serialize gal into /tmp/LTL1594187185173492933.gal : 5 ms
[2025-06-05 19:03:19] [INFO ] Time to serialize properties into /tmp/LTL18165119439630826749.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/LTL1594187185173492933.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12265846841876159818.hoa' '-atoms' '/tmp/LTL18165119439630826749.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...319
Loading property file /tmp/LTL18165119439630826749.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12265846841876159818.hoa
Detected timeout of ITS tools.
[2025-06-05 19:03:34] [INFO ] Flatten gal took : 34 ms
[2025-06-05 19:03:34] [INFO ] Flatten gal took : 34 ms
[2025-06-05 19:03:34] [INFO ] Time to serialize gal into /tmp/LTL382281391394858979.gal : 4 ms
[2025-06-05 19:03:34] [INFO ] Time to serialize properties into /tmp/LTL14742594494015532990.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/LTL382281391394858979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14742594494015532990.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 : !((X(X(F(("(malicious_reservoir<1)")||(G(F("(malicious_reservoir<1)"))))))))
Formula 0 simplified : XXG(!"(malicious_reservoir<1)" & FG!"(malicious_reservoir<1)")
Detected timeout of ITS tools.
[2025-06-05 19:03:49] [INFO ] Flatten gal took : 35 ms
[2025-06-05 19:03:49] [INFO ] Applying decomposition
[2025-06-05 19:03:49] [INFO ] Flatten gal took : 34 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/graph15413938116147667560.txt' '-o' '/tmp/graph15413938116147667560.bin' '-w' '/tmp/graph15413938116147667560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15413938116147667560.bin' '-l' '-1' '-v' '-w' '/tmp/graph15413938116147667560.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:03:49] [INFO ] Decomposing Gal with order
[2025-06-05 19:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:03:49] [INFO ] Removed a total of 253 redundant transitions.
[2025-06-05 19:03:49] [INFO ] Flatten gal took : 101 ms
[2025-06-05 19:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 26 ms.
[2025-06-05 19:03:49] [INFO ] Time to serialize gal into /tmp/LTL400972175671461266.gal : 11 ms
[2025-06-05 19:03:49] [INFO ] Time to serialize properties into /tmp/LTL4716634887876797602.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/LTL400972175671461266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4716634887876797602.ltl' '-c' '-stutter-deadlock'

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...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(u0.malicious_reservoir<1)")||(G(F("(u0.malicious_reservoir<1)"))))))))
Formula 0 simplified : XXG(!"(u0.malicious_reservoir<1)" & FG!"(u0.malicious_reservoir<1)")
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-12 finished in 312203 ms.
[2025-06-05 19:04:04] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11697392150208901265
[2025-06-05 19:04:04] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2025-06-05 19:04:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:04:04] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2025-06-05 19:04:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:04:04] [INFO ] Applying decomposition
[2025-06-05 19:04:04] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2025-06-05 19:04:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:04:04] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11697392150208901265
Running compilation step : cd /tmp/ltsmin11697392150208901265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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'
[2025-06-05 19:04:04] [INFO ] Flatten gal took : 62 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/graph2505612568596302245.txt' '-o' '/tmp/graph2505612568596302245.bin' '-w' '/tmp/graph2505612568596302245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2505612568596302245.bin' '-l' '-1' '-v' '-w' '/tmp/graph2505612568596302245.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:04:06] [INFO ] Decomposing Gal with order
[2025-06-05 19:04:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:04:06] [INFO ] Removed a total of 114 redundant transitions.
[2025-06-05 19:04:06] [INFO ] Flatten gal took : 74 ms
[2025-06-05 19:04:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 6 ms.
[2025-06-05 19:04:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality15365481159539315488.gal : 8 ms
[2025-06-05 19:04:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality3373570272207163099.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/LTLCardinality15365481159539315488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3373570272207163099.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 4 LTL properties
Checking formula 0 : !((G((F("(((((((((((gu16.n7_22_0+gu16.n7_21_0)+(gu16.n7_20_0+gu16.n7_19_0))+((gu16.n7_3_1+gu16.n7_2_1)+(gu16.n7_1_1+gu16.n7_0_1)))+(((...8458
Formula 0 simplified : F(G!"(((((((((((gu16.n7_22_0+gu16.n7_21_0)+(gu16.n7_20_0+gu16.n7_19_0))+((gu16.n7_3_1+gu16.n7_2_1)+(gu16.n7_1_1+gu16.n7_0_1)))+(((gu...8450
Compilation finished in 1708 ms.
Running link step : cd /tmp/ltsmin11697392150208901265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11697392150208901265;'/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' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11697392150208901265;'/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' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11697392150208901265;'/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' '--ltl' '([](([]((LTLAPp3==true))||(LTLAPp2==true)))||[](!(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11697392150208901265;'/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' '--ltl' '([](([]((LTLAPp3==true))||(LTLAPp2==true)))||[](!(LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11697392150208901265;'/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' '--ltl' '[]((<>((LTLAPp4==true))&&<>([]((LTLAPp5==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11697392150208901265;'/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' '--ltl' '[]((<>((LTLAPp4==true))&&<>([]((LTLAPp5==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11697392150208901265;'/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' 'X(X(<>(((LTLAPp6==true)||[](<>((LTLAPp6==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11697392150208901265;'/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' 'X(X(<>(((LTLAPp6==true)||[](<>((LTLAPp6==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin11697392150208901265;'/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' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-05 19:33:35] [INFO ] Flatten gal took : 11137 ms
[2025-06-05 19:33:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality9784476881097951748.gal : 1155 ms
[2025-06-05 19:33:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality1870408658700387560.ltl : 73 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/LTLCardinality9784476881097951748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1870408658700387560.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 4 LTL properties
Checking formula 0 : !((G((F("(((((((((((n7_22_0+n7_21_0)+(n7_20_0+n7_19_0))+((n7_3_1+n7_2_1)+(n7_1_1+n7_0_1)))+(((n7_14_0+n7_13_0)+(n7_12_0+n7_11_0))+((n7...5592
Formula 0 simplified : F(G!"(((((((((((n7_22_0+n7_21_0)+(n7_20_0+n7_19_0))+((n7_3_1+n7_2_1)+(n7_1_1+n7_0_1)))+(((n7_14_0+n7_13_0)+(n7_12_0+n7_11_0))+((n7_1...5584

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-22"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 ;