Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 104K 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-COL-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749130368341

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-05 13:32:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 13:32:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 13:32:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-05 13:32:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 13:32:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 621 ms
[2025-06-05 13:32:50] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 13:32:50] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 7 ms.
[2025-06-05 13:32:50] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 21 to 18
RANDOM walk for 40053 steps (1271 resets) in 664 ms. (60 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40012 steps (419 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (347 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (232 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (418 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (345 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (427 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (424 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (426 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (346 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (385 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (423 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (418 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 13:32:51] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 11/27 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/32 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3/56 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 2 solved, 10 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/26 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/52 variables, 26/31 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/35 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 6 (OVERLAPS) 4/56 variables, 4/39 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 5/44 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 44 constraints, problems are : Problem set: 3 solved, 9 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1557ms problems are : Problem set: 3 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 226 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 13:32:53] [INFO ] Flatten gal took : 22 ms
[2025-06-05 13:32:53] [INFO ] Flatten gal took : 5 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2025-06-05 13:32:53] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 31 ms.
[2025-06-05 13:32:53] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 1340 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 66 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 13:32:53] [INFO ] Computed 1562 invariants in 141 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:32:55] [INFO ] Implicit Places using invariants in 1781 ms returned []
[2025-06-05 13:32:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:32:57] [INFO ] Implicit Places using invariants and state equation in 2050 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:32:57] [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 30026 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 30025 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 60414ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60422ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64342 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 1340 out of 1916 places after structural reductions.
[2025-06-05 13:33:57] [INFO ] Flatten gal took : 136 ms
[2025-06-05 13:33:58] [INFO ] Flatten gal took : 107 ms
[2025-06-05 13:33:58] [INFO ] Input system was already deterministic with 356 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (1484 resets) in 1410 ms. (28 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 188 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 93 ms. (42 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
[2025-06-05 13:33:59] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1270 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1270 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 575/1845 variables, 550/1562 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1845 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 355/2200 variables, 1845/3407 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2200 variables, 0/3407 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 6 (OVERLAPS) 72/2272 variables, 71/3478 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 15/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1270 variables, 1012/1012 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1270 variables, 0/1012 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 575/1845 variables, 550/1562 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1845 variables, 0/1562 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 355/2200 variables, 1845/3407 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2200 variables, 6/3413 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2200 variables, 0/3413 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 72/2272 variables, 71/3484 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2272 variables, 1/3485 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2272/2272 variables, and 3485 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 14/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10067ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1270 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1916 transition count 355
Applied a total of 1 rules in 61 ms. Remains 1916 /1916 variables (removed 0) and now considering 355/356 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1916/1916 places, 355/356 transitions.
RANDOM walk for 40000 steps (1485 resets) in 806 ms. (49 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (87 resets) in 594 ms. (67 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (87 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (67 resets) in 118 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (32 resets) in 104 ms. (380 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (82 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (68 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (92 resets) in 576 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (87 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (92 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (70 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (83 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (68 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (83 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (90 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
Finished probabilistic random walk after 6845 steps, run visited all 13 properties in 187 ms. (steps per millisecond=36 )
Probabilistic random walk after 6845 steps, saw 6681 distinct states, run finished after 191 ms. (steps per millisecond=35 ) properties seen :13
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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).
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)||X(X((G(p1)||G(p2)))))))'
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 139 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 13:34:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:34:12] [INFO ] Implicit Places using invariants in 1828 ms returned []
[2025-06-05 13:34:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:34:16] [INFO ] Implicit Places using invariants and state equation in 3624 ms returned []
Implicit Place search using SMT with State Equation took 5454 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 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]
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 30030 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 60266ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Finished structural reductions in LTL mode , in 1 iterations and 65868 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 580 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-00
Product exploration explored 100000 steps with 3718 reset in 1394 ms.
Product exploration explored 100000 steps with 3713 reset in 1279 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 p2 p1 p0), (X p0), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 134 ms. Reduced automaton from 12 states, 33 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1488 resets) in 1372 ms. (29 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 416 ms. (9 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 84 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 81 ms. (48 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (11 resets) in 88 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 75 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 79 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 490440 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :18 out of 23
Probabilistic random walk after 490440 steps, saw 75705 distinct states, run finished after 3010 ms. (steps per millisecond=162 ) properties seen :18
[2025-06-05 13:35:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 742/2173 variables, 669/2855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2173 variables, 484/3339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2173 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf10 is UNSAT
Problem apf22 is UNSAT
Solver is answering 'unknown', stopping.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 2271/2272 variables, and 3433 constraints, problems are : Problem set: 4 solved, 1 unsolved in 3389 ms.
Refiners :[Generalized P Invariants (flows): 1518/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
After SMT solving in domain Int declared 600/2272 variables, and 0 constraints, problems are : Problem set: 5 solved, 0 unsolved in 90 ms.
Refiners :[Generalized P Invariants (flows): 0/1562 constraints, State Equation: 0/1916 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3508ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0)), (G (OR p2 p0 p1)), (G (OR p0 p1)), (G (OR p2 (NOT p0) p1)), (G (OR p2 p1)), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 1939 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 441 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 40 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 13:35:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:35:33] [INFO ] Implicit Places using invariants in 1756 ms returned []
[2025-06-05 13:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:35:36] [INFO ] Implicit Places using invariants and state equation in 3725 ms returned []
Implicit Place search using SMT with State Equation took 5488 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:35:36] [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 30022 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 30024 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 60288ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in LTL mode , in 1 iterations and 65821 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 p1 p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 458 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1486 resets) in 831 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (67 resets) in 757 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (68 resets) in 825 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (87 resets) in 796 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (90 resets) in 745 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (70 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (85 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (71 resets) in 809 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (70 resets) in 798 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (68 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (94 resets) in 735 ms. (54 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 4638 steps, run visited all 10 properties in 125 ms. (steps per millisecond=37 )
Probabilistic random walk after 4638 steps, saw 4520 distinct states, run finished after 126 ms. (steps per millisecond=36 ) properties seen :10
Knowledge obtained : [(AND p2 p1 p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p1 p0))), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND p2 p1 p0))), (F (NOT (AND p2 p1))), (F (NOT (AND p2 p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 479 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 477 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 440 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3713 reset in 940 ms.
Product exploration explored 100000 steps with 3711 reset in 962 ms.
Applying partial POR strategy [true, true, true, false, false, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 439 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.24 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1892 transition count 355
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 406 ms. Remains 1892 /1916 variables (removed 24) and now considering 355/356 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:36:44] [INFO ] Redundant transitions in 38 ms returned []
Running 331 sub problems to find dead transitions.
// Phase 1: matrix 355 rows 1892 cols
[2025-06-05 13:36:44] [INFO ] Computed 1540 invariants in 49 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1891 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1891 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Problem TDEAD162 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 2 (OVERLAPS) 355/2246 variables, 1891/3431 constraints. Problems are: Problem set: 2 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2246/2247 variables, and 3431 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1892 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 329 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 354/2244 variables, 1890/3430 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2244 variables, 329/3759 constraints. Problems are: Problem set: 2 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2244/2247 variables, and 3759 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1892 constraints, PredecessorRefiner: 329/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 2 solved, 329 unsolved
Search for dead transitions found 2 dead transitions in 60357ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1916 places, 353/356 transitions.
Graph (complete) has 15735 edges and 1892 vertex of which 1891 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 133 ms. Remains 1891 /1892 variables (removed 1) and now considering 353/353 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1891/1916 places, 353/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60943 ms. Remains : 1891/1916 places, 353/356 transitions.
Built C files in :
/tmp/ltsmin14065758889915293597
[2025-06-05 13:37:45] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14065758889915293597
Running compilation step : cd /tmp/ltsmin14065758889915293597;'/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 1471 ms.
Running link step : cd /tmp/ltsmin14065758889915293597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14065758889915293597;'/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/stateBased379321723496583084.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 39 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 13:38:00] [INFO ] Computed 1562 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:38:02] [INFO ] Implicit Places using invariants in 1706 ms returned []
[2025-06-05 13:38:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:38:05] [INFO ] Implicit Places using invariants and state equation in 3559 ms returned []
Implicit Place search using SMT with State Equation took 5274 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13: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, 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 30022 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 30041 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 60259ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Finished structural reductions in LTL mode , in 1 iterations and 65579 ms. Remains : 1916/1916 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin7345190491962589634
[2025-06-05 13:39:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7345190491962589634
Running compilation step : cd /tmp/ltsmin7345190491962589634;'/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 1395 ms.
Running link step : cd /tmp/ltsmin7345190491962589634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7345190491962589634;'/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/stateBased5625520003075328066.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 13:39:21] [INFO ] Flatten gal took : 54 ms
[2025-06-05 13:39:21] [INFO ] Flatten gal took : 50 ms
[2025-06-05 13:39:21] [INFO ] Time to serialize gal into /tmp/LTL4891616107526781813.gal : 13 ms
[2025-06-05 13:39:21] [INFO ] Time to serialize properties into /tmp/LTL5567017162710583426.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/LTL4891616107526781813.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10843717035267006855.hoa' '-atoms' '/tmp/LTL5567017162710583426.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/LTL5567017162710583426.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10843717035267006855.hoa
Detected timeout of ITS tools.
[2025-06-05 13:39:36] [INFO ] Flatten gal took : 49 ms
[2025-06-05 13:39:36] [INFO ] Flatten gal took : 48 ms
[2025-06-05 13:39:36] [INFO ] Time to serialize gal into /tmp/LTL5956131358000724118.gal : 7 ms
[2025-06-05 13:39:36] [INFO ] Time to serialize properties into /tmp/LTL10663292964789980695.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5956131358000724118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10663292964789980695.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((G("(((((((((((n7_5<1)||(n7_28<1))||((n7_51<1)||(n7_74<1)))||(((n7_97<1)||(n7_120<1))||((n7_143<1)||(n7_166<1))))||((((n7_189<1)|...8936
Formula 0 simplified : X(F!"(((((((((((n7_5<1)||(n7_28<1))||((n7_51<1)||(n7_74<1)))||(((n7_97<1)||(n7_120<1))||((n7_143<1)||(n7_166<1))))||((((n7_189<1)||(...8922
Detected timeout of ITS tools.
[2025-06-05 13:39:51] [INFO ] Flatten gal took : 46 ms
[2025-06-05 13:39:51] [INFO ] Applying decomposition
[2025-06-05 13:39:51] [INFO ] Flatten gal took : 55 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/graph4790301687996499993.txt' '-o' '/tmp/graph4790301687996499993.bin' '-w' '/tmp/graph4790301687996499993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4790301687996499993.bin' '-l' '-1' '-v' '-w' '/tmp/graph4790301687996499993.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:39:52] [INFO ] Decomposing Gal with order
[2025-06-05 13:39:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:39:52] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-05 13:39:52] [INFO ] Flatten gal took : 238 ms
[2025-06-05 13:39:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 112 ms.
[2025-06-05 13:39:52] [INFO ] Time to serialize gal into /tmp/LTL1739423693377386693.gal : 20 ms
[2025-06-05 13:39:52] [INFO ] Time to serialize properties into /tmp/LTL9887372460408290461.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1739423693377386693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9887372460408290461.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((G("(((((((((((i30.i0.u121.n7_5<1)||(i27.i1.u13.n7_28<1))||((i16.i0.u122.n7_51<1)||(i1.i0.u123.n7_74<1)))||(((i31.u124.n7_97<1)||...15474
Formula 0 simplified : X(F!"(((((((((((i30.i0.u121.n7_5<1)||(i27.i1.u13.n7_28<1))||((i16.i0.u122.n7_51<1)||(i1.i0.u123.n7_74<1)))||(((i31.u124.n7_97<1)||(i...15460
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-00 finished in 356909 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 G((!p1||G(!p2)))))'
Support contains 94 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 57 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 13:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:40:09] [INFO ] Implicit Places using invariants in 2049 ms returned []
[2025-06-05 13:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:40:14] [INFO ] Implicit Places using invariants and state equation in 4227 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6285 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 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 6403 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 441 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p2 p0), (AND p2 p0), p2, (AND p2 p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-01
Product exploration explored 100000 steps with 14049 reset in 757 ms.
Product exploration explored 100000 steps with 14093 reset in 786 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 : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 757 ms. Reduced automaton from 11 states, 31 edges and 3 AP (stutter sensitive) to 11 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 481 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p2 p0), (AND p2 p0), p2, (AND p2 p1)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (1481 resets) in 619 ms. (64 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 139 ms. (285 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (32 resets) in 465 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
// Phase 1: matrix 356 rows 1893 cols
[2025-06-05 13:40:18] [INFO ] Computed 1540 invariants in 127 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 304/2249 variables, and 116 constraints, problems are : Problem set: 2 solved, 0 unsolved in 99 ms.
Refiners :[Generalized P Invariants (flows): 22/1540 constraints, State Equation: 94/1893 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p0)]
Knowledge based reduction with 19 factoid took 1203 ms. Reduced automaton from 11 states, 31 edges and 3 AP (stutter sensitive) to 11 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 447 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 450 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Support contains 94 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 67 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 13:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:40:22] [INFO ] Implicit Places using invariants in 2112 ms returned []
[2025-06-05 13:40:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:40:27] [INFO ] Implicit Places using invariants and state equation in 5221 ms returned []
Implicit Place search using SMT with State Equation took 7336 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:40:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 30016 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 30030 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 60256ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Finished structural reductions in LTL mode , in 1 iterations and 67663 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 : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 1384 ms. Reduced automaton from 11 states, 29 edges and 3 AP (stutter sensitive) to 11 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1480 resets) in 216 ms. (184 steps per ms) remains 3/9 properties
BEST_FIRST walk for 4544 steps (0 resets) in 15 ms. (284 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 15 factoid took 2479 ms. Reduced automaton from 11 states, 29 edges and 3 AP (stutter sensitive) to 11 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 460 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 467 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 446 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Product exploration explored 100000 steps with 14169 reset in 719 ms.
Product exploration explored 100000 steps with 14046 reset in 728 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 473 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Support contains 94 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.9 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 0 ms
Applied a total of 3 rules in 159 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 13:41:36] [INFO ] Redundant transitions in 27 ms returned []
Running 332 sub problems to find dead transitions.
// Phase 1: matrix 356 rows 1869 cols
[2025-06-05 13:41:36] [INFO ] Computed 1518 invariants in 203 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
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 2 (OVERLAPS) 356/2224 variables, 1868/3386 constraints. Problems are: Problem set: 4 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2224/2225 variables, and 3386 constraints, problems are : Problem set: 4 solved, 328 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1868/1869 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 354/2220 variables, 1866/3384 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2220 variables, 328/3712 constraints. Problems are: Problem set: 4 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2220/2225 variables, and 3712 constraints, problems are : Problem set: 4 solved, 328 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1869 constraints, PredecessorRefiner: 328/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 4 solved, 328 unsolved
Search for dead transitions found 4 dead transitions in 60457ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1893 places, 352/356 transitions.
Graph (complete) has 15711 edges and 1869 vertex of which 1867 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 75 ms. Remains 1867 /1869 variables (removed 2) and now considering 352/352 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1867/1893 places, 352/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60726 ms. Remains : 1867/1893 places, 352/356 transitions.
Built C files in :
/tmp/ltsmin1365718422061900878
[2025-06-05 13:42:37] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1365718422061900878
Running compilation step : cd /tmp/ltsmin1365718422061900878;'/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 1321 ms.
Running link step : cd /tmp/ltsmin1365718422061900878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1365718422061900878;'/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/stateBased17140789219695836121.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 94 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 55 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 13:42:52] [INFO ] Computed 1540 invariants in 117 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:42:54] [INFO ] Implicit Places using invariants in 2259 ms returned []
[2025-06-05 13:42:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:43:00] [INFO ] Implicit Places using invariants and state equation in 5527 ms returned []
Implicit Place search using SMT with State Equation took 7792 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:43:00] [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 30017 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 30024 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 60240ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Finished structural reductions in LTL mode , in 1 iterations and 68096 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin14390789896223934365
[2025-06-05 13:44:00] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14390789896223934365
Running compilation step : cd /tmp/ltsmin14390789896223934365;'/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 1328 ms.
Running link step : cd /tmp/ltsmin14390789896223934365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14390789896223934365;'/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/stateBased4235208756816037642.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 13:44:15] [INFO ] Flatten gal took : 46 ms
[2025-06-05 13:44:15] [INFO ] Flatten gal took : 43 ms
[2025-06-05 13:44:15] [INFO ] Time to serialize gal into /tmp/LTL13930785704326534014.gal : 5 ms
[2025-06-05 13:44:15] [INFO ] Time to serialize properties into /tmp/LTL3004446318149827030.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/LTL13930785704326534014.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4091077392182450286.hoa' '-atoms' '/tmp/LTL3004446318149827030.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/LTL3004446318149827030.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4091077392182450286.hoa
Detected timeout of ITS tools.
[2025-06-05 13:44:30] [INFO ] Flatten gal took : 39 ms
[2025-06-05 13:44:30] [INFO ] Flatten gal took : 38 ms
[2025-06-05 13:44:30] [INFO ] Time to serialize gal into /tmp/LTL9991631642747442477.gal : 6 ms
[2025-06-05 13:44:30] [INFO ] Time to serialize properties into /tmp/LTL3171318781549744538.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/LTL9991631642747442477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3171318781549744538.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(!("(((((((n1_16>=1)&&(Sstart_16>=1))||((n1_8>=1)&&(Sstart_8>=1)))||(((n1_21>=1)&&(Sstart_21>=1))||((n1_10>=1)&&(Sstart_10>=1))...2047
Formula 0 simplified : XX"(((((((n1_16>=1)&&(Sstart_16>=1))||((n1_8>=1)&&(Sstart_8>=1)))||(((n1_21>=1)&&(Sstart_21>=1))||((n1_10>=1)&&(Sstart_10>=1))))||((...2024
Detected timeout of ITS tools.
[2025-06-05 13:44:45] [INFO ] Flatten gal took : 38 ms
[2025-06-05 13:44:45] [INFO ] Applying decomposition
[2025-06-05 13:44:45] [INFO ] Flatten gal took : 44 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/graph13525531073954190278.txt' '-o' '/tmp/graph13525531073954190278.bin' '-w' '/tmp/graph13525531073954190278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13525531073954190278.bin' '-l' '-1' '-v' '-w' '/tmp/graph13525531073954190278.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:44:46] [INFO ] Decomposing Gal with order
[2025-06-05 13:44:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:44:46] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-05 13:44:46] [INFO ] Flatten gal took : 98 ms
[2025-06-05 13:44:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 28 ms.
[2025-06-05 13:44:46] [INFO ] Time to serialize gal into /tmp/LTL2049965613668922013.gal : 14 ms
[2025-06-05 13:44:46] [INFO ] Time to serialize properties into /tmp/LTL5600059823237151732.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/LTL2049965613668922013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5600059823237151732.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(!("(((((((i12.u60.n1_16>=1)&&(i12.u81.Sstart_16>=1))||((i2.i1.u53.n1_8>=1)&&(i2.i1.u76.Sstart_8>=1)))||(((i13.i1.u64.n1_21>=1)...2999
Formula 0 simplified : XX"(((((((i12.u60.n1_16>=1)&&(i12.u81.Sstart_16>=1))||((i2.i1.u53.n1_8>=1)&&(i2.i1.u76.Sstart_8>=1)))||(((i13.i1.u64.n1_21>=1)&&(i13...2976
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-01 finished in 293714 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' '!((!p0 U (G(!p0)||(!p0&&G(p1)))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.11 ms
Discarding 24 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 164 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2025-06-05 13:45:01] [INFO ] Computed 1540 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:45:03] [INFO ] Implicit Places using invariants in 2311 ms returned []
[2025-06-05 13:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:45:08] [INFO ] Implicit Places using invariants and state equation in 4246 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6562 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/1916 places, 351/356 transitions.
Applied a total of 0 rules in 81 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6809 ms. Remains : 1843/1916 places, 351/356 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-02
Product exploration explored 100000 steps with 3473 reset in 641 ms.
Product exploration explored 100000 steps with 3469 reset in 608 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 660 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (1389 resets) in 352 ms. (113 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
// Phase 1: matrix 351 rows 1843 cols
[2025-06-05 13:45:11] [INFO ] Computed 1496 invariants in 247 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 253/300 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2167 variables, 1771/1818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2167 variables, 1496/3314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 6 (OVERLAPS) 27/2194 variables, 25/3339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2194/2194 variables, and 3339 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2797 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 253/300 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2167 variables, 1771/1818 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2167 variables, 1496/3314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 27/2194 variables, 25/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2194/2194 variables, and 3339 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1169 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4236ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 95 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G (NOT p0))), (F (G p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 972 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Support contains 47 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 74 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2025-06-05 13:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:45:18] [INFO ] Implicit Places using invariants in 2051 ms returned []
[2025-06-05 13:45:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:45:24] [INFO ] Implicit Places using invariants and state equation in 5606 ms returned []
Implicit Place search using SMT with State Equation took 7661 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:45:24] [INFO ] Redundant transitions in 29 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-05 13:45:24] [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 30024 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 30021 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 60210ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67989 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 576 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (1387 resets) in 388 ms. (102 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (47 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
[2025-06-05 13:46:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 253/300 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2167 variables, 1771/1818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2167 variables, 1496/3314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 6 (OVERLAPS) 27/2194 variables, 25/3339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2194/2194 variables, and 3339 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2420 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 253/300 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2167 variables, 1771/1818 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2167 variables, 1496/3314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 27/2194 variables, 25/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2194/2194 variables, and 3339 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1204 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3642ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 95 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 986 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3464 reset in 598 ms.
Product exploration explored 100000 steps with 3473 reset in 609 ms.
Built C files in :
/tmp/ltsmin14731415559884900066
[2025-06-05 13:46:32] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2025-06-05 13:46:32] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 13:46:32] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2025-06-05 13:46:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 13:46:32] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2025-06-05 13:46:32] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 13:46:32] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14731415559884900066
Running compilation step : cd /tmp/ltsmin14731415559884900066;'/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 1529 ms.
Running link step : cd /tmp/ltsmin14731415559884900066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14731415559884900066;'/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/stateBased18348123478745859037.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 47 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 76 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2025-06-05 13:46:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:46:49] [INFO ] Implicit Places using invariants in 2054 ms returned []
[2025-06-05 13:46:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:46:54] [INFO ] Implicit Places using invariants and state equation in 5349 ms returned []
Implicit Place search using SMT with State Equation took 7405 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:46:54] [INFO ] Redundant transitions in 28 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-05 13:46: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/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 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 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]
After SMT, in 60209ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67736 ms. Remains : 1843/1843 places, 351/351 transitions.
Built C files in :
/tmp/ltsmin2202097182366712428
[2025-06-05 13:47:55] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2025-06-05 13:47:55] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 13:47:55] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2025-06-05 13:47:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 13:47:55] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2025-06-05 13:47:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 13:47:55] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2202097182366712428
Running compilation step : cd /tmp/ltsmin2202097182366712428;'/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 1541 ms.
Running link step : cd /tmp/ltsmin2202097182366712428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2202097182366712428;'/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/stateBased6241803023698811268.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 13:48:10] [INFO ] Flatten gal took : 39 ms
[2025-06-05 13:48:10] [INFO ] Flatten gal took : 32 ms
[2025-06-05 13:48:10] [INFO ] Time to serialize gal into /tmp/LTL512045637202233067.gal : 6 ms
[2025-06-05 13:48:10] [INFO ] Time to serialize properties into /tmp/LTL11849211784732352879.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/LTL512045637202233067.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10577505852603442111.hoa' '-atoms' '/tmp/LTL11849211784732352879.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/LTL11849211784732352879.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10577505852603442111.hoa
Detected timeout of ITS tools.
[2025-06-05 13:48:25] [INFO ] Flatten gal took : 32 ms
[2025-06-05 13:48:25] [INFO ] Flatten gal took : 32 ms
[2025-06-05 13:48:25] [INFO ] Time to serialize gal into /tmp/LTL7216315298301394875.gal : 5 ms
[2025-06-05 13:48:25] [INFO ] Time to serialize properties into /tmp/LTL8519316663413347810.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/LTL7216315298301394875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8519316663413347810.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 : !(((!("(((((((malicious_reservoir>=1)&&(s2_9>=1))||((malicious_reservoir>=1)&&(s2_8>=1)))||(((malicious_reservoir>=1)&&(s2_7>=1))||((m...3828
Formula 0 simplified : F!"(((((((malicious_reservoir<1)||(c1_13<1))&&((malicious_reservoir<1)||(c1_14<1)))&&(((malicious_reservoir<1)||(c1_11<1))&&((malici...1890
Detected timeout of ITS tools.
[2025-06-05 13:48:40] [INFO ] Flatten gal took : 33 ms
[2025-06-05 13:48:40] [INFO ] Applying decomposition
[2025-06-05 13:48:40] [INFO ] Flatten gal took : 33 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/graph14585812994296925365.txt' '-o' '/tmp/graph14585812994296925365.bin' '-w' '/tmp/graph14585812994296925365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14585812994296925365.bin' '-l' '-1' '-v' '-w' '/tmp/graph14585812994296925365.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:48:40] [INFO ] Decomposing Gal with order
[2025-06-05 13:48:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:48:40] [INFO ] Removed a total of 253 redundant transitions.
[2025-06-05 13:48:40] [INFO ] Flatten gal took : 100 ms
[2025-06-05 13:48:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 28 ms.
[2025-06-05 13:48:40] [INFO ] Time to serialize gal into /tmp/LTL11482705893391370231.gal : 12 ms
[2025-06-05 13:48:40] [INFO ] Time to serialize properties into /tmp/LTL12019247218495207230.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/LTL11482705893391370231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12019247218495207230.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...256
Read 1 LTL properties
Checking formula 0 : !(((!("(((((((u0.malicious_reservoir>=1)&&(i4.u40.s2_9>=1))||((u0.malicious_reservoir>=1)&&(i11.u39.s2_8>=1)))||(((u0.malicious_reserv...4800
Formula 0 simplified : F!"(((((((u0.malicious_reservoir<1)||(i22.u9.c1_13<1))&&((u0.malicious_reservoir<1)||(i15.u6.c1_14<1)))&&(((u0.malicious_reservoir<1...2372
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-02 finished in 234436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 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
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1890 transition count 352
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 1890 transition count 352
Applied a total of 4 rules in 210 ms. Remains 1890 /1916 variables (removed 26) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2025-06-05 13:48:56] [INFO ] Computed 1540 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:48:58] [INFO ] Implicit Places using invariants in 2398 ms returned []
[2025-06-05 13:48:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:49:07] [INFO ] Implicit Places using invariants and state equation in 9406 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 11809 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/1916 places, 352/356 transitions.
Applied a total of 0 rules in 93 ms. Remains 1844 /1844 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12114 ms. Remains : 1844/1916 places, 352/356 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-03
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-03 finished in 12186 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((X(p0)||(X(X(X(F(!p2))))&&p1)))))'
Support contains 72 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 57 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 13:49:08] [INFO ] Computed 1562 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:49:10] [INFO ] Implicit Places using invariants in 2177 ms returned []
[2025-06-05 13:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:49:14] [INFO ] Implicit Places using invariants and state equation in 4253 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6433 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 53 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 6545 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2), true, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-05
Product exploration explored 100000 steps with 25036 reset in 388 ms.
Product exploration explored 100000 steps with 24943 reset in 400 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 : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1484 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (85 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (68 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (94 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 4686 steps, run visited all 4 properties in 68 ms. (steps per millisecond=68 )
Probabilistic random walk after 4686 steps, saw 4567 distinct states, run finished after 68 ms. (steps per millisecond=68 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 48 out of 1893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 56 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 13:49:17] [INFO ] Computed 1540 invariants in 127 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:49:19] [INFO ] Implicit Places using invariants in 2276 ms returned []
[2025-06-05 13:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:49:25] [INFO ] Implicit Places using invariants and state equation in 5543 ms returned []
Implicit Place search using SMT with State Equation took 7824 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:49: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
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 30020 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 30026 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 60209ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Finished structural reductions in LTL mode , in 1 iterations and 68094 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 : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1485 resets) in 455 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (68 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (70 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (96 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 4686 steps, run visited all 4 properties in 87 ms. (steps per millisecond=53 )
Probabilistic random walk after 4686 steps, saw 4567 distinct states, run finished after 88 ms. (steps per millisecond=53 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 310 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3719 reset in 617 ms.
Product exploration explored 100000 steps with 3707 reset in 649 ms.
Built C files in :
/tmp/ltsmin11656016731787455473
[2025-06-05 13:50:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11656016731787455473
Running compilation step : cd /tmp/ltsmin11656016731787455473;'/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 1307 ms.
Running link step : cd /tmp/ltsmin11656016731787455473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11656016731787455473;'/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/stateBased16816823641196485770.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 48 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 62 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 13:50:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:50:45] [INFO ] Implicit Places using invariants in 2248 ms returned []
[2025-06-05 13:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:50:51] [INFO ] Implicit Places using invariants and state equation in 5469 ms returned []
Implicit Place search using SMT with State Equation took 7732 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:50:51] [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 30026 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 60239ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Finished structural reductions in LTL mode , in 1 iterations and 68038 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin1204891969378945668
[2025-06-05 13:51:51] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1204891969378945668
Running compilation step : cd /tmp/ltsmin1204891969378945668;'/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 1320 ms.
Running link step : cd /tmp/ltsmin1204891969378945668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1204891969378945668;'/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/stateBased9182147710174485503.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 13:52:06] [INFO ] Flatten gal took : 36 ms
[2025-06-05 13:52:06] [INFO ] Flatten gal took : 36 ms
[2025-06-05 13:52:06] [INFO ] Time to serialize gal into /tmp/LTL9185456932214746717.gal : 5 ms
[2025-06-05 13:52:06] [INFO ] Time to serialize properties into /tmp/LTL11669876447496378598.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/LTL9185456932214746717.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6158710721810631627.hoa' '-atoms' '/tmp/LTL11669876447496378598.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/LTL11669876447496378598.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6158710721810631627.hoa
Detected timeout of ITS tools.
[2025-06-05 13:52:22] [INFO ] Flatten gal took : 37 ms
[2025-06-05 13:52:22] [INFO ] Flatten gal took : 35 ms
[2025-06-05 13:52:22] [INFO ] Time to serialize gal into /tmp/LTL16927892483606668378.gal : 5 ms
[2025-06-05 13:52:22] [INFO ] Time to serialize properties into /tmp/LTL5801923718308753614.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/LTL16927892483606668378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5801923718308753614.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(G((X("(((((((malicious_reservoir<1)||(s6_15<1))&&((malicious_reservoir<1)||(s6_14<1)))&&(((malicious_reservoir<1)||(s6_17<1))&&((...1589
Formula 0 simplified : XF(X!"(((((((malicious_reservoir<1)||(s6_15<1))&&((malicious_reservoir<1)||(s6_14<1)))&&(((malicious_reservoir<1)||(s6_17<1))&&((mal...1571
Detected timeout of ITS tools.
[2025-06-05 13:52:37] [INFO ] Flatten gal took : 36 ms
[2025-06-05 13:52:37] [INFO ] Applying decomposition
[2025-06-05 13:52:37] [INFO ] Flatten gal took : 61 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/graph17130402286499787688.txt' '-o' '/tmp/graph17130402286499787688.bin' '-w' '/tmp/graph17130402286499787688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17130402286499787688.bin' '-l' '-1' '-v' '-w' '/tmp/graph17130402286499787688.weights' '-q' '0' '-e' '0.001'
[2025-06-05 13:52:37] [INFO ] Decomposing Gal with order
[2025-06-05 13:52:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:52:37] [INFO ] Removed a total of 228 redundant transitions.
[2025-06-05 13:52:37] [INFO ] Flatten gal took : 95 ms
[2025-06-05 13:52:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 29 ms.
[2025-06-05 13:52:37] [INFO ] Time to serialize gal into /tmp/LTL706153048987562950.gal : 15 ms
[2025-06-05 13:52:37] [INFO ] Time to serialize properties into /tmp/LTL8570815286901704204.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/LTL706153048987562950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8570815286901704204.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(G((X("(((((((u0.malicious_reservoir<1)||(u127.s6_15<1))&&((u0.malicious_reservoir<1)||(u126.s6_14<1)))&&(((u0.malicious_reservoir...2247
Formula 0 simplified : XF(X!"(((((((u0.malicious_reservoir<1)||(u127.s6_15<1))&&((u0.malicious_reservoir<1)||(u126.s6_14<1)))&&(((u0.malicious_reservoir<1)...2229
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-05 finished in 224594 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 X(p1)) U !p2))'
Support contains 1128 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 16 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 13:52:52] [INFO ] Computed 1562 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:52:54] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2025-06-05 13:52:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:52:59] [INFO ] Implicit Places using invariants and state equation in 4983 ms returned []
Implicit Place search using SMT with State Equation took 6486 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:52:59] [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 30022 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 30030 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 60220ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Finished structural reductions in LTL mode , in 1 iterations and 66731 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 184 ms :[p2, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-06
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-06 finished in 66949 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' '!(((p0 U p1)&&X(F(p2))))'
Support contains 26 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 13:53:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:01] [INFO ] Implicit Places using invariants in 2280 ms returned []
[2025-06-05 13:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:06] [INFO ] Implicit Places using invariants and state equation in 4179 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6463 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 59 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 6584 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-07
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-07 finished in 6740 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||G(!p1)))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 135 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2025-06-05 13:54:06] [INFO ] Computed 1540 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:08] [INFO ] Implicit Places using invariants in 2235 ms returned []
[2025-06-05 13:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:15] [INFO ] Implicit Places using invariants and state equation in 6493 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 8734 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 88 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8959 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-08
Product exploration explored 100000 steps with 3717 reset in 298 ms.
Product exploration explored 100000 steps with 3719 reset in 318 ms.
Computed a total of 1868 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1868 transition count 353
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-08 finished in 10103 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&&G(F((G(p1)||(X(X(p1))&&F(!p2))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 13:54:16] [INFO ] Computed 1562 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:18] [INFO ] Implicit Places using invariants in 2287 ms returned []
[2025-06-05 13:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:23] [INFO ] Implicit Places using invariants and state equation in 4550 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6849 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 55 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 6965 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 7236 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) U (G(!p1) U p2)) U X(X(!p0))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 37 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 13:54:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:25] [INFO ] Implicit Places using invariants in 1854 ms returned []
[2025-06-05 13:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:54:32] [INFO ] Implicit Places using invariants and state equation in 6512 ms returned []
Implicit Place search using SMT with State Equation took 8370 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 13:54:32] [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 30015 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 30032 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 60211ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in LTL mode , in 1 iterations and 68622 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 657 ms :[p0, false, (AND p0 (NOT p2)), p0, false, p0, (AND p1 p0), true, (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p1, (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-13
Stuttering criterion allowed to conclude after 94 steps with 16 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-13 finished in 69315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 24 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 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 130 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2025-06-05 13:55:33] [INFO ] Computed 1540 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:55:35] [INFO ] Implicit Places using invariants in 2291 ms returned []
[2025-06-05 13:55:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:55:39] [INFO ] Implicit Places using invariants and state equation in 4444 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6745 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/1916 places, 351/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6941 ms. Remains : 1843/1916 places, 351/356 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-14
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-14 finished in 7035 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)||((p1 U p2) U X(p2)))))'
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 30 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 13:55:40] [INFO ] Computed 1562 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:55:41] [INFO ] Implicit Places using invariants in 1844 ms returned []
[2025-06-05 13:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:55:47] [INFO ] Implicit Places using invariants and state equation in 5696 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7544 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 31 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 7605 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 413 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-15 finished in 8043 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)||X(X((G(p1)||G(p2)))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-00
Stuttering acceptance computed with spot in 500 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 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
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1890 transition count 352
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 1890 transition count 352
Applied a total of 4 rules in 115 ms. Remains 1890 /1916 variables (removed 26) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2025-06-05 13:55:48] [INFO ] Computed 1540 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:55:50] [INFO ] Implicit Places using invariants in 1744 ms returned []
[2025-06-05 13:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:55:53] [INFO ] Implicit Places using invariants and state equation in 3434 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5183 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1867/1916 places, 352/356 transitions.
Applied a total of 0 rules in 47 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5345 ms. Remains : 1867/1916 places, 352/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-00
Product exploration explored 100000 steps with 3478 reset in 1330 ms.
Product exploration explored 100000 steps with 3472 reset in 1356 ms.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 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 p2 p1 p0), (X p0), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 139 ms. Reduced automaton from 12 states, 33 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1386 resets) in 1291 ms. (30 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 449940 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 23
Probabilistic random walk after 449940 steps, saw 67769 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
// Phase 1: matrix 352 rows 1867 cols
[2025-06-05 13:56:01] [INFO ] Computed 1518 invariants in 26 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/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1432/2219 variables, and 2186 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 1034/1518 constraints, State Equation: 1152/1867 constraints, PredecessorRefiner: 23/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1432/2219 variables, and 2186 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 1034/1518 constraints, State Equation: 1152/1867 constraints, PredecessorRefiner: 22/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10118ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1867 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 1867 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 1866 transition count 349
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 1 with 46 rules applied. Total rules applied 50 place count 1866 transition count 303
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 96 place count 1820 transition count 303
Applied a total of 96 rules in 101 ms. Remains 1820 /1867 variables (removed 47) and now considering 303/352 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1820/1867 places, 303/352 transitions.
RANDOM walk for 40000 steps (1437 resets) in 1432 ms. (27 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 496374 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :18 out of 23
Probabilistic random walk after 496374 steps, saw 75051 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :18
// Phase 1: matrix 303 rows 1820 cols
[2025-06-05 13:56:15] [INFO ] Computed 1518 invariants in 17 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf10 is UNSAT
Problem apf22 is UNSAT
After SMT solving in domain Real declared 2123/2123 variables, and 2854 constraints, problems are : Problem set: 5 solved, 0 unsolved in 1791 ms.
Refiners :[Generalized P Invariants (flows): 1034/1518 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1833ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0)), (G (OR p2 p0 p1)), (G (OR p0 p1)), (G (OR p2 (NOT p0) p1)), (G (OR p2 p1)), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 1960 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 453 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 32 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1867 cols
[2025-06-05 13:56:20] [INFO ] Computed 1518 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:56:21] [INFO ] Implicit Places using invariants in 1717 ms returned []
[2025-06-05 13:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:56:25] [INFO ] Implicit Places using invariants and state equation in 3313 ms returned []
Implicit Place search using SMT with State Equation took 5031 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-05 13: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/1844 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2196/2219 variables, and 3362 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 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, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2196 variables, 305/3667 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2196/2219 variables, and 3667 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in LTL mode , in 1 iterations and 65295 ms. Remains : 1867/1867 places, 352/352 transitions.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 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 p2 p1 p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1388 resets) in 835 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 759 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 831 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 812 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 758 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (52 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 807 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 812 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 730 ms. (54 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 450265 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 10
Probabilistic random walk after 450265 steps, saw 67805 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-05 13:57:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 761/2193 variables, 691/2877 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2193 variables, 484/3361 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2193/2219 variables, and 3361 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1843/1867 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 761/2193 variables, 691/2877 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2193 variables, 484/3361 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2193 variables, 1/3362 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2193/2219 variables, and 3362 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1843/1867 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10067ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1867 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 1867 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 1866 transition count 349
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 1 with 46 rules applied. Total rules applied 50 place count 1866 transition count 303
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 96 place count 1820 transition count 303
Applied a total of 96 rules in 92 ms. Remains 1820 /1867 variables (removed 47) and now considering 303/352 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1820/1867 places, 303/352 transitions.
RANDOM walk for 40000 steps (1435 resets) in 1442 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 941 ms. (42 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 1055 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 1052 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 1063 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 1020 ms. (39 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 1026 ms. (38 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 271 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 937 ms. (42 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 3914 steps, run visited all 10 properties in 114 ms. (steps per millisecond=34 )
Probabilistic random walk after 3914 steps, saw 3823 distinct states, run finished after 115 ms. (steps per millisecond=34 ) properties seen :10
Knowledge obtained : [(AND p2 p1 p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p1 p0))), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND p2 p1 p0))), (F (NOT (AND p2 p1))), (F (NOT (AND p2 p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 525 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 450 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 449 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3476 reset in 1055 ms.
Product exploration explored 100000 steps with 3471 reset in 1075 ms.
Applying partial POR strategy [true, true, true, false, false, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 405 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 42 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 13:57:48] [INFO ] Redundant transitions in 27 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-05 13:57:48] [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, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 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 2196/2219 variables, and 3362 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 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, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2196 variables, 305/3667 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2196/2219 variables, and 3667 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60345 ms. Remains : 1867/1867 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin16663768433058382717
[2025-06-05 13:58:49] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16663768433058382717
Running compilation step : cd /tmp/ltsmin16663768433058382717;'/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 1372 ms.
Running link step : cd /tmp/ltsmin16663768433058382717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16663768433058382717;'/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/stateBased14177658396808666838.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 35 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2025-06-05 13:59:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:59:06] [INFO ] Implicit Places using invariants in 1679 ms returned []
[2025-06-05 13:59:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 13:59:09] [INFO ] Implicit Places using invariants and state equation in 3232 ms returned []
Implicit Place search using SMT with State Equation took 4917 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-05 13:59:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2196/2219 variables, and 3362 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 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, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2196 variables, 305/3667 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2196/2219 variables, and 3667 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Finished structural reductions in LTL mode , in 1 iterations and 65238 ms. Remains : 1867/1867 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin5632834869725088473
[2025-06-05 14:00:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5632834869725088473
Running compilation step : cd /tmp/ltsmin5632834869725088473;'/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 1312 ms.
Running link step : cd /tmp/ltsmin5632834869725088473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5632834869725088473;'/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/stateBased12368727759656283778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 14:00:25] [INFO ] Flatten gal took : 188 ms
[2025-06-05 14:00:25] [INFO ] Flatten gal took : 101 ms
[2025-06-05 14:00:25] [INFO ] Time to serialize gal into /tmp/LTL16365507760480606673.gal : 19 ms
[2025-06-05 14:00:25] [INFO ] Time to serialize properties into /tmp/LTL3140548508603070.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/LTL16365507760480606673.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15345987131365594423.hoa' '-atoms' '/tmp/LTL3140548508603070.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...316
Loading property file /tmp/LTL3140548508603070.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15345987131365594423.hoa
Detected timeout of ITS tools.
[2025-06-05 14:00:40] [INFO ] Flatten gal took : 50 ms
[2025-06-05 14:00:40] [INFO ] Flatten gal took : 47 ms
[2025-06-05 14:00:40] [INFO ] Time to serialize gal into /tmp/LTL6702637313217959486.gal : 6 ms
[2025-06-05 14:00:40] [INFO ] Time to serialize properties into /tmp/LTL8574226421211631825.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6702637313217959486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8574226421211631825.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((G("(((((((((((n7_5<1)||(n7_28<1))||((n7_51<1)||(n7_74<1)))||(((n7_97<1)||(n7_120<1))||((n7_143<1)||(n7_166<1))))||((((n7_189<1)|...8936
Formula 0 simplified : X(F!"(((((((((((n7_5<1)||(n7_28<1))||((n7_51<1)||(n7_74<1)))||(((n7_97<1)||(n7_120<1))||((n7_143<1)||(n7_166<1))))||((((n7_189<1)||(...8922
Detected timeout of ITS tools.
[2025-06-05 14:00:55] [INFO ] Flatten gal took : 45 ms
[2025-06-05 14:00:55] [INFO ] Applying decomposition
[2025-06-05 14:00:55] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6579370665238728640.txt' '-o' '/tmp/graph6579370665238728640.bin' '-w' '/tmp/graph6579370665238728640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6579370665238728640.bin' '-l' '-1' '-v' '-w' '/tmp/graph6579370665238728640.weights' '-q' '0' '-e' '0.001'
[2025-06-05 14:00:55] [INFO ] Decomposing Gal with order
[2025-06-05 14:00:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 14:00:56] [INFO ] Removed a total of 253 redundant transitions.
[2025-06-05 14:00:56] [INFO ] Flatten gal took : 136 ms
[2025-06-05 14:00:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 82 ms.
[2025-06-05 14:00:56] [INFO ] Time to serialize gal into /tmp/LTL7781552432432588970.gal : 15 ms
[2025-06-05 14:00:56] [INFO ] Time to serialize properties into /tmp/LTL16795855746686809947.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/LTL7781552432432588970.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16795855746686809947.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...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((i2.u78.n7_5<1)||(i3.u79.n7_28<1))||((i15.u2.n7_51<1)||(i4.u80.n7_74<1)))||(((i12.u81.n7_97<1)||(i13.u82.n7_120<1))...13442
Formula 0 simplified : X(F!"(((((((((((i2.u78.n7_5<1)||(i3.u79.n7_28<1))||((i15.u2.n7_51<1)||(i4.u80.n7_74<1)))||(((i12.u81.n7_97<1)||(i13.u82.n7_120<1))||...13428
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-00 finished in 323356 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 G((!p1||G(!p2)))))'
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' '!((!p0 U (G(!p0)||(!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' '!(X(G((X(p0)||(X(X(X(F(!p2))))&&p1)))))'
[2025-06-05 14:01:11] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16515284606872772385
[2025-06-05 14:01:11] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2025-06-05 14:01:11] [INFO ] Applying decomposition
[2025-06-05 14:01:11] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 14:01:11] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2025-06-05 14:01:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 14:01:11] [INFO ] Flatten gal took : 44 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/graph16242143443556977436.txt' '-o' '/tmp/graph16242143443556977436.bin' '-w' '/tmp/graph16242143443556977436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16242143443556977436.bin' '-l' '-1' '-v' '-w' '/tmp/graph16242143443556977436.weights' '-q' '0' '-e' '0.001'
[2025-06-05 14:01:12] [INFO ] Decomposing Gal with order
[2025-06-05 14:01:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 14:01:12] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2025-06-05 14:01:12] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 14:01:12] [INFO ] Built C files in 290ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16515284606872772385
Running compilation step : cd /tmp/ltsmin16515284606872772385;'/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 14:01:12] [INFO ] Removed a total of 228 redundant transitions.
[2025-06-05 14:01:12] [INFO ] Flatten gal took : 102 ms
[2025-06-05 14:01:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 52 ms.
[2025-06-05 14:01:12] [INFO ] Time to serialize gal into /tmp/LTLFireability4613726070964597690.gal : 13 ms
[2025-06-05 14:01:12] [INFO ] Time to serialize properties into /tmp/LTLFireability12341267207496405351.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/LTLFireability4613726070964597690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12341267207496405351.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...277
Read 4 LTL properties
Checking formula 0 : !((X((G("(((((((((((i4.i0.u118.n7_5<1)||(i10.i1.u119.n7_28<1))||((i14.u120.n7_51<1)||(i35.i1.u11.n7_74<1)))||(((i27.i0.u121.n7_97<1)||...15362
Formula 0 simplified : X(F!"(((((((((((i4.i0.u118.n7_5<1)||(i10.i1.u119.n7_28<1))||((i14.u120.n7_51<1)||(i35.i1.u11.n7_74<1)))||(((i27.i0.u121.n7_97<1)||(i...15348
Compilation finished in 1737 ms.
Running link step : cd /tmp/ltsmin16515284606872772385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16515284606872772385;'/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(([]((LTLAPp0==true))||X(X(([]((LTLAPp1==true))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: LTL layer: formula: X(([]((LTLAPp0==true))||X(X(([]((LTLAPp1==true))||[]((LTLAPp2==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.021: "X(([]((LTLAPp0==true))||X(X(([]((LTLAPp1==true))||[]((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.022: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: buchi has 12 states
pins2lts-mc-linux64( 6/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.288: DFS-FIFO for weak LTL, using special progress label 365
pins2lts-mc-linux64( 0/ 8), 0.288: There are 366 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.288: State length is 1917, there are 389 groups
pins2lts-mc-linux64( 0/ 8), 0.288: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.288: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.288: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.288: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.529: ~1 levels ~960 states ~20816 transitions
pins2lts-mc-linux64( 4/ 8), 0.733: ~1 levels ~1920 states ~46232 transitions
pins2lts-mc-linux64( 4/ 8), 1.015: ~1 levels ~3840 states ~96704 transitions
pins2lts-mc-linux64( 5/ 8), 1.617: ~1 levels ~7680 states ~182784 transitions
pins2lts-mc-linux64( 1/ 8), 2.531: ~1 levels ~15360 states ~469376 transitions
pins2lts-mc-linux64( 1/ 8), 3.867: ~1 levels ~30720 states ~781216 transitions
pins2lts-mc-linux64( 1/ 8), 6.193: ~1 levels ~61440 states ~1583432 transitions
pins2lts-mc-linux64( 1/ 8), 12.919: ~1 levels ~122880 states ~4087536 transitions
pins2lts-mc-linux64( 1/ 8), 24.870: ~1 levels ~245760 states ~8572560 transitions
pins2lts-mc-linux64( 5/ 8), 48.513: ~1 levels ~491520 states ~16855760 transitions
pins2lts-mc-linux64( 5/ 8), 99.889: ~1 levels ~983040 states ~35441264 transitions
pins2lts-mc-linux64( 6/ 8), 104.876: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 105.577:
pins2lts-mc-linux64( 0/ 8), 105.577: mean standard work distribution: 3.2% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 105.577:
pins2lts-mc-linux64( 0/ 8), 105.577: Explored 970883 states 37097941 transitions, fanout: 38.211
pins2lts-mc-linux64( 0/ 8), 105.577: Total exploration time 105.280 sec (104.600 sec minimum, 104.810 sec on average)
pins2lts-mc-linux64( 0/ 8), 105.577: States per second: 9222, Transitions per second: 352374
pins2lts-mc-linux64( 0/ 8), 105.577:
pins2lts-mc-linux64( 0/ 8), 105.577: Progress states detected: 9162547
pins2lts-mc-linux64( 0/ 8), 105.578: Redundant explorations: -89.4040
pins2lts-mc-linux64( 0/ 8), 105.578:
pins2lts-mc-linux64( 0/ 8), 105.578: Queue width: 8B, total height: 9826710, memory: 74.97MB
pins2lts-mc-linux64( 0/ 8), 105.578: Tree memory: 325.9MB, 37.3 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 105.578: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 105.578: Stored 359 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 105.578: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 105.578: Est. total memory use: 400.9MB (~1099.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16515284606872772385;'/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(([]((LTLAPp0==true))||X(X(([]((LTLAPp1==true))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16515284606872772385;'/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(([]((LTLAPp0==true))||X(X(([]((LTLAPp1==true))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 14:30:42] [INFO ] Applying decomposition
[2025-06-05 14:30:42] [INFO ] Flatten gal took : 474 ms
[2025-06-05 14:30:43] [INFO ] Decomposing Gal with order
[2025-06-05 14:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 14:30:43] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to malicious_reservoir in partition [n6_0, n5_0, n4_0, n3_0, n2_0, n1_0, c1_0, Cstart_0, Sstart_0, s2_0, s3_0, s4_0, s5_0, s6_0],[n6_1, n5_1, n4_1, n3_1, n2_1, n1_1, c1_1, Cstart_1, Sstart_1, s2_1, s3_1, s4_1, s5_1, s6_1],[n6_2, n5_2, n4_2, n3_2, n2_2, n1_2, c1_2, Cstart_2, Sstart_2, s2_2, s3_2, s4_2, s5_2, s6_2],[n6_3, n5_3, n4_3, n3_3, n2_3, n1_3, c1_3, Cstart_3, Sstart_3, s2_3, s3_3, s4_3, s5_3, s6_3],[n6_4, n5_4, n4_4, n3_4, n2_4, n1_4, c1_4, Cstart_4, Sstart_4, s2_4, s3_4, s4_4, s5_4, s6_4],[n6_5, n5_5, n4_5, n3_5, n2_5, n1_5, c1_5, Cstart_5, Sstart_5, s2_5, s3_5, s4_5, s5_5, s6_5],[n6_6, n5_6, n4_6, n3_6, n2_6, n1_6, c1_6, Cstart_6, Sstart_6, s2_6, s3_6, s4_6, s5_6, s6_6],[n6_7, n5_7, n4_7, n3_7, n2_7, n1_7, c1_7, Cstart_7, Sstart_7, s2_7, s3_7, s4_7, s5_7, s6_7],[n6_8, n5_8, n4_8, n3_8, n2_8, n1_8, c1_8, Cstart_8, Sstart_8, s2_8, s3_8, s4_8, s5_8, s6_8],[n6_9, n5_9, n4_9, n3_9, n2_9, n1_9, c1_9, Cstart_9, Sstart_9, s2_9, s3_9, s4_9, s5_9, s6_9],[n6_10, n5_10, n4_10, n3_10, n2_10, n1_10, c1_10, Cstart_10, Sstart_10, s2_10, s3_10, s4_10, s5_10, s6_10],[n6_11, n5_11, n4_11, n3_11, n2_11, n1_11, c1_11, Cstart_11, Sstart_11, s2_11, s3_11, s4_11, s5_11, s6_11],[n6_12, n5_12, n4_12, n3_12, n2_12, n1_12, c1_12, Cstart_12, Sstart_12, s2_12, s3_12, s4_12, s5_12, s6_12],[n6_13, n5_13, n4_13, n3_13, n2_13, n1_13, c1_13, Cstart_13, Sstart_13, s2_13, s3_13, s4_13, s5_13, s6_13],[n6_14, n5_14, n4_14, n3_14, n2_14, n1_14, c1_14, Cstart_14, Sstart_14, s2_14, s3_14, s4_14, s5_14, s6_14],[n6_15, n5_15, n4_15, n3_15, n2_15, n1_15, c1_15, Cstart_15, Sstart_15, s2_15, s3_15, s4_15, s5_15, s6_15],[n6_16, n5_16, n4_16, n3_16, n2_16, n1_16, c1_16, Cstart_16, Sstart_16, s2_16, s3_16, s4_16, s5_16, s6_16],[n6_17, n5_17, n4_17, n3_17, n2_17, n1_17, c1_17, Cstart_17, Sstart_17, s2_17, s3_17, s4_17, s5_17, s6_17],[n6_18, n5_18, n4_18, n3_18, n2_18, n1_18, c1_18, Cstart_18, Sstart_18, s2_18, s3_18, s4_18, s5_18, s6_18],[n6_19, n5_19, n4_19, n3_19, n2_19, n1_19, c1_19, Cstart_19, Sstart_19, s2_19, s3_19, s4_19, s5_19, s6_19],[n6_20, n5_20, n4_20, n3_20, n2_20, n1_20, c1_20, Cstart_20, Sstart_20, s2_20, s3_20, s4_20, s5_20, s6_20],[n6_21, n5_21, n4_21, n3_21, n2_21, n1_21, c1_21, Cstart_21, Sstart_21, s2_21, s3_21, s4_21, s5_21, s6_21],[n6_22, n5_22, n4_22, n3_22, n2_22, n1_22, c1_22, Cstart_22, Sstart_22, s2_22, s3_22, s4_22, s5_22, s6_22],[n9_0, n8_0, n7_0],[n9_1, n8_1, n7_1],[n9_2, n8_2, n7_2],[n9_3, n8_3, n7_3],[n9_4, n8_4, n7_4],[n9_5, n8_5, n7_5],[n9_6, n8_6, n7_6],[n9_7, n8_7, n7_7],[n9_8, n8_8, n7_8],[n9_9, n8_9, n7_9],[n9_10, n8_10, n7_10],[n9_11, n8_11, n7_11],[n9_12, n8_12, n7_12],[n9_13, n8_13, n7_13],[n9_14, n8_14, n7_14],[n9_15, n8_15, n7_15],[n9_16, n8_16, n7_16],[n9_17, n8_17, n7_17],[n9_18, n8_18, n7_18],[n9_19, n8_19, n7_19],[n9_20, n8_20, n7_20],[n9_21, n8_21, n7_21],[n9_22, n8_22, n7_22],[n9_23, n8_23, n7_23],[n9_24, n8_24, n7_24],[n9_25, n8_25, n7_25],[n9_26, n8_26, n7_26],[n9_27, n8_27, n7_27],[n9_28, n8_28, n7_28],[n9_29, n8_29, n7_29],[n9_30, n8_30, n7_30],[n9_31, n8_31, n7_31],[n9_32, n8_32, n7_32],[n9_33, n8_33, n7_33],[n9_34, n8_34, n7_34],[n9_35, n8_35, n7_35],[n9_36, n8_36, n7_36],[n9_37, n8_37, n7_37],[n9_38, n8_38, n7_38],[n9_39, n8_39, n7_39],[n9_40, n8_40, n7_40],[n9_41, n8_41, n7_41],[n9_42, n8_42, n7_42],[n9_43, n8_43, n7_43],[n9_44, n8_44, n7_44],[n9_45, n8_45, n7_45],[n9_46, n8_46, n7_46],[n9_47, n8_47, n7_47],[n9_48, n8_48, n7_48],[n9_49, n8_49, n7_49],[n9_50, n8_50, n7_50],[n9_51, n8_51, n7_51],[n9_52, n8_52, n7_52],[n9_53, n8_53, n7_53],[n9_54, n8_54, n7_54],[n9_55, n8_55, n7_55],[n9_56, n8_56, n7_56],[n9_57, n8_57, n7_57],[n9_58, n8_58, n7_58],[n9_59, n8_59, n7_59],[n9_60, n8_60, n7_60],[n9_61, n8_61, n7_61],[n9_62, n8_62, n7_62],[n9_63, n8_63, n7_63],[n9_64, n8_64, n7_64],[n9_65, n8_65, n7_65],[n9_66, n8_66, n7_66],[n9_67, n8_67, n7_67],[n9_68, n8_68, n7_68],[n9_69, n8_69, n7_69],[n9_70, n8_70, n7_70],[n9_71, n8_71, n7_71],[n9_72, n8_72, n7_72],[n9_73, n8_73, n7_73],[n9_74, n8_74, n7_74],[n9_75, n8_75, n7_75],[n9_76, n8_76, n7_76],[n9_77, n8_77, n7_77],[n9_78, n8_78, n7_78],[n9_79, n8_79, n7_79],[n9_80, n8_80, n7_80],[n9_81, n8_81, n7_81],[n9_82, n8_82, n7_82],[n9_83, n8_83, n7_83],[n9_84, n8_84, n7_84],[n9_85, n8_85, n7_85],[n9_86, n8_86, n7_86],[n9_87, n8_87, n7_87],[n9_88, n8_88, n7_88],[n9_89, n8_89, n7_89],[n9_90, n8_90, n7_90],[n9_91, n8_91, n7_91],[n9_92, n8_92, n7_92],[n9_93, n8_93, n7_93],[n9_94, n8_94, n7_94],[n9_95, n8_95, n7_95],[n9_96, n8_96, n7_96],[n9_97, n8_97, n7_97],[n9_98, n8_98, n7_98],[n9_99, n8_99, n7_99],[n9_100, n8_100, n7_100],[n9_101, n8_101, n7_101],[n9_102, n8_102, n7_102],[n9_103, n8_103, n7_103],[n9_104, n8_104, n7_104],[n9_105, n8_105, n7_105],[n9_106, n8_106, n7_106],[n9_107, n8_107, n7_107],[n9_108, n8_108, n7_108],[n9_109, n8_109, n7_109],[n9_110, n8_110, n7_110],[n9_111, n8_111, n7_111],[n9_112, n8_112, n7_112],[n9_113, n8_113, n7_113],[n9_114, n8_114, n7_114],[n9_115, n8_115, n7_115],[n9_116, n8_116, n7_116],[n9_117, n8_117, n7_117],[n9_118, n8_118, n7_118],[n9_119, n8_119, n7_119],[n9_120, n8_120, n7_120],[n9_121, n8_121, n7_121],[n9_122, n8_122, n7_122],[n9_123, n8_123, n7_123],[n9_124, n8_124, n7_124],[n9_125, n8_125, n7_125],[n9_126, n8_126, n7_126],[n9_127, n8_127, n7_127],[n9_128, n8_128, n7_128],[n9_129, n8_129, n7_129],[n9_130, n8_130, n7_130],[n9_131, n8_131, n7_131],[n9_132, n8_132, n7_132],[n9_133, n8_133, n7_133],[n9_134, n8_134, n7_134],[n9_135, n8_135, n7_135],[n9_136, n8_136, n7_136],[n9_137, n8_137, n7_137],[n9_138, n8_138, n7_138],[n9_139, n8_139, n7_139],[n9_140, n8_140, n7_140],[n9_141, n8_141, n7_141],[n9_142, n8_142, n7_142],[n9_143, n8_143, n7_143],[n9_144, n8_144, n7_144],[n9_145, n8_145, n7_145],[n9_146, n8_146, n7_146],[n9_147, n8_147, n7_147],[n9_148, n8_148, n7_148],[n9_149, n8_149, n7_149],[n9_150, n8_150, n7_150],[n9_151, n8_151, n7_151],[n9_152, n8_152, n7_152],[n9_153, n8_153, n7_153],[n9_154, n8_154, n7_154],[n9_155, n8_155, n7_155],[n9_156, n8_156, n7_156],[n9_157, n8_157, n7_157],[n9_158, n8_158, n7_158],[n9_159, n8_159, n7_159],[n9_160, n8_160, n7_160],[n9_161, n8_161, n7_161],[n9_162, n8_162, n7_162],[n9_163, n8_163, n7_163],[n9_164, n8_164, n7_164],[n9_165, n8_165, n7_165],[n9_166, n8_166, n7_166],[n9_167, n8_167, n7_167],[n9_168, n8_168, n7_168],[n9_169, n8_169, n7_169],[n9_170, n8_170, n7_170],[n9_171, n8_171, n7_171],[n9_172, n8_172, n7_172],[n9_173, n8_173, n7_173],[n9_174, n8_174, n7_174],[n9_175, n8_175, n7_175],[n9_176, n8_176, n7_176],[n9_177, n8_177, n7_177],[n9_178, n8_178, n7_178],[n9_179, n8_179, n7_179],[n9_180, n8_180, n7_180],[n9_181, n8_181, n7_181],[n9_182, n8_182, n7_182],[n9_183, n8_183, n7_183],[n9_184, n8_184, n7_184],[n9_185, n8_185, n7_185],[n9_186, n8_186, n7_186],[n9_187, n8_187, n7_187],[n9_188, n8_188, n7_188],[n9_189, n8_189, n7_189],[n9_190, n8_190, n7_190],[n9_191, n8_191, n7_191],[n9_192, n8_192, n7_192],[n9_193, n8_193, n7_193],[n9_194, n8_194, n7_194],[n9_195, n8_195, n7_195],[n9_196, n8_196, n7_196],[n9_197, n8_197, n7_197],[n9_198, n8_198, n7_198],[n9_199, n8_199, n7_199],[n9_200, n8_200, n7_200],[n9_201, n8_201, n7_201],[n9_202, n8_202, n7_202],[n9_203, n8_203, n7_203],[n9_204, n8_204, n7_204],[n9_205, n8_205, n7_205],[n9_206, n8_206, n7_206],[n9_207, n8_207, n7_207],[n9_208, n8_208, n7_208],[n9_209, n8_209, n7_209],[n9_210, n8_210, n7_210],[n9_211, n8_211, n7_211],[n9_212, n8_212, n7_212],[n9_213, n8_213, n7_213],[n9_214, n8_214, n7_214],[n9_215, n8_215, n7_215],[n9_216, n8_216, n7_216],[n9_217, n8_217, n7_217],[n9_218, n8_218, n7_218],[n9_219, n8_219, n7_219],[n9_220, n8_220, n7_220],[n9_221, n8_221, n7_221],[n9_222, n8_222, n7_222],[n9_223, n8_223, n7_223],[n9_224, n8_224, n7_224],[n9_225, n8_225, n7_225],[n9_226, n8_226, n7_226],[n9_227, n8_227, n7_227],[n9_228, n8_228, n7_228],[n9_229, n8_229, n7_229],[n9_230, n8_230, n7_230],[n9_231, n8_231, n7_231],[n9_232, n8_232, n7_232],[n9_233, n8_233, n7_233],[n9_234, n8_234, n7_234],[n9_235, n8_235, n7_235],[n9_236, n8_236, n7_236],[n9_237, n8_237, n7_237],[n9_238, n8_238, n7_238],[n9_239, n8_239, n7_239],[n9_240, n8_240, n7_240],[n9_241, n8_241, n7_241],[n9_242, n8_242, n7_242],[n9_243, n8_243, n7_243],[n9_244, n8_244, n7_244],[n9_245, n8_245, n7_245],[n9_246, n8_246, n7_246],[n9_247, n8_247, n7_247],[n9_248, n8_248, n7_248],[n9_249, n8_249, n7_249],[n9_250, n8_250, n7_250],[n9_251, n8_251, n7_251],[n9_252, n8_252, n7_252],[n9_253, n8_253, n7_253],[n9_254, n8_254, n7_254],[n9_255, n8_255, n7_255],[n9_256, n8_256, n7_256],[n9_257, n8_257, n7_257],[n9_258, n8_258, n7_258],[n9_259, n8_259, n7_259],[n9_260, n8_260, n7_260],[n9_261, n8_261, n7_261],[n9_262, n8_262, n7_262],[n9_263, n8_263, n7_263],[n9_264, n8_264, n7_264],[n9_265, n8_265, n7_265],[n9_266, n8_266, n7_266],[n9_267, n8_267, n7_267],[n9_268, n8_268, n7_268],[n9_269, n8_269, n7_269],[n9_270, n8_270, n7_270],[n9_271, n8_271, n7_271],[n9_272, n8_272, n7_272],[n9_273, n8_273, n7_273],[n9_274, n8_274, n7_274],[n9_275, n8_275, n7_275],[n9_276, n8_276, n7_276],[n9_277, n8_277, n7_277],[n9_278, n8_278, n7_278],[n9_279, n8_279, n7_279],[n9_280, n8_280, n7_280],[n9_281, n8_281, n7_281],[n9_282, n8_282, n7_282],[n9_283, n8_283, n7_283],[n9_284, n8_284, n7_284],[n9_285, n8_285, n7_285],[n9_286, n8_286, n7_286],[n9_287, n8_287, n7_287],[n9_288, n8_288, n7_288],[n9_289, n8_289, n7_289],[n9_290, n8_290, n7_290],[n9_291, n8_291, n7_291],[n9_292, n8_292, n7_292],[n9_293, n8_293, n7_293],[n9_294, n8_294, n7_294],[n9_295, n8_295, n7_295],[n9_296, n8_296, n7_296],[n9_297, n8_297, n7_297],[n9_298, n8_298, n7_298],[n9_299, n8_299, n7_299],[n9_300, n8_300, n7_300],[n9_301, n8_301, n7_301],[n9_302, n8_302, n7_302],[n9_303, n8_303, n7_303],[n9_304, n8_304, n7_304],[n9_305, n8_305, n7_305],[n9_306, n8_306, n7_306],[n9_307, n8_307, n7_307],[n9_308, n8_308, n7_308],[n9_309, n8_309, n7_309],[n9_310, n8_310, n7_310],[n9_311, n8_311, n7_311],[n9_312, n8_312, n7_312],[n9_313, n8_313, n7_313],[n9_314, n8_314, n7_314],[n9_315, n8_315, n7_315],[n9_316, n8_316, n7_316],[n9_317, n8_317, n7_317],[n9_318, n8_318, n7_318],[n9_319, n8_319, n7_319],[n9_320, n8_320, n7_320],[n9_321, n8_321, n7_321],[n9_322, n8_322, n7_322],[n9_323, n8_323, n7_323],[n9_324, n8_324, n7_324],[n9_325, n8_325, n7_325],[n9_326, n8_326, n7_326],[n9_327, n8_327, n7_327],[n9_328, n8_328, n7_328],[n9_329, n8_329, n7_329],[n9_330, n8_330, n7_330],[n9_331, n8_331, n7_331],[n9_332, n8_332, n7_332],[n9_333, n8_333, n7_333],[n9_334, n8_334, n7_334],[n9_335, n8_335, n7_335],[n9_336, n8_336, n7_336],[n9_337, n8_337, n7_337],[n9_338, n8_338, n7_338],[n9_339, n8_339, n7_339],[n9_340, n8_340, n7_340],[n9_341, n8_341, n7_341],[n9_342, n8_342, n7_342],[n9_343, n8_343, n7_343],[n9_344, n8_344, n7_344],[n9_345, n8_345, n7_345],[n9_346, n8_346, n7_346],[n9_347, n8_347, n7_347],[n9_348, n8_348, n7_348],[n9_349, n8_349, n7_349],[n9_350, n8_350, n7_350],[n9_351, n8_351, n7_351],[n9_352, n8_352, n7_352],[n9_353, n8_353, n7_353],[n9_354, n8_354, n7_354],[n9_355, n8_355, n7_355],[n9_356, n8_356, n7_356],[n9_357, n8_357, n7_357],[n9_358, n8_358, n7_358],[n9_359, n8_359, n7_359],[n9_360, n8_360, n7_360],[n9_361, n8_361, n7_361],[n9_362, n8_362, n7_362],[n9_363, n8_363, n7_363],[n9_364, n8_364, n7_364],[n9_365, n8_365, n7_365],[n9_366, n8_366, n7_366],[n9_367, n8_367, n7_367],[n9_368, n8_368, n7_368],[n9_369, n8_369, n7_369],[n9_370, n8_370, n7_370],[n9_371, n8_371, n7_371],[n9_372, n8_372, n7_372],[n9_373, n8_373, n7_373],[n9_374, n8_374, n7_374],[n9_375, n8_375, n7_375],[n9_376, n8_376, n7_376],[n9_377, n8_377, n7_377],[n9_378, n8_378, n7_378],[n9_379, n8_379, n7_379],[n9_380, n8_380, n7_380],[n9_381, n8_381, n7_381],[n9_382, n8_382, n7_382],[n9_383, n8_383, n7_383],[n9_384, n8_384, n7_384],[n9_385, n8_385, n7_385],[n9_386, n8_386, n7_386],[n9_387, n8_387, n7_387],[n9_388, n8_388, n7_388],[n9_389, n8_389, n7_389],[n9_390, n8_390, n7_390],[n9_391, n8_391, n7_391],[n9_392, n8_392, n7_392],[n9_393, n8_393, n7_393],[n9_394, n8_394, n7_394],[n9_395, n8_395, n7_395],[n9_396, n8_396, n7_396],[n9_397, n8_397, n7_397],[n9_398, n8_398, n7_398],[n9_399, n8_399, n7_399],[n9_400, n8_400, n7_400],[n9_401, n8_401, n7_401],[n9_402, n8_402, n7_402],[n9_403, n8_403, n7_403],[n9_404, n8_404, n7_404],[n9_405, n8_405, n7_405],[n9_406, n8_406, n7_406],[n9_407, n8_407, n7_407],[n9_408, n8_408, n7_408],[n9_409, n8_409, n7_409],[n9_410, n8_410, n7_410],[n9_411, n8_411, n7_411],[n9_412, n8_412, n7_412],[n9_413, n8_413, n7_413],[n9_414, n8_414, n7_414],[n9_415, n8_415, n7_415],[n9_416, n8_416, n7_416],[n9_417, n8_417, n7_417],[n9_418, n8_418, n7_418],[n9_419, n8_419, n7_419],[n9_420, n8_420, n7_420],[n9_421, n8_421, n7_421],[n9_422, n8_422, n7_422],[n9_423, n8_423, n7_423],[n9_424, n8_424, n7_424],[n9_425, n8_425, n7_425],[n9_426, n8_426, n7_426],[n9_427, n8_427, n7_427],[n9_428, n8_428, n7_428],[n9_429, n8_429, n7_429],[n9_430, n8_430, n7_430],[n9_431, n8_431, n7_431],[n9_432, n8_432, n7_432],[n9_433, n8_433, n7_433],[n9_434, n8_434, n7_434],[n9_435, n8_435, n7_435],[n9_436, n8_436, n7_436],[n9_437, n8_437, n7_437],[n9_438, n8_438, n7_438],[n9_439, n8_439, n7_439],[n9_440, n8_440, n7_440],[n9_441, n8_441, n7_441],[n9_442, n8_442, n7_442],[n9_443, n8_443, n7_443],[n9_444, n8_444, n7_444],[n9_445, n8_445, n7_445],[n9_446, n8_446, n7_446],[n9_447, n8_447, n7_447],[n9_448, n8_448, n7_448],[n9_449, n8_449, n7_449],[n9_450, n8_450, n7_450],[n9_451, n8_451, n7_451],[n9_452, n8_452, n7_452],[n9_453, n8_453, n7_453],[n9_454, n8_454, n7_454],[n9_455, n8_455, n7_455],[n9_456, n8_456, n7_456],[n9_457, n8_457, n7_457],[n9_458, n8_458, n7_458],[n9_459, n8_459, n7_459],[n9_460, n8_460, n7_460],[n9_461, n8_461, n7_461],[n9_462, n8_462, n7_462],[n9_463, n8_463, n7_463],[n9_464, n8_464, n7_464],[n9_465, n8_465, n7_465],[n9_466, n8_466, n7_466],[n9_467, n8_467, n7_467],[n9_468, n8_468, n7_468],[n9_469, n8_469, n7_469],[n9_470, n8_470, n7_470],[n9_471, n8_471, n7_471],[n9_472, n8_472, n7_472],[n9_473, n8_473, n7_473],[n9_474, n8_474, n7_474],[n9_475, n8_475, n7_475],[n9_476, n8_476, n7_476],[n9_477, n8_477, n7_477],[n9_478, n8_478, n7_478],[n9_479, n8_479, n7_479],[n9_480, n8_480, n7_480],[n9_481, n8_481, n7_481],[n9_482, n8_482, n7_482],[n9_483, n8_483, n7_483],[n9_484, n8_484, n7_484],[n9_485, n8_485, n7_485],[n9_486, n8_486, n7_486],[n9_487, n8_487, n7_487],[n9_488, n8_488, n7_488],[n9_489, n8_489, n7_489],[n9_490, n8_490, n7_490],[n9_491, n8_491, n7_491],[n9_492, n8_492, n7_492],[n9_493, n8_493, n7_493],[n9_494, n8_494, n7_494],[n9_495, n8_495, n7_495],[n9_496, n8_496, n7_496],[n9_497, n8_497, n7_497],[n9_498, n8_498, n7_498],[n9_499, n8_499, n7_499],[n9_500, n8_500, n7_500],[n9_501, n8_501, n7_501],[n9_502, n8_502, n7_502],[n9_503, n8_503, n7_503],[n9_504, n8_504, n7_504],[n9_505, n8_505, n7_505],[n9_506, n8_506, n7_506],[n9_507, n8_507, n7_507],[n9_508, n8_508, n7_508],[n9_509, n8_509, n7_509],[n9_510, n8_510, n7_510],[n9_511, n8_511, n7_511],[n9_512, n8_512, n7_512],[n9_513, n8_513, n7_513],[n9_514, n8_514, n7_514],[n9_515, n8_515, n7_515],[n9_516, n8_516, n7_516],[n9_517, n8_517, n7_517],[n9_518, n8_518, n7_518],[n9_519, n8_519, n7_519],[n9_520, n8_520, n7_520],[n9_521, n8_521, n7_521],[n9_522, n8_522, n7_522],[n9_523, n8_523, n7_523],[n9_524, n8_524, n7_524],[n9_525, n8_525, n7_525],[n9_526, n8_526, n7_526],[n9_527, n8_527, n7_527],[n9_528, n8_528, n7_528],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-05 14:31:00] [INFO ] Flatten gal took : 16826 ms
[2025-06-05 14:31:00] [INFO ] Time to serialize gal into /tmp/LTLFireability11738379316493430542.gal : 20 ms
[2025-06-05 14:31:00] [INFO ] Time to serialize properties into /tmp/LTLFireability2287371831839486407.ltl : 19 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/LTLFireability11738379316493430542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2287371831839486407.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 : !((X((G("(((((((((((n7_5<1)||(n7_28<1))||((n7_51<1)||(n7_74<1)))||(((n7_97<1)||(n7_120<1))||((n7_143<1)||(n7_166<1))))||((((n7_189<1)|...8936
Formula 0 simplified : X(F!"(((((((((((n7_5<1)||(n7_28<1))||((n7_51<1)||(n7_74<1)))||(((n7_97<1)||(n7_120<1))||((n7_143<1)||(n7_166<1))))||((((n7_189<1)||(...8922

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-22"
export BK_EXAMINATION="LTLFireability"
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-COL-22, examination is LTLFireability"
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-174881254600756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;