About the Execution of ITS-Tools for TokenRing-PT-015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?T???TTFTF?FFFF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589600348.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 TokenRing-PT-015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589600348
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 47M
-rw-r--r-- 1 mcc users 404K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8M May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 124K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 460K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.9M May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 426K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6M May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.7M May 29 14:33 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 TokenRing-PT-015-LTLFireability-00
FORMULA_NAME TokenRing-PT-015-LTLFireability-01
FORMULA_NAME TokenRing-PT-015-LTLFireability-02
FORMULA_NAME TokenRing-PT-015-LTLFireability-03
FORMULA_NAME TokenRing-PT-015-LTLFireability-04
FORMULA_NAME TokenRing-PT-015-LTLFireability-05
FORMULA_NAME TokenRing-PT-015-LTLFireability-06
FORMULA_NAME TokenRing-PT-015-LTLFireability-07
FORMULA_NAME TokenRing-PT-015-LTLFireability-08
FORMULA_NAME TokenRing-PT-015-LTLFireability-09
FORMULA_NAME TokenRing-PT-015-LTLFireability-10
FORMULA_NAME TokenRing-PT-015-LTLFireability-11
FORMULA_NAME TokenRing-PT-015-LTLFireability-12
FORMULA_NAME TokenRing-PT-015-LTLFireability-13
FORMULA_NAME TokenRing-PT-015-LTLFireability-14
FORMULA_NAME TokenRing-PT-015-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749223585639
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-015
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 15:26:27] [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-06 15:26:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 15:26:27] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-06-06 15:26:27] [INFO ] Transformed 256 places.
[2025-06-06 15:26:27] [INFO ] Transformed 3616 transitions.
[2025-06-06 15:26:27] [INFO ] Found NUPN structural information;
[2025-06-06 15:26:27] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 137 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TokenRing-PT-015-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 24 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:26:29] [INFO ] Computed 16 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:26:33] [INFO ] Implicit Places using invariants in 3982 ms returned []
[2025-06-06 15:26:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:26:34] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:26:34] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 5151 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:26:34] [INFO ] Invariant cache hit.
[2025-06-06 15:26:34] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:27:04] [INFO ] Deduced a trap composed of 129 places in 5339 ms of which 2000 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:27:05] [INFO ] Deduced a trap composed of 129 places in 406 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:27:13] [INFO ] Deduced a trap composed of 130 places in 7926 ms of which 7610 ms to minimize.
SMT process timed out in 38591ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 38626ms
Finished structural reductions in LTL mode , in 1 iterations and 43836 ms. Remains : 256/256 places, 3616/3616 transitions.
Support contains 256 out of 256 places after structural reductions.
[2025-06-06 15:27:14] [INFO ] Flatten gal took : 372 ms
[2025-06-06 15:27:16] [INFO ] Flatten gal took : 346 ms
[2025-06-06 15:27:17] [INFO ] Input system was already deterministic with 3616 transitions.
Reduction of identical properties reduced properties to check from 26 to 22
RANDOM walk for 40000 steps (8 resets) in 6142 ms. (6 steps per ms) remains 11/22 properties
BEST_FIRST walk for 40000 steps (8 resets) in 4744 ms. (8 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 4006 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3823 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3680 ms. (10 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3773 ms. (10 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3719 ms. (10 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3687 ms. (10 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3744 ms. (10 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3678 ms. (10 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3724 ms. (10 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 4666 ms. (8 steps per ms) remains 10/10 properties
[2025-06-06 15:27:31] [INFO ] Invariant cache hit.
[2025-06-06 15:27:31] [INFO ] State equation strengthened by 3390 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5016 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 172/192 variables, 12/32 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 172/204 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2656/2848 variables, 192/396 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2848 variables, 1815/2211 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2848 variables, 5/2216 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2848 variables, 0/2216 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 930/3778 variables, 1350/3566 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3778 variables, 195/3761 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3778/3872 variables, and 3761 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5021 ms.
Refiners :[Domain max(s): 192/256 constraints, Positive P Invariants (semi-flows): 12/16 constraints, State Equation: 192/256 constraints, ReadFeed: 3360/3390 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10103ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 166 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 740 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 552 ms. (72 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 506 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 889 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 345 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 276 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 276 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 378 ms. (105 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 278 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 343 ms. (116 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 111188 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 9
Probabilistic random walk after 111188 steps, saw 22026 distinct states, run finished after 3006 ms. (steps per millisecond=36 ) properties seen :0
[2025-06-06 15:27:45] [INFO ] Invariant cache hit.
[2025-06-06 15:27:45] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 172/192 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 172/204 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2656/2848 variables, 192/396 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2848 variables, 1815/2211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2848 variables, 0/2211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 930/3778 variables, 1350/3561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3778 variables, 195/3756 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3778 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 94/3872 variables, 64/3820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3872 variables, 64/3884 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3872 variables, 4/3888 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 9 unsolved in 13431 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 172/192 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 172/204 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2656/2848 variables, 192/396 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2848 variables, 1815/2211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2848 variables, 5/2216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2848 variables, 0/2216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 930/3778 variables, 1350/3566 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3778 variables, 195/3761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3778 variables, 0/3761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 94/3872 variables, 64/3825 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3872 variables, 64/3889 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3872 variables, 4/3893 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3872 variables, 30/3923 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3872 variables, 4/3927 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3872 variables, 0/3927 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/3872 variables, 0/3927 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3927 constraints, problems are : Problem set: 0 solved, 9 unsolved in 14520 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27989ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 13274 ms.
Support contains 20 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 198 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 64 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:28:27] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-06-06 15:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:28:28] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:28:41] [INFO ] Implicit Places using invariants and state equation in 13561 ms returned []
Implicit Place search using SMT with State Equation took 13912 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:28:41] [INFO ] Redundant transitions in 273 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:28:41] [INFO ] Invariant cache hit.
[2025-06-06 15:28:41] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:05] [INFO ] Deduced a trap composed of 129 places in 2310 ms of which 2002 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:05] [INFO ] Deduced a trap composed of 129 places in 413 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:13] [INFO ] Deduced a trap composed of 130 places in 7984 ms of which 7676 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:13] [INFO ] Deduced a trap composed of 129 places in 496 ms of which 170 ms to minimize.
SMT process timed out in 32595ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32604ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46869 ms. Remains : 256/256 places, 3616/3616 transitions.
FORMULA TokenRing-PT-015-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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(X(X(F(p0))))))'
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:29:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:29:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 15:29:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:29:15] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:29:15] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:29:15] [INFO ] Invariant cache hit.
[2025-06-06 15:29:15] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:39] [INFO ] Deduced a trap composed of 129 places in 2322 ms of which 2008 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:39] [INFO ] Deduced a trap composed of 129 places in 426 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:47] [INFO ] Deduced a trap composed of 130 places in 8040 ms of which 7749 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:48] [INFO ] Deduced a trap composed of 129 places in 442 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:49] [INFO ] Deduced a trap composed of 130 places in 1154 ms of which 847 ms to minimize.
SMT process timed out in 33320ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33327ms
Finished structural reductions in LTL mode , in 1 iterations and 34416 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 365 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-00
Product exploration explored 100000 steps with 2181 reset in 5126 ms.
Product exploration explored 100000 steps with 2184 reset in 5061 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 184 steps (0 resets) in 36 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 15:30:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p0)
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 12 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:30:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:30:30] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-06 15:30:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:30:31] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:30:31] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:30:32] [INFO ] Invariant cache hit.
[2025-06-06 15:30:32] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:30:55] [INFO ] Deduced a trap composed of 129 places in 2299 ms of which 1998 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:30:55] [INFO ] Deduced a trap composed of 129 places in 396 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:31:03] [INFO ] Deduced a trap composed of 130 places in 8061 ms of which 7758 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:31:04] [INFO ] Deduced a trap composed of 129 places in 483 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:31:05] [INFO ] Deduced a trap composed of 130 places in 1139 ms of which 847 ms to minimize.
SMT process timed out in 33280ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33287ms
Finished structural reductions in LTL mode , in 1 iterations and 34549 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 172 steps (0 resets) in 25 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 15:31:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:831)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
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-06 15:31:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2183 reset in 5033 ms.
Product exploration explored 100000 steps with 2182 reset in 5037 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 125 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:31:45] [INFO ] Redundant transitions in 159 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:31:45] [INFO ] Invariant cache hit.
[2025-06-06 15:31:45] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:08] [INFO ] Deduced a trap composed of 129 places in 2412 ms of which 2119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:09] [INFO ] Deduced a trap composed of 129 places in 415 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:17] [INFO ] Deduced a trap composed of 130 places in 8233 ms of which 7935 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:18] [INFO ] Deduced a trap composed of 129 places in 477 ms of which 170 ms to minimize.
SMT process timed out in 32661ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32970 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin16721582451257171633
[2025-06-06 15:32:18] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16721582451257171633
Running compilation step : cd /tmp/ltsmin16721582451257171633;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16721582451257171633;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16721582451257171633;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:32:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:32:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 15:32:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:32:22] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:32:22] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:32:22] [INFO ] Invariant cache hit.
[2025-06-06 15:32:22] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:45] [INFO ] Deduced a trap composed of 129 places in 2314 ms of which 2018 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:46] [INFO ] Deduced a trap composed of 129 places in 422 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:54] [INFO ] Deduced a trap composed of 130 places in 7923 ms of which 7621 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:54] [INFO ] Deduced a trap composed of 129 places in 450 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:55] [INFO ] Deduced a trap composed of 130 places in 1132 ms of which 848 ms to minimize.
SMT process timed out in 33368ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33376ms
Finished structural reductions in LTL mode , in 1 iterations and 34476 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin4282249392659873511
[2025-06-06 15:32:55] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4282249392659873511
Running compilation step : cd /tmp/ltsmin4282249392659873511;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4282249392659873511;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4282249392659873511;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 15:32:59] [INFO ] Flatten gal took : 96 ms
[2025-06-06 15:32:59] [INFO ] Flatten gal took : 93 ms
[2025-06-06 15:32:59] [INFO ] Time to serialize gal into /tmp/LTL5749716312841530468.gal : 26 ms
[2025-06-06 15:32:59] [INFO ] Time to serialize properties into /tmp/LTL1228608914745936047.prop : 16 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/LTL5749716312841530468.gal' '-t' 'CGAL' '-hoa' '/tmp/aut245500094234308653.hoa' '-atoms' '/tmp/LTL1228608914745936047.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/LTL1228608914745936047.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut245500094234308653.hoa
Detected timeout of ITS tools.
[2025-06-06 15:33:14] [INFO ] Flatten gal took : 97 ms
[2025-06-06 15:33:14] [INFO ] Flatten gal took : 91 ms
[2025-06-06 15:33:14] [INFO ] Time to serialize gal into /tmp/LTL1471725554594051239.gal : 12 ms
[2025-06-06 15:33:14] [INFO ] Time to serialize properties into /tmp/LTL7762983357584320314.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1471725554594051239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7762983357584320314.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(X(X(F("((((((((((((((State_2_3==0)||(State_3_12==0))&&((State_3_14==0)||(State_4_4==0)))&&(((State_1_6==0)||(State_2_5==0))&&((...134979
Formula 0 simplified : XXXXG!"((((((((((((((State_2_3==0)||(State_3_12==0))&&((State_3_14==0)||(State_4_4==0)))&&(((State_1_6==0)||(State_2_5==0))&&((State...134967
Detected timeout of ITS tools.
[2025-06-06 15:33:30] [INFO ] Flatten gal took : 103 ms
[2025-06-06 15:33:30] [INFO ] Applying decomposition
[2025-06-06 15:33:30] [INFO ] Flatten gal took : 105 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/graph17254499961958214041.txt' '-o' '/tmp/graph17254499961958214041.bin' '-w' '/tmp/graph17254499961958214041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17254499961958214041.bin' '-l' '-1' '-v' '-w' '/tmp/graph17254499961958214041.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:33:30] [INFO ] Decomposing Gal with order
[2025-06-06 15:33:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:33:30] [INFO ] Removed a total of 8064 redundant transitions.
[2025-06-06 15:33:31] [INFO ] Flatten gal took : 365 ms
[2025-06-06 15:33:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 79 ms.
[2025-06-06 15:33:31] [INFO ] Time to serialize gal into /tmp/LTL9312084002847491652.gal : 29 ms
[2025-06-06 15:33:31] [INFO ] Time to serialize properties into /tmp/LTL9938695708751737023.ltl : 21 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/LTL9312084002847491652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9938695708751737023.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(X(X(F("((((((((((((((i13.i1.u63.State_2_3==0)||(i8.i1.u52.State_3_12==0))&&((i7.i0.u79.State_3_14==0)||(i2.i0.u46.State_4_4==0)...210609
Formula 0 simplified : XXXXG!"((((((((((((((i13.i1.u63.State_2_3==0)||(i8.i1.u52.State_3_12==0))&&((i7.i0.u79.State_3_14==0)||(i2.i0.u46.State_4_4==0)))&&(...210597
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-00 finished in 272257 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 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 51 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:33:47] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-06 15:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:33:47] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:33:48] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:33:48] [INFO ] Redundant transitions in 304 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:33:48] [INFO ] Invariant cache hit.
[2025-06-06 15:33:48] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:10] [INFO ] Deduced a trap composed of 129 places in 2330 ms of which 2010 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:11] [INFO ] Deduced a trap composed of 129 places in 392 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:19] [INFO ] Deduced a trap composed of 130 places in 8066 ms of which 7763 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:20] [INFO ] Deduced a trap composed of 129 places in 468 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:21] [INFO ] Deduced a trap composed of 130 places in 1145 ms of which 848 ms to minimize.
SMT process timed out in 32857ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32863ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34506 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-02
Product exploration explored 100000 steps with 2187 reset in 5251 ms.
Product exploration explored 100000 steps with 2181 reset in 5258 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 7586 ms. (5 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 7624 ms. (5 steps per ms) remains 1/1 properties
[2025-06-06 15:34:36] [INFO ] Invariant cache hit.
[2025-06-06 15:34:36] [INFO ] State equation strengthened by 3390 read => feed constraints.
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/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1901 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:40] [INFO ] Deduced a trap composed of 131 places in 378 ms of which 65 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 1/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:41] [INFO ] Deduced a trap composed of 129 places in 341 ms of which 39 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/3872 variables, 1/3920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:42] [INFO ] Deduced a trap composed of 129 places in 352 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:42] [INFO ] Deduced a trap composed of 132 places in 373 ms of which 54 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3872 variables, 2/3922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:43] [INFO ] Deduced a trap composed of 130 places in 325 ms of which 49 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3872 variables, 1/3923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5014 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6946ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 48 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 6974 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 7312 ms. (5 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 280326 steps, run timeout after 9001 ms. (steps per millisecond=31 ) properties seen :0 out of 1
Probabilistic random walk after 280326 steps, saw 49388 distinct states, run finished after 9006 ms. (steps per millisecond=31 ) properties seen :0
[2025-06-06 15:34:56] [INFO ] Invariant cache hit.
[2025-06-06 15:34:56] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1862 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:00] [INFO ] Deduced a trap composed of 131 places in 370 ms of which 66 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 1/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:01] [INFO ] Deduced a trap composed of 129 places in 360 ms of which 38 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/3872 variables, 1/3920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:02] [INFO ] Deduced a trap composed of 129 places in 377 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:02] [INFO ] Deduced a trap composed of 132 places in 322 ms of which 54 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3872 variables, 2/3922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:03] [INFO ] Deduced a trap composed of 130 places in 343 ms of which 48 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3872 variables, 1/3923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3872 variables, 0/3923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3872 variables, 0/3923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6272 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8163ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2784 ms.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 40 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 40 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:35:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:35:07] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 15:35:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:35:08] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:35:08] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:35:08] [INFO ] Redundant transitions in 158 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:35:08] [INFO ] Invariant cache hit.
[2025-06-06 15:35:08] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:32] [INFO ] Deduced a trap composed of 129 places in 2341 ms of which 1983 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:32] [INFO ] Deduced a trap composed of 129 places in 421 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:40] [INFO ] Deduced a trap composed of 130 places in 8020 ms of which 7740 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:41] [INFO ] Deduced a trap composed of 129 places in 446 ms of which 169 ms to minimize.
SMT process timed out in 32569ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32575ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33946 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 3110 transitions
Redundant transition composition rules discarded 3110 transitions
Iterating global reduction 0 with 3110 rules applied. Total rules applied 3110 place count 256 transition count 506
Applied a total of 3110 rules in 35 ms. Remains 256 /256 variables (removed 0) and now considering 506/3616 (removed 3110) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 256 cols
[2025-06-06 15:35:41] [INFO ] Computed 16 invariants in 7 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:35:41] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:35:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-06 15:35:41] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 15:35:41] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 15:35:41] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 671 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:35:55] [INFO ] Computed 16 invariants in 26 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:831)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
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-06 15:36:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 70 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:36:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:36:10] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 15:36:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:36:11] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:36:11] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:36:11] [INFO ] Redundant transitions in 163 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:36:11] [INFO ] Invariant cache hit.
[2025-06-06 15:36:11] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:36] [INFO ] Deduced a trap composed of 129 places in 2283 ms of which 2004 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:36] [INFO ] Deduced a trap composed of 129 places in 388 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:44] [INFO ] Deduced a trap composed of 130 places in 8126 ms of which 7852 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:45] [INFO ] Deduced a trap composed of 129 places in 500 ms of which 171 ms to minimize.
SMT process timed out in 33169ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33343ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34686 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 6239 ms. (6 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 6934 ms. (5 steps per ms) remains 1/1 properties
[2025-06-06 15:36:48] [INFO ] Invariant cache hit.
[2025-06-06 15:36:48] [INFO ] State equation strengthened by 3390 read => feed constraints.
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/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2013 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:52] [INFO ] Deduced a trap composed of 131 places in 383 ms of which 72 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 1/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:53] [INFO ] Deduced a trap composed of 129 places in 363 ms of which 39 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/3872 variables, 1/3920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:54] [INFO ] Deduced a trap composed of 129 places in 414 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:55] [INFO ] Deduced a trap composed of 132 places in 362 ms of which 55 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3872 variables, 2/3922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:55] [INFO ] Deduced a trap composed of 130 places in 312 ms of which 49 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5019 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7064ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 45 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 5805 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 6224 ms. (6 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 280102 steps, run timeout after 9001 ms. (steps per millisecond=31 ) properties seen :0 out of 1
Probabilistic random walk after 280102 steps, saw 49354 distinct states, run finished after 9001 ms. (steps per millisecond=31 ) properties seen :0
[2025-06-06 15:37:08] [INFO ] Invariant cache hit.
[2025-06-06 15:37:08] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1890 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:11] [INFO ] Deduced a trap composed of 131 places in 392 ms of which 66 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 1/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:12] [INFO ] Deduced a trap composed of 129 places in 356 ms of which 38 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/3872 variables, 1/3920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:13] [INFO ] Deduced a trap composed of 129 places in 363 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:14] [INFO ] Deduced a trap composed of 132 places in 387 ms of which 55 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3872 variables, 2/3922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:14] [INFO ] Deduced a trap composed of 130 places in 338 ms of which 47 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3872 variables, 1/3923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3872 variables, 0/3923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3872 variables, 0/3923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6134 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2706 ms.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 40 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 40 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:37:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 15:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:37:19] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:37:19] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:37:20] [INFO ] Redundant transitions in 163 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:37:20] [INFO ] Invariant cache hit.
[2025-06-06 15:37:20] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:43] [INFO ] Deduced a trap composed of 129 places in 2243 ms of which 1987 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:44] [INFO ] Deduced a trap composed of 129 places in 434 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:52] [INFO ] Deduced a trap composed of 130 places in 8108 ms of which 7775 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:52] [INFO ] Deduced a trap composed of 129 places in 478 ms of which 168 ms to minimize.
SMT process timed out in 32697ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33966 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 3110 transitions
Redundant transition composition rules discarded 3110 transitions
Iterating global reduction 0 with 3110 rules applied. Total rules applied 3110 place count 256 transition count 506
Applied a total of 3110 rules in 14 ms. Remains 256 /256 variables (removed 0) and now considering 506/3616 (removed 3110) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 256 cols
[2025-06-06 15:37:52] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:37:53] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:37:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-06 15:37:53] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 15:37:53] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 15:37:53] [INFO ] After 464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 698 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:38:09] [INFO ] Computed 16 invariants in 14 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2184 reset in 9617 ms.
Product exploration explored 100000 steps with 2178 reset in 9644 ms.
Built C files in :
/tmp/ltsmin17529055878913827960
[2025-06-06 15:38:43] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:38:43] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17529055878913827960
Running compilation step : cd /tmp/ltsmin17529055878913827960;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17529055878913827960;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17529055878913827960;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 46 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:38:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 15:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:38:47] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:38:47] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:38:48] [INFO ] Redundant transitions in 157 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:38:48] [INFO ] Invariant cache hit.
[2025-06-06 15:38:48] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:39:11] [INFO ] Deduced a trap composed of 129 places in 2247 ms of which 1992 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:39:11] [INFO ] Deduced a trap composed of 129 places in 382 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:39:19] [INFO ] Deduced a trap composed of 130 places in 7979 ms of which 7690 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:39:19] [INFO ] Deduced a trap composed of 129 places in 484 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:39:21] [INFO ] Deduced a trap composed of 130 places in 1122 ms of which 846 ms to minimize.
SMT process timed out in 32965ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32972ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34321 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin11580344924883407683
[2025-06-06 15:39:21] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:39:21] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11580344924883407683
Running compilation step : cd /tmp/ltsmin11580344924883407683;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11580344924883407683;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11580344924883407683;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 15:39:24] [INFO ] Flatten gal took : 82 ms
[2025-06-06 15:39:24] [INFO ] Flatten gal took : 86 ms
[2025-06-06 15:39:24] [INFO ] Time to serialize gal into /tmp/LTL16209740005486035083.gal : 12 ms
[2025-06-06 15:39:24] [INFO ] Time to serialize properties into /tmp/LTL7667757618659314550.prop : 7 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/LTL16209740005486035083.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13295756049127396277.hoa' '-atoms' '/tmp/LTL7667757618659314550.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7667757618659314550.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13295756049127396277.hoa
Detected timeout of ITS tools.
[2025-06-06 15:39:39] [INFO ] Flatten gal took : 94 ms
[2025-06-06 15:39:40] [INFO ] Flatten gal took : 101 ms
[2025-06-06 15:39:40] [INFO ] Time to serialize gal into /tmp/LTL9091173797155643687.gal : 12 ms
[2025-06-06 15:39:40] [INFO ] Time to serialize properties into /tmp/LTL7892042149763581211.ltl : 13 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/LTL9091173797155643687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7892042149763581211.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((((((State_15_7==1)&&(State_0_7==1))||((State_0_4==1)&&(State_15_4==1)))||(((State_15_0==1)&&(State_0_0==1))||((State_15_1...135581
Formula 0 simplified : G(F!"((((((State_15_7==1)&&(State_0_7==1))||((State_0_4==1)&&(State_15_4==1)))||(((State_15_0==1)&&(State_0_0==1))||((State_15_12==1...135574
Detected timeout of ITS tools.
[2025-06-06 15:39:55] [INFO ] Flatten gal took : 95 ms
[2025-06-06 15:39:55] [INFO ] Applying decomposition
[2025-06-06 15:39:55] [INFO ] Flatten gal took : 98 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/graph2788307796082569521.txt' '-o' '/tmp/graph2788307796082569521.bin' '-w' '/tmp/graph2788307796082569521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2788307796082569521.bin' '-l' '-1' '-v' '-w' '/tmp/graph2788307796082569521.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:39:55] [INFO ] Decomposing Gal with order
[2025-06-06 15:39:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:39:55] [INFO ] Removed a total of 8036 redundant transitions.
[2025-06-06 15:39:55] [INFO ] Flatten gal took : 180 ms
[2025-06-06 15:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 37 ms.
[2025-06-06 15:39:56] [INFO ] Time to serialize gal into /tmp/LTL3077036284606940274.gal : 15 ms
[2025-06-06 15:39:56] [INFO ] Time to serialize properties into /tmp/LTL3705914290742137739.ltl : 13 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/LTL3077036284606940274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3705914290742137739.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 : !((G(F((G("((((((i0.i5.u30.State_15_7==1)&&(i4.i1.u37.State_0_7==1))||((i6.i0.u8.State_0_4==1)&&(i0.i11.u45.State_15_4==1)))||(((i0.i8...207741
Formula 0 simplified : G(F!"((((((i0.i5.u30.State_15_7==1)&&(i4.i1.u37.State_0_7==1))||((i6.i0.u8.State_0_4==1)&&(i0.i11.u45.State_15_4==1)))||(((i0.i8.u31...207734
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-02 finished in 384486 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 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 55 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:40:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:40:11] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 15:40:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:40:12] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:40:12] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:40:12] [INFO ] Redundant transitions in 162 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:40:12] [INFO ] Invariant cache hit.
[2025-06-06 15:40:12] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:40:36] [INFO ] Deduced a trap composed of 129 places in 2292 ms of which 2008 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:40:36] [INFO ] Deduced a trap composed of 129 places in 411 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:40:44] [INFO ] Deduced a trap composed of 130 places in 8173 ms of which 7864 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:40:45] [INFO ] Deduced a trap composed of 129 places in 475 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:40:46] [INFO ] Deduced a trap composed of 130 places in 1114 ms of which 843 ms to minimize.
SMT process timed out in 33437ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33445ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34770 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-03
Product exploration explored 100000 steps with 2194 reset in 5034 ms.
Product exploration explored 100000 steps with 2187 reset in 5035 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 182 steps (0 resets) in 38 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2025-06-06 15:41:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p0)
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 49 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:41:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 15:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:41:25] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:41:26] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:41:26] [INFO ] Redundant transitions in 156 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:41:26] [INFO ] Invariant cache hit.
[2025-06-06 15:41:26] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:41:51] [INFO ] Deduced a trap composed of 129 places in 2325 ms of which 1989 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:41:51] [INFO ] Deduced a trap composed of 129 places in 414 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:41:59] [INFO ] Deduced a trap composed of 130 places in 8050 ms of which 7761 ms to minimize.
SMT process timed out in 33234ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34470 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 158 steps (0 resets) in 26 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2025-06-06 15:42:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2184 reset in 5146 ms.
Product exploration explored 100000 steps with 2189 reset in 5123 ms.
Built C files in :
/tmp/ltsmin10464256307549644099
[2025-06-06 15:42:39] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:42:39] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10464256307549644099
Running compilation step : cd /tmp/ltsmin10464256307549644099;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10464256307549644099;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10464256307549644099;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 51 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:42:42] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-06 15:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:42:43] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:42:43] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:42:43] [INFO ] Redundant transitions in 160 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:42:43] [INFO ] Invariant cache hit.
[2025-06-06 15:42:43] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:43:08] [INFO ] Deduced a trap composed of 129 places in 2354 ms of which 2067 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:43:08] [INFO ] Deduced a trap composed of 129 places in 398 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:43:16] [INFO ] Deduced a trap composed of 130 places in 8466 ms of which 8171 ms to minimize.
SMT process timed out in 33248ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33255ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34587 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin9249525863258765546
[2025-06-06 15:43:16] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:43:16] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9249525863258765546
Running compilation step : cd /tmp/ltsmin9249525863258765546;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9249525863258765546;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9249525863258765546;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 15:43:20] [INFO ] Flatten gal took : 73 ms
[2025-06-06 15:43:20] [INFO ] Flatten gal took : 77 ms
[2025-06-06 15:43:20] [INFO ] Time to serialize gal into /tmp/LTL14657706535865521689.gal : 11 ms
[2025-06-06 15:43:20] [INFO ] Time to serialize properties into /tmp/LTL1925941334733377794.prop : 6 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/LTL14657706535865521689.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6567547516812806219.hoa' '-atoms' '/tmp/LTL1925941334733377794.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/LTL1925941334733377794.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6567547516812806219.hoa
Detected timeout of ITS tools.
[2025-06-06 15:43:35] [INFO ] Flatten gal took : 106 ms
[2025-06-06 15:43:35] [INFO ] Flatten gal took : 97 ms
[2025-06-06 15:43:35] [INFO ] Time to serialize gal into /tmp/LTL3571783889873141415.gal : 11 ms
[2025-06-06 15:43:35] [INFO ] Time to serialize properties into /tmp/LTL18320707893265510824.ltl : 9 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/LTL3571783889873141415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18320707893265510824.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((((State_2_3==0)||(State_3_12==0))&&((State_3_14==0)||(State_4_4==0)))&&(((State_1_6==0)||(State_2_5==0))&&((State_...134970
Formula 0 simplified : FG!"((((((((((((((State_2_3==0)||(State_3_12==0))&&((State_3_14==0)||(State_4_4==0)))&&(((State_1_6==0)||(State_2_5==0))&&((State_4_...134964
Detected timeout of ITS tools.
[2025-06-06 15:43:51] [INFO ] Flatten gal took : 91 ms
[2025-06-06 15:43:51] [INFO ] Applying decomposition
[2025-06-06 15:43:51] [INFO ] Flatten gal took : 93 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/graph12134493262383601961.txt' '-o' '/tmp/graph12134493262383601961.bin' '-w' '/tmp/graph12134493262383601961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12134493262383601961.bin' '-l' '-1' '-v' '-w' '/tmp/graph12134493262383601961.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:43:51] [INFO ] Decomposing Gal with order
[2025-06-06 15:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:43:51] [INFO ] Removed a total of 8050 redundant transitions.
[2025-06-06 15:43:51] [INFO ] Flatten gal took : 146 ms
[2025-06-06 15:43:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 38 ms.
[2025-06-06 15:43:51] [INFO ] Time to serialize gal into /tmp/LTL3610918483317998608.gal : 15 ms
[2025-06-06 15:43:51] [INFO ] Time to serialize properties into /tmp/LTL16005747705658436075.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3610918483317998608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16005747705658436075.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 : !((G(F("((((((((((((((i4.u54.State_2_3==0)||(i4.u55.State_3_12==0))&&((i4.u75.State_3_14==0)||(i4.u84.State_4_4==0)))&&(((i4.u66.State...197715
Formula 0 simplified : FG!"((((((((((((((i4.u54.State_2_3==0)||(i4.u55.State_3_12==0))&&((i4.u75.State_3_14==0)||(i4.u84.State_4_4==0)))&&(((i4.u66.State_1...197709
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-03 finished in 235457 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 X(X((p1 U p0)))))'
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:44:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:44:07] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 15:44:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:44:07] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:44:08] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:44:08] [INFO ] Invariant cache hit.
[2025-06-06 15:44:08] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:44:31] [INFO ] Deduced a trap composed of 129 places in 2319 ms of which 1992 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:44:32] [INFO ] Deduced a trap composed of 129 places in 381 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:44:40] [INFO ] Deduced a trap composed of 130 places in 8029 ms of which 7722 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:44:40] [INFO ] Deduced a trap composed of 129 places in 487 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:44:41] [INFO ] Deduced a trap composed of 130 places in 1150 ms of which 860 ms to minimize.
SMT process timed out in 33816ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33824ms
Finished structural reductions in LTL mode , in 1 iterations and 34988 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-04
Product exploration explored 100000 steps with 2184 reset in 9208 ms.
Product exploration explored 100000 steps with 2182 reset in 9203 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 6645 ms. (6 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5810 ms. (6 steps per ms) remains 1/1 properties
[2025-06-06 15:45:04] [INFO ] Invariant cache hit.
[2025-06-06 15:45:04] [INFO ] State equation strengthened by 3390 read => feed constraints.
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/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2295 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 256/3872 variables, and 272 constraints, problems are : Problem set: 1 solved, 0 unsolved in 282 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/256 constraints, ReadFeed: 0/3390 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2611ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 15:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:45:09] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-06 15:45:10] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2025-06-06 15:45:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:45:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2025-06-06 15:45:12] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2025-06-06 15:45:12] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:45:13] [INFO ] [Nat]Added 3390 Read/Feed constraints in 758 ms returned sat
[2025-06-06 15:45:14] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 346 ms.
[2025-06-06 15:45:14] [INFO ] Added : 2 causal constraints over 1 iterations in 762 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 32 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:45:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 15:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:45:15] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:45:15] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:45:15] [INFO ] Invariant cache hit.
[2025-06-06 15:45:15] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:45:39] [INFO ] Deduced a trap composed of 129 places in 2305 ms of which 1997 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:45:39] [INFO ] Deduced a trap composed of 129 places in 420 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:45:47] [INFO ] Deduced a trap composed of 130 places in 8020 ms of which 7716 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:45:48] [INFO ] Deduced a trap composed of 129 places in 450 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:45:49] [INFO ] Deduced a trap composed of 130 places in 1142 ms of which 848 ms to minimize.
SMT process timed out in 33589ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33596ms
Finished structural reductions in LTL mode , in 1 iterations and 34742 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 188 steps (0 resets) in 8 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 15:45:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:45:51] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2025-06-06 15:45:52] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2025-06-06 15:45:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:45:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2025-06-06 15:45:55] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2025-06-06 15:45:55] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:45:55] [INFO ] [Nat]Added 3390 Read/Feed constraints in 759 ms returned sat
[2025-06-06 15:45:56] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 247 ms.
[2025-06-06 15:45:56] [INFO ] Added : 2 causal constraints over 1 iterations in 665 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2183 reset in 618 ms.
Product exploration explored 100000 steps with 2184 reset in 620 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 131 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:45:58] [INFO ] Redundant transitions in 158 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:45:58] [INFO ] Invariant cache hit.
[2025-06-06 15:45:58] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:46:22] [INFO ] Deduced a trap composed of 129 places in 2275 ms of which 1985 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:46:22] [INFO ] Deduced a trap composed of 129 places in 401 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:46:30] [INFO ] Deduced a trap composed of 130 places in 8221 ms of which 7913 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:46:31] [INFO ] Deduced a trap composed of 129 places in 473 ms of which 173 ms to minimize.
SMT process timed out in 32828ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32836ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33142 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin959786054206477546
[2025-06-06 15:46:31] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin959786054206477546
Running compilation step : cd /tmp/ltsmin959786054206477546;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin959786054206477546;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin959786054206477546;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 32 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 28 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:46:34] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-06-06 15:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:46:35] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:46:46] [INFO ] Implicit Places using invariants and state equation in 11740 ms returned []
Implicit Place search using SMT with State Equation took 12098 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:46:46] [INFO ] Invariant cache hit.
[2025-06-06 15:46:46] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:47:10] [INFO ] Deduced a trap composed of 129 places in 2281 ms of which 2018 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:47:10] [INFO ] Deduced a trap composed of 129 places in 377 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:47:18] [INFO ] Deduced a trap composed of 130 places in 8044 ms of which 7754 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:47:19] [INFO ] Deduced a trap composed of 129 places in 448 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:47:20] [INFO ] Deduced a trap composed of 130 places in 1128 ms of which 859 ms to minimize.
SMT process timed out in 33596ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33602ms
Finished structural reductions in LTL mode , in 1 iterations and 45740 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin3013224902202708736
[2025-06-06 15:47:20] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3013224902202708736
Running compilation step : cd /tmp/ltsmin3013224902202708736;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3013224902202708736;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3013224902202708736;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 15:47:23] [INFO ] Flatten gal took : 63 ms
[2025-06-06 15:47:23] [INFO ] Flatten gal took : 66 ms
[2025-06-06 15:47:23] [INFO ] Time to serialize gal into /tmp/LTL14257640643371831294.gal : 12 ms
[2025-06-06 15:47:23] [INFO ] Time to serialize properties into /tmp/LTL299376407905031269.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/LTL14257640643371831294.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4297628761984401283.hoa' '-atoms' '/tmp/LTL299376407905031269.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL299376407905031269.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4297628761984401283.hoa
Detected timeout of ITS tools.
[2025-06-06 15:47:38] [INFO ] Flatten gal took : 81 ms
[2025-06-06 15:47:38] [INFO ] Flatten gal took : 85 ms
[2025-06-06 15:47:38] [INFO ] Time to serialize gal into /tmp/LTL7126925846470702552.gal : 11 ms
[2025-06-06 15:47:38] [INFO ] Time to serialize properties into /tmp/LTL2418189179377339127.ltl : 11 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/LTL7126925846470702552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2418189179377339127.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 : !((("((((((State_15_7==1)&&(State_0_7==1))||((State_0_4==1)&&(State_15_4==1)))||(((State_15_0==1)&&(State_0_0==1))||((State_15_12==1)&...136184
Formula 0 simplified : !"((((((State_15_7==1)&&(State_0_7==1))||((State_0_4==1)&&(State_15_4==1)))||(((State_15_0==1)&&(State_0_0==1))||((State_15_12==1)&&...136178
Detected timeout of ITS tools.
[2025-06-06 15:47:54] [INFO ] Flatten gal took : 84 ms
[2025-06-06 15:47:54] [INFO ] Applying decomposition
[2025-06-06 15:47:54] [INFO ] Flatten gal took : 89 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/graph14635540397693577195.txt' '-o' '/tmp/graph14635540397693577195.bin' '-w' '/tmp/graph14635540397693577195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14635540397693577195.bin' '-l' '-1' '-v' '-w' '/tmp/graph14635540397693577195.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:47:54] [INFO ] Decomposing Gal with order
[2025-06-06 15:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:47:54] [INFO ] Removed a total of 8092 redundant transitions.
[2025-06-06 15:47:54] [INFO ] Flatten gal took : 157 ms
[2025-06-06 15:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 16 ms.
[2025-06-06 15:47:55] [INFO ] Time to serialize gal into /tmp/LTL4613121103402650172.gal : 12 ms
[2025-06-06 15:47:55] [INFO ] Time to serialize properties into /tmp/LTL5050078413059299382.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4613121103402650172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5050078413059299382.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 : !((("((((((i8.i7.u10.State_15_7==1)&&(i0.i1.u38.State_0_7==1))||((i6.i1.u8.State_0_4==1)&&(i8.i6.u47.State_15_4==1)))||(((i8.i10.u70.S...211968
Formula 0 simplified : !"((((((i8.i7.u10.State_15_7==1)&&(i0.i1.u38.State_0_7==1))||((i6.i1.u8.State_0_4==1)&&(i8.i6.u47.State_15_4==1)))||(((i8.i10.u70.St...211962
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-04 finished in 243376 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)||(X(X(X(p0)))&&p1))))'
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:48:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:48:10] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 15:48:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:48:10] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:48:11] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:48:11] [INFO ] Invariant cache hit.
[2025-06-06 15:48:11] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:48:34] [INFO ] Deduced a trap composed of 129 places in 2293 ms of which 1994 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:48:35] [INFO ] Deduced a trap composed of 129 places in 411 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:48:43] [INFO ] Deduced a trap composed of 130 places in 8142 ms of which 7842 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:48:43] [INFO ] Deduced a trap composed of 129 places in 441 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:48:45] [INFO ] Deduced a trap composed of 130 places in 1159 ms of which 850 ms to minimize.
SMT process timed out in 33773ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33780ms
Finished structural reductions in LTL mode , in 1 iterations and 34832 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 801 ms.
Product exploration explored 100000 steps with 33333 reset in 943 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TokenRing-PT-015-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TokenRing-PT-015-LTLFireability-06 finished in 36885 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(X(F((!p0 U (p1||G(!p0))))))))'
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 28 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:48:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:48:47] [INFO ] Implicit Places using invariants in 358 ms returned []
[2025-06-06 15:48:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:48:48] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:49:00] [INFO ] Implicit Places using invariants and state equation in 13148 ms returned []
Implicit Place search using SMT with State Equation took 13510 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:49:00] [INFO ] Invariant cache hit.
[2025-06-06 15:49:00] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:49:24] [INFO ] Deduced a trap composed of 129 places in 2331 ms of which 2020 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:49:24] [INFO ] Deduced a trap composed of 129 places in 425 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:49:32] [INFO ] Deduced a trap composed of 130 places in 8242 ms of which 7918 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:49:33] [INFO ] Deduced a trap composed of 129 places in 485 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:49:34] [INFO ] Deduced a trap composed of 130 places in 1179 ms of which 853 ms to minimize.
SMT process timed out in 33924ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33929ms
Finished structural reductions in LTL mode , in 1 iterations and 47473 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 558 ms.
Stack based approach found an accepted trace after 294 steps with 0 reset with depth 295 and stack size 295 in 2 ms.
FORMULA TokenRing-PT-015-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-015-LTLFireability-09 finished in 48231 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||(p0 U (p1 U p2))||X(X(G(p3)))))))'
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 26 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:49:35] [INFO ] Implicit Places using invariants in 483 ms returned []
[2025-06-06 15:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:49:36] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:49:45] [INFO ] Implicit Places using invariants and state equation in 9994 ms returned []
Implicit Place search using SMT with State Equation took 10487 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:49:45] [INFO ] Invariant cache hit.
[2025-06-06 15:49:45] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:50:09] [INFO ] Deduced a trap composed of 129 places in 2273 ms of which 2004 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:50:09] [INFO ] Deduced a trap composed of 129 places in 374 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:50:18] [INFO ] Deduced a trap composed of 130 places in 8144 ms of which 7876 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:50:18] [INFO ] Deduced a trap composed of 129 places in 457 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:50:19] [INFO ] Deduced a trap composed of 130 places in 1138 ms of which 855 ms to minimize.
SMT process timed out in 33843ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33849ms
Finished structural reductions in LTL mode , in 1 iterations and 44374 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 514 ms.
Product exploration explored 100000 steps with 0 reset in 708 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (NOT (OR p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 102 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 578 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 471 ms. (84 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 100971 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 1
Probabilistic random walk after 100971 steps, saw 20090 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2025-06-06 15:50:25] [INFO ] Invariant cache hit.
[2025-06-06 15:50:25] [INFO ] State equation strengthened by 3390 read => feed constraints.
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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 450/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 240/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5013 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 450/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 240/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4722 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9775ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 364 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 63 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 694 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 441 ms. (90 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 102113 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 102113 steps, saw 20277 distinct states, run finished after 3005 ms. (steps per millisecond=33 ) properties seen :0
[2025-06-06 15:50:38] [INFO ] Invariant cache hit.
[2025-06-06 15:50:38] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 450/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 240/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5400 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 450/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 240/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4634 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10079ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 326 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 60 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 57 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:50:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:50:49] [INFO ] Implicit Places using invariants in 397 ms returned []
[2025-06-06 15:50:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:50:50] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:51:00] [INFO ] Implicit Places using invariants and state equation in 10801 ms returned []
Implicit Place search using SMT with State Equation took 11220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:51:00] [INFO ] Redundant transitions in 157 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:51:00] [INFO ] Invariant cache hit.
[2025-06-06 15:51:00] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:51:24] [INFO ] Deduced a trap composed of 129 places in 2290 ms of which 2016 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:51:24] [INFO ] Deduced a trap composed of 129 places in 407 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:51:32] [INFO ] Deduced a trap composed of 130 places in 8041 ms of which 7749 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:51:33] [INFO ] Deduced a trap composed of 129 places in 466 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:51:34] [INFO ] Deduced a trap composed of 130 places in 1142 ms of which 846 ms to minimize.
SMT process timed out in 33877ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33882ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45332 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3556 edges and 256 vertex of which 254 / 256 are part of one of the 16 SCC in 3 ms
Free SCC test removed 238 places
Drop transitions (Empty/Sink Transition effects.) removed 3556 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 3612 transitions.
Graph (complete) has 4 edges and 18 vertex of which 4 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 14 ms. Remains 4 /256 variables (removed 252) and now considering 4/3616 (removed 3612) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2025-06-06 15:51:34] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:51:34] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:51:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 15:51:34] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 15:51:34] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 15:51:34] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 65 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (NOT (OR p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 2 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 22 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:51:34] [INFO ] Computed 16 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:51:35] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-06 15:51:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:51:35] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:51:45] [INFO ] Implicit Places using invariants and state equation in 10691 ms returned []
Implicit Place search using SMT with State Equation took 11036 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:51:45] [INFO ] Invariant cache hit.
[2025-06-06 15:51:45] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:52:09] [INFO ] Deduced a trap composed of 129 places in 2287 ms of which 2001 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:52:10] [INFO ] Deduced a trap composed of 129 places in 403 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:52:18] [INFO ] Deduced a trap composed of 130 places in 8415 ms of which 8112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:52:19] [INFO ] Deduced a trap composed of 129 places in 477 ms of which 171 ms to minimize.
SMT process timed out in 33377ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33381ms
Finished structural reductions in LTL mode , in 1 iterations and 44446 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p3]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 330 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 101476 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 1
Probabilistic random walk after 101476 steps, saw 20169 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2025-06-06 15:52:22] [INFO ] Invariant cache hit.
[2025-06-06 15:52:22] [INFO ] State equation strengthened by 3390 read => feed constraints.
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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 450/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 240/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5018 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 450/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 240/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4751 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9805ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 340 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 58 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 444 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 436 ms. (91 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 100431 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 1
Probabilistic random walk after 100431 steps, saw 20007 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2025-06-06 15:52:36] [INFO ] Invariant cache hit.
[2025-06-06 15:52:36] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 450/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 240/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5419 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 450/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 240/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4646 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10107ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 352 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 68 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 59 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:52:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:52:47] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-06 15:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:52:47] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:52:58] [INFO ] Implicit Places using invariants and state equation in 11756 ms returned []
Implicit Place search using SMT with State Equation took 12121 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:52:59] [INFO ] Redundant transitions in 159 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:52:59] [INFO ] Invariant cache hit.
[2025-06-06 15:52:59] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:53:24] [INFO ] Deduced a trap composed of 129 places in 2354 ms of which 2058 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:53:25] [INFO ] Deduced a trap composed of 129 places in 406 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:53:33] [INFO ] Deduced a trap composed of 130 places in 8305 ms of which 8003 ms to minimize.
SMT process timed out in 34439ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46799 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3556 edges and 256 vertex of which 254 / 256 are part of one of the 16 SCC in 1 ms
Free SCC test removed 238 places
Drop transitions (Empty/Sink Transition effects.) removed 3556 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 3612 transitions.
Graph (complete) has 4 edges and 18 vertex of which 4 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 5 ms. Remains 4 /256 variables (removed 252) and now considering 4/3616 (removed 3612) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2025-06-06 15:53:33] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:53:33] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:53:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 15:53:33] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 15:53:33] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 15:53:33] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 61 ms.
Knowledge obtained : [p3]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 467 ms.
Product exploration explored 100000 steps with 0 reset in 511 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 65 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:53:35] [INFO ] Redundant transitions in 165 ms returned []
Running 3601 sub problems to find dead transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:53:35] [INFO ] Computed 16 invariants in 14 ms
[2025-06-06 15:53:35] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:54:01] [INFO ] Deduced a trap composed of 129 places in 2425 ms of which 2109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:54:02] [INFO ] Deduced a trap composed of 129 places in 406 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:54:11] [INFO ] Deduced a trap composed of 130 places in 8913 ms of which 8593 ms to minimize.
SMT process timed out in 35432ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 35438ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35681 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin12373758525707822568
[2025-06-06 15:54:11] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12373758525707822568
Running compilation step : cd /tmp/ltsmin12373758525707822568;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12373758525707822568;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12373758525707822568;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 21 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:54:14] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-06 15:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:54:15] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:54:26] [INFO ] Implicit Places using invariants and state equation in 11980 ms returned []
Implicit Place search using SMT with State Equation took 12344 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:54:26] [INFO ] Invariant cache hit.
[2025-06-06 15:54:26] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:54:51] [INFO ] Deduced a trap composed of 129 places in 2332 ms of which 2026 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:54:51] [INFO ] Deduced a trap composed of 129 places in 408 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:55:00] [INFO ] Deduced a trap composed of 130 places in 8157 ms of which 7837 ms to minimize.
SMT process timed out in 33339ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33346ms
Finished structural reductions in LTL mode , in 1 iterations and 45723 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin7101839813925821929
[2025-06-06 15:55:00] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7101839813925821929
Running compilation step : cd /tmp/ltsmin7101839813925821929;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7101839813925821929;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7101839813925821929;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 15:55:03] [INFO ] Flatten gal took : 60 ms
[2025-06-06 15:55:03] [INFO ] Flatten gal took : 62 ms
[2025-06-06 15:55:03] [INFO ] Time to serialize gal into /tmp/LTL6399510689688085623.gal : 10 ms
[2025-06-06 15:55:03] [INFO ] Time to serialize properties into /tmp/LTL791225652040739673.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/LTL6399510689688085623.gal' '-t' 'CGAL' '-hoa' '/tmp/aut736515350395740910.hoa' '-atoms' '/tmp/LTL791225652040739673.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...315
Loading property file /tmp/LTL791225652040739673.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut736515350395740910.hoa
Detected timeout of ITS tools.
[2025-06-06 15:55:18] [INFO ] Flatten gal took : 69 ms
[2025-06-06 15:55:18] [INFO ] Flatten gal took : 70 ms
[2025-06-06 15:55:18] [INFO ] Time to serialize gal into /tmp/LTL9672503421590663166.gal : 11 ms
[2025-06-06 15:55:18] [INFO ] Time to serialize properties into /tmp/LTL15631851717642191061.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/LTL9672503421590663166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15631851717642191061.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(((("((State_0_15==1)&&(State_15_15==1))")U(("((State_14_5==1)&&(State_15_9==1))")U("((State_3_11==1)&&(State_2_14==1))")))||(X(...245
Formula 0 simplified : XF(!"((State_0_15==1)&&(State_15_15==1))" & (!"((State_0_15==1)&&(State_15_15==1))" R (!"((State_14_5==1)&&(State_15_9==1))" R !"((S...233
Detected timeout of ITS tools.
[2025-06-06 15:55:33] [INFO ] Flatten gal took : 68 ms
[2025-06-06 15:55:33] [INFO ] Applying decomposition
[2025-06-06 15:55:33] [INFO ] Flatten gal took : 70 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/graph16722320281395280557.txt' '-o' '/tmp/graph16722320281395280557.bin' '-w' '/tmp/graph16722320281395280557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16722320281395280557.bin' '-l' '-1' '-v' '-w' '/tmp/graph16722320281395280557.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:55:34] [INFO ] Decomposing Gal with order
[2025-06-06 15:55:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:55:34] [INFO ] Removed a total of 8078 redundant transitions.
[2025-06-06 15:55:34] [INFO ] Flatten gal took : 111 ms
[2025-06-06 15:55:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 25 ms.
[2025-06-06 15:55:34] [INFO ] Time to serialize gal into /tmp/LTL12489918219046867454.gal : 13 ms
[2025-06-06 15:55:34] [INFO ] Time to serialize properties into /tmp/LTL4010047892445002401.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/LTL12489918219046867454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4010047892445002401.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(((("((i0.i11.u90.State_0_15==1)&&(i2.i12.u109.State_15_15==1))")U(("((i2.i11.u47.State_14_5==1)&&(i2.i9.u79.State_15_9==1))")U(...346
Formula 0 simplified : XF(!"((i0.i11.u90.State_0_15==1)&&(i2.i12.u109.State_15_15==1))" & (!"((i0.i11.u90.State_0_15==1)&&(i2.i12.u109.State_15_15==1))" R ...334
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-10 finished in 374049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&X(X(p2))))'
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 36 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:55:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:55:49] [INFO ] Implicit Places using invariants in 420 ms returned []
[2025-06-06 15:55:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:55:50] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:56:02] [INFO ] Implicit Places using invariants and state equation in 12373 ms returned []
Implicit Place search using SMT with State Equation took 12805 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:56:02] [INFO ] Invariant cache hit.
[2025-06-06 15:56:02] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:56:25] [INFO ] Deduced a trap composed of 129 places in 2315 ms of which 2024 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:56:26] [INFO ] Deduced a trap composed of 129 places in 416 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:56:34] [INFO ] Deduced a trap composed of 130 places in 8102 ms of which 7800 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:56:34] [INFO ] Deduced a trap composed of 129 places in 454 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:56:35] [INFO ] Deduced a trap composed of 130 places in 1153 ms of which 851 ms to minimize.
SMT process timed out in 33593ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33599ms
Finished structural reductions in LTL mode , in 1 iterations and 46449 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA TokenRing-PT-015-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-015-LTLFireability-11 finished in 46687 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(F((G(F(p0))||(!p1&&F(p0)))))||(F((G(F(p0))||(!p1&&F(p0))))&&(X(!p0) U ((X(!p0)&&G(p2))||X(G(!p0))))))))'
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 27 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:56:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:56:36] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-06 15:56:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:56:37] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:56:48] [INFO ] Implicit Places using invariants and state equation in 11947 ms returned []
Implicit Place search using SMT with State Equation took 12311 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:56:48] [INFO ] Invariant cache hit.
[2025-06-06 15:56:48] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:57:12] [INFO ] Deduced a trap composed of 129 places in 2385 ms of which 2057 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:57:13] [INFO ] Deduced a trap composed of 129 places in 410 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:57:21] [INFO ] Deduced a trap composed of 130 places in 8401 ms of which 8092 ms to minimize.
SMT process timed out in 33100ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33106ms
Finished structural reductions in LTL mode , in 1 iterations and 45456 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0), false, false, false, (NOT p0), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-12
Product exploration explored 100000 steps with 3 reset in 544 ms.
Stack based approach found an accepted trace after 306 steps with 0 reset with depth 307 and stack size 307 in 2 ms.
FORMULA TokenRing-PT-015-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-015-LTLFireability-12 finished in 46370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 69 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:57:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:57:22] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-06-06 15:57:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:57:23] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:57:36] [INFO ] Implicit Places using invariants and state equation in 13131 ms returned []
Implicit Place search using SMT with State Equation took 13495 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:57:36] [INFO ] Redundant transitions in 157 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:57:36] [INFO ] Invariant cache hit.
[2025-06-06 15:57:36] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:00] [INFO ] Deduced a trap composed of 129 places in 2297 ms of which 2011 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:00] [INFO ] Deduced a trap composed of 129 places in 386 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:08] [INFO ] Deduced a trap composed of 130 places in 8075 ms of which 7810 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:09] [INFO ] Deduced a trap composed of 129 places in 473 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:10] [INFO ] Deduced a trap composed of 130 places in 1128 ms of which 848 ms to minimize.
SMT process timed out in 33958ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33964ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47696 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 479 ms.
Stack based approach found an accepted trace after 302 steps with 0 reset with depth 303 and stack size 303 in 2 ms.
FORMULA TokenRing-PT-015-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-015-LTLFireability-13 finished in 48241 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((X((p0 U X(p1)))&&F(p2)&&F(p3))))'
Support contains 8 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 21 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:58:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:58:11] [INFO ] Implicit Places using invariants in 358 ms returned []
[2025-06-06 15:58:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:58:11] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:58:21] [INFO ] Implicit Places using invariants and state equation in 10486 ms returned []
Implicit Place search using SMT with State Equation took 10854 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:58:21] [INFO ] Invariant cache hit.
[2025-06-06 15:58:21] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:45] [INFO ] Deduced a trap composed of 129 places in 2283 ms of which 2005 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:45] [INFO ] Deduced a trap composed of 129 places in 383 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:53] [INFO ] Deduced a trap composed of 130 places in 8065 ms of which 7777 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:54] [INFO ] Deduced a trap composed of 129 places in 459 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:58:55] [INFO ] Deduced a trap composed of 130 places in 1168 ms of which 850 ms to minimize.
SMT process timed out in 33976ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33980ms
Finished structural reductions in LTL mode , in 1 iterations and 44881 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (NOT p2), (NOT p3), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-14
Product exploration explored 100000 steps with 414 reset in 571 ms.
Stack based approach found an accepted trace after 1719 steps with 8 reset with depth 294 and stack size 294 in 11 ms.
FORMULA TokenRing-PT-015-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-015-LTLFireability-14 finished in 45767 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 p1) U X(X(G((F(p2) U p3)))))))'
Support contains 8 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 21 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:58:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:58:57] [INFO ] Implicit Places using invariants in 452 ms returned []
[2025-06-06 15:58:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:58:57] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:59:08] [INFO ] Implicit Places using invariants and state equation in 11933 ms returned []
Implicit Place search using SMT with State Equation took 12406 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:59:08] [INFO ] Invariant cache hit.
[2025-06-06 15:59:09] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:59:32] [INFO ] Deduced a trap composed of 129 places in 2325 ms of which 2033 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:59:33] [INFO ] Deduced a trap composed of 129 places in 418 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:59:41] [INFO ] Deduced a trap composed of 130 places in 8041 ms of which 7760 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:59:41] [INFO ] Deduced a trap composed of 129 places in 464 ms of which 170 ms to minimize.
SMT process timed out in 32973ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32977ms
Finished structural reductions in LTL mode , in 1 iterations and 45421 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 974 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (NOT p2), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-15
Product exploration explored 100000 steps with 486 reset in 438 ms.
Product exploration explored 100000 steps with 485 reset in 478 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 120 ms. Reduced automaton from 20 states, 52 edges and 4 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 1/1 properties
[2025-06-06 15:59:44] [INFO ] Invariant cache hit.
[2025-06-06 15:59:44] [INFO ] State equation strengthened by 3390 read => feed constraints.
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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 240/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 450/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5012 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 240/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 450/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4149 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9185ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 322 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 58 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 385 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30231 steps (6 resets) in 277 ms. (108 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p3) (NOT p2)))), (F p3)]
Knowledge based reduction with 15 factoid took 195 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 277 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
[2025-06-06 15:59:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:59:56] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 15:59:57] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2025-06-06 15:59:57] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:59:57] [INFO ] [Real]Added 3390 Read/Feed constraints in 620 ms returned sat
[2025-06-06 15:59:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:59:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 16:00:00] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2025-06-06 16:00:00] [INFO ] [Nat]Added 3390 Read/Feed constraints in 672 ms returned sat
[2025-06-06 16:00:01] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 275 ms.
[2025-06-06 16:00:01] [INFO ] Added : 2 causal constraints over 1 iterations in 701 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 29 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:00:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:00:02] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-06 16:00:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:00:02] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:00:14] [INFO ] Implicit Places using invariants and state equation in 12250 ms returned []
Implicit Place search using SMT with State Equation took 12621 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:00:14] [INFO ] Invariant cache hit.
[2025-06-06 16:00:14] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:00:38] [INFO ] Deduced a trap composed of 129 places in 2318 ms of which 2006 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:00:38] [INFO ] Deduced a trap composed of 129 places in 391 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:00:46] [INFO ] Deduced a trap composed of 130 places in 8025 ms of which 7741 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:00:47] [INFO ] Deduced a trap composed of 129 places in 481 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:00:48] [INFO ] Deduced a trap composed of 130 places in 1162 ms of which 849 ms to minimize.
SMT process timed out in 33848ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33854ms
Finished structural reductions in LTL mode , in 1 iterations and 46514 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
RANDOM walk for 33355 steps (7 resets) in 303 ms. (109 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 278 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
[2025-06-06 16:00:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:00:51] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 16:00:51] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2025-06-06 16:00:51] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:00:52] [INFO ] [Real]Added 3390 Read/Feed constraints in 576 ms returned sat
[2025-06-06 16:00:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:00:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-06 16:00:54] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2025-06-06 16:00:55] [INFO ] [Nat]Added 3390 Read/Feed constraints in 646 ms returned sat
[2025-06-06 16:00:55] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 249 ms.
[2025-06-06 16:00:55] [INFO ] Added : 2 causal constraints over 1 iterations in 616 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 271 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 486 reset in 444 ms.
Product exploration explored 100000 steps with 485 reset in 498 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 269 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 79 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:00:57] [INFO ] Redundant transitions in 156 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:00:57] [INFO ] Invariant cache hit.
[2025-06-06 16:00:57] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:01:21] [INFO ] Deduced a trap composed of 129 places in 2335 ms of which 2017 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:01:21] [INFO ] Deduced a trap composed of 129 places in 430 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:01:30] [INFO ] Deduced a trap composed of 130 places in 8076 ms of which 7769 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:01:30] [INFO ] Deduced a trap composed of 129 places in 479 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:01:31] [INFO ] Deduced a trap composed of 130 places in 1157 ms of which 856 ms to minimize.
SMT process timed out in 33901ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34160 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin16745275858994110924
[2025-06-06 16:01:31] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16745275858994110924
Running compilation step : cd /tmp/ltsmin16745275858994110924;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16745275858994110924;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16745275858994110924;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 29 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:01:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:01:35] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-06-06 16:01:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:01:35] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:01:47] [INFO ] Implicit Places using invariants and state equation in 12418 ms returned []
Implicit Place search using SMT with State Equation took 12781 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:01:47] [INFO ] Invariant cache hit.
[2025-06-06 16:01:47] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:02:11] [INFO ] Deduced a trap composed of 129 places in 2314 ms of which 2000 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:02:11] [INFO ] Deduced a trap composed of 129 places in 403 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:02:19] [INFO ] Deduced a trap composed of 130 places in 8190 ms of which 7881 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:02:20] [INFO ] Deduced a trap composed of 129 places in 503 ms of which 171 ms to minimize.
SMT process timed out in 32818ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32824ms
Finished structural reductions in LTL mode , in 1 iterations and 45639 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin3298151057594230195
[2025-06-06 16:02:20] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3298151057594230195
Running compilation step : cd /tmp/ltsmin3298151057594230195;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3298151057594230195;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3298151057594230195;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 16:02:23] [INFO ] Flatten gal took : 64 ms
[2025-06-06 16:02:23] [INFO ] Flatten gal took : 63 ms
[2025-06-06 16:02:23] [INFO ] Time to serialize gal into /tmp/LTL15446072824512695368.gal : 11 ms
[2025-06-06 16:02:23] [INFO ] Time to serialize properties into /tmp/LTL7617333516287880152.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/LTL15446072824512695368.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11157937331554464941.hoa' '-atoms' '/tmp/LTL7617333516287880152.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7617333516287880152.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11157937331554464941.hoa
Detected timeout of ITS tools.
[2025-06-06 16:02:39] [INFO ] Flatten gal took : 62 ms
[2025-06-06 16:02:39] [INFO ] Flatten gal took : 67 ms
[2025-06-06 16:02:39] [INFO ] Time to serialize gal into /tmp/LTL9663116929002295649.gal : 11 ms
[2025-06-06 16:02:39] [INFO ] Time to serialize properties into /tmp/LTL1885444509181239092.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/LTL9663116929002295649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1885444509181239092.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((("((State_0_14==1)&&(State_15_14==1))")U("((State_10_2==1)&&(State_9_15==1))"))U(X(X(G((F("((State_15_10==1)&&(State_0_10==1))")...203
Formula 0 simplified : X((!"((State_0_14==1)&&(State_15_14==1))" R !"((State_10_2==1)&&(State_9_15==1))") R XXF(G!"((State_15_10==1)&&(State_0_10==1))" R !...194
Detected timeout of ITS tools.
[2025-06-06 16:02:54] [INFO ] Flatten gal took : 60 ms
[2025-06-06 16:02:54] [INFO ] Applying decomposition
[2025-06-06 16:02:54] [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/graph15117848593630335539.txt' '-o' '/tmp/graph15117848593630335539.bin' '-w' '/tmp/graph15117848593630335539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15117848593630335539.bin' '-l' '-1' '-v' '-w' '/tmp/graph15117848593630335539.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:02:54] [INFO ] Decomposing Gal with order
[2025-06-06 16:02:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:02:54] [INFO ] Removed a total of 8022 redundant transitions.
[2025-06-06 16:02:54] [INFO ] Flatten gal took : 128 ms
[2025-06-06 16:02:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 17 ms.
[2025-06-06 16:02:54] [INFO ] Time to serialize gal into /tmp/LTL6642529555893947541.gal : 11 ms
[2025-06-06 16:02:54] [INFO ] Time to serialize properties into /tmp/LTL14528874266113607127.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/LTL6642529555893947541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14528874266113607127.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((("((i9.i1.u45.State_0_14==1)&&(i3.i1.u16.State_15_14==1))")U("((i3.i5.u59.State_10_2==1)&&(i13.i1.u83.State_9_15==1))"))U(X(X(G(...289
Formula 0 simplified : X((!"((i9.i1.u45.State_0_14==1)&&(i3.i1.u16.State_15_14==1))" R !"((i3.i5.u59.State_10_2==1)&&(i13.i1.u83.State_9_15==1))") R XXF(G!...280
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-15 finished in 253247 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(X(X(F(p0))))))'
Found a Shortening insensitive property : TokenRing-PT-015-LTLFireability-00
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 20 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:03:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:03:10] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 16:03:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:03:10] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:03:11] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:03:11] [INFO ] Invariant cache hit.
[2025-06-06 16:03:11] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:03:34] [INFO ] Deduced a trap composed of 129 places in 2377 ms of which 2064 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:03:35] [INFO ] Deduced a trap composed of 129 places in 415 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:03:43] [INFO ] Deduced a trap composed of 130 places in 8064 ms of which 7761 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:03:43] [INFO ] Deduced a trap composed of 129 places in 494 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:03:45] [INFO ] Deduced a trap composed of 130 places in 1166 ms of which 867 ms to minimize.
SMT process timed out in 33832ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33838ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 34920 ms. Remains : 256/256 places, 3616/3616 transitions.
Running random walk in product with property : TokenRing-PT-015-LTLFireability-00
Product exploration explored 100000 steps with 2179 reset in 4959 ms.
Product exploration explored 100000 steps with 2187 reset in 5035 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 192 steps (0 resets) in 31 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 16:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:831)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:977)
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-06 16:04:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:04:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:04:24] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-06 16:04:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:04:24] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:04:25] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:04:25] [INFO ] Invariant cache hit.
[2025-06-06 16:04:25] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:04:50] [INFO ] Deduced a trap composed of 129 places in 2369 ms of which 2049 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:04:51] [INFO ] Deduced a trap composed of 129 places in 406 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:04:59] [INFO ] Deduced a trap composed of 130 places in 8317 ms of which 8019 ms to minimize.
SMT process timed out in 34446ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34452ms
Finished structural reductions in LTL mode , in 1 iterations and 35599 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 180 steps (0 resets) in 29 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 16:05:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2178 reset in 5121 ms.
Product exploration explored 100000 steps with 2189 reset in 5090 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 57 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:05:38] [INFO ] Redundant transitions in 155 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:05:38] [INFO ] Invariant cache hit.
[2025-06-06 16:05:38] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:06:02] [INFO ] Deduced a trap composed of 129 places in 2284 ms of which 2001 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:06:03] [INFO ] Deduced a trap composed of 129 places in 373 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:06:11] [INFO ] Deduced a trap composed of 130 places in 8097 ms of which 7813 ms to minimize.
SMT process timed out in 33050ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33057ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33283 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin10259040052621041457
[2025-06-06 16:06:11] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10259040052621041457
Running compilation step : cd /tmp/ltsmin10259040052621041457;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10259040052621041457;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10259040052621041457;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:06:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 16:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:06:14] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:06:15] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:06:15] [INFO ] Invariant cache hit.
[2025-06-06 16:06:15] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:06:38] [INFO ] Deduced a trap composed of 129 places in 2415 ms of which 2084 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:06:38] [INFO ] Deduced a trap composed of 129 places in 420 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:06:47] [INFO ] Deduced a trap composed of 130 places in 8459 ms of which 8142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:06:47] [INFO ] Deduced a trap composed of 129 places in 494 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:06:49] [INFO ] Deduced a trap composed of 130 places in 1186 ms of which 888 ms to minimize.
SMT process timed out in 33688ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33695ms
Finished structural reductions in LTL mode , in 1 iterations and 34721 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin14962204378184402154
[2025-06-06 16:06:49] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14962204378184402154
Running compilation step : cd /tmp/ltsmin14962204378184402154;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14962204378184402154;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14962204378184402154;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 16:06:52] [INFO ] Flatten gal took : 80 ms
[2025-06-06 16:06:52] [INFO ] Flatten gal took : 83 ms
[2025-06-06 16:06:52] [INFO ] Time to serialize gal into /tmp/LTL171863547215765803.gal : 12 ms
[2025-06-06 16:06:52] [INFO ] Time to serialize properties into /tmp/LTL2286475608100371741.prop : 6 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/LTL171863547215765803.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13400625823804000166.hoa' '-atoms' '/tmp/LTL2286475608100371741.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2286475608100371741.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13400625823804000166.hoa
Detected timeout of ITS tools.
[2025-06-06 16:07:07] [INFO ] Flatten gal took : 83 ms
[2025-06-06 16:07:07] [INFO ] Flatten gal took : 89 ms
[2025-06-06 16:07:07] [INFO ] Time to serialize gal into /tmp/LTL18430199901026621143.gal : 11 ms
[2025-06-06 16:07:07] [INFO ] Time to serialize properties into /tmp/LTL11438195747593372645.ltl : 8 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/LTL18430199901026621143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11438195747593372645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("((((((((((((((State_2_3==0)||(State_3_12==0))&&((State_3_14==0)||(State_4_4==0)))&&(((State_1_6==0)||(State_2_5==0))&&((...134979
Formula 0 simplified : XXXXG!"((((((((((((((State_2_3==0)||(State_3_12==0))&&((State_3_14==0)||(State_4_4==0)))&&(((State_1_6==0)||(State_2_5==0))&&((State...134967
Detected timeout of ITS tools.
[2025-06-06 16:07:23] [INFO ] Flatten gal took : 81 ms
[2025-06-06 16:07:23] [INFO ] Applying decomposition
[2025-06-06 16:07:23] [INFO ] Flatten gal took : 79 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/graph5765202947475169368.txt' '-o' '/tmp/graph5765202947475169368.bin' '-w' '/tmp/graph5765202947475169368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5765202947475169368.bin' '-l' '-1' '-v' '-w' '/tmp/graph5765202947475169368.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:07:23] [INFO ] Decomposing Gal with order
[2025-06-06 16:07:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:07:23] [INFO ] Removed a total of 8036 redundant transitions.
[2025-06-06 16:07:23] [INFO ] Flatten gal took : 131 ms
[2025-06-06 16:07:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 19 ms.
[2025-06-06 16:07:24] [INFO ] Time to serialize gal into /tmp/LTL3927367283046212282.gal : 12 ms
[2025-06-06 16:07:24] [INFO ] Time to serialize properties into /tmp/LTL4943577404291711870.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3927367283046212282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4943577404291711870.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(X(X(F("((((((((((((((i12.i0.u65.State_2_3==0)||(i15.i0.u55.State_3_12==0))&&((i13.i1.u77.State_3_14==0)||(i1.i0.u49.State_4_4==...210594
Formula 0 simplified : XXXXG!"((((((((((((((i12.i0.u65.State_2_3==0)||(i15.i0.u55.State_3_12==0))&&((i13.i1.u77.State_3_14==0)||(i1.i0.u49.State_4_4==0)))&...210582
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-00 finished in 269341 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)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p1 U p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p0 U (p1 U p2))||X(X(G(p3)))))))'
Found a Lengthening insensitive property : TokenRing-PT-015-LTLFireability-10
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p2)]
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 32 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:07:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:07:40] [INFO ] Implicit Places using invariants in 366 ms returned []
[2025-06-06 16:07:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:07:40] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:07:51] [INFO ] Implicit Places using invariants and state equation in 11181 ms returned []
Implicit Place search using SMT with State Equation took 11552 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:07:51] [INFO ] Invariant cache hit.
[2025-06-06 16:07:51] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:08:15] [INFO ] Deduced a trap composed of 129 places in 2298 ms of which 2006 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:08:16] [INFO ] Deduced a trap composed of 129 places in 425 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:08:24] [INFO ] Deduced a trap composed of 130 places in 8099 ms of which 7799 ms to minimize.
SMT process timed out in 32939ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32944ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 44536 ms. Remains : 256/256 places, 3616/3616 transitions.
Running random walk in product with property : TokenRing-PT-015-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 499 ms.
Product exploration explored 100000 steps with 0 reset in 504 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (NOT (OR p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 112 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 402 ms. (99 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 103015 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 103015 steps, saw 20446 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2025-06-06 16:08:29] [INFO ] Invariant cache hit.
[2025-06-06 16:08:29] [INFO ] State equation strengthened by 3390 read => feed constraints.
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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 450/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 240/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5015 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 450/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 240/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4829 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9868ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 278 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 58 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 291 ms. (136 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 103350 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 103350 steps, saw 20509 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2025-06-06 16:08:42] [INFO ] Invariant cache hit.
[2025-06-06 16:08:42] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 450/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 240/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5445 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 450/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 240/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4557 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10028ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 296 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 63 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 64 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:08:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:08:53] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-06-06 16:08:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:08:53] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:09:04] [INFO ] Implicit Places using invariants and state equation in 10851 ms returned []
Implicit Place search using SMT with State Equation took 11267 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:09:04] [INFO ] Redundant transitions in 165 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:09:04] [INFO ] Invariant cache hit.
[2025-06-06 16:09:04] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:09:28] [INFO ] Deduced a trap composed of 129 places in 2319 ms of which 1995 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:09:29] [INFO ] Deduced a trap composed of 129 places in 583 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:09:37] [INFO ] Deduced a trap composed of 130 places in 8330 ms of which 8030 ms to minimize.
SMT process timed out in 33539ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45050 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3556 edges and 256 vertex of which 254 / 256 are part of one of the 16 SCC in 1 ms
Free SCC test removed 238 places
Drop transitions (Empty/Sink Transition effects.) removed 3556 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 3612 transitions.
Graph (complete) has 4 edges and 18 vertex of which 4 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 5 ms. Remains 4 /256 variables (removed 252) and now considering 4/3616 (removed 3612) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2025-06-06 16:09:37] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 16:09:37] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 16:09:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-06 16:09:37] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 16:09:37] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 16:09:37] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 54 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (NOT (OR p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 2 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 27 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 16:09:38] [INFO ] Computed 16 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:09:38] [INFO ] Implicit Places using invariants in 380 ms returned []
[2025-06-06 16:09:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:09:39] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:09:49] [INFO ] Implicit Places using invariants and state equation in 11104 ms returned []
Implicit Place search using SMT with State Equation took 11488 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:09:49] [INFO ] Invariant cache hit.
[2025-06-06 16:09:49] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:10:13] [INFO ] Deduced a trap composed of 129 places in 2337 ms of which 2032 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:10:14] [INFO ] Deduced a trap composed of 129 places in 401 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:10:22] [INFO ] Deduced a trap composed of 130 places in 8291 ms of which 8006 ms to minimize.
SMT process timed out in 32642ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32649ms
Finished structural reductions in LTL mode , in 1 iterations and 44175 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p3]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 103480 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 103480 steps, saw 20529 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2025-06-06 16:10:25] [INFO ] Invariant cache hit.
[2025-06-06 16:10:25] [INFO ] State equation strengthened by 3390 read => feed constraints.
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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 450/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 240/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5015 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 450/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 240/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4401 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 314 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 56 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 394 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 102694 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 102694 steps, saw 20385 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2025-06-06 16:10:38] [INFO ] Invariant cache hit.
[2025-06-06 16:10:38] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 240/1264 variables, 450/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1312 variables, 32/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1312 variables, 32/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/1762 variables, 240/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1762 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 62/1824 variables, 32/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1824 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 2/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 450/2274 variables, 450/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2274 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/2336 variables, 32/2111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2336 variables, 32/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 2/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 450/2786 variables, 450/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2786 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 62/2848 variables, 32/2627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2848 variables, 32/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 450/3298 variables, 450/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3298 variables, 0/3111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/3360 variables, 32/3143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3360 variables, 32/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 2/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5286 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/512 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 225/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 450/962 variables, 450/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1024 variables, 32/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 32/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 240/1264 variables, 450/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/1312 variables, 32/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1312 variables, 32/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 2/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/1762 variables, 240/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1762 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1824 variables, 32/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1824 variables, 32/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1824 variables, 2/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 450/2274 variables, 450/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2274 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/2336 variables, 32/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2336 variables, 32/2144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2336 variables, 2/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2336 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 450/2786 variables, 450/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2786 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/2848 variables, 32/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 32/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 2/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2848 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 450/3298 variables, 450/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3298 variables, 0/3112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/3360 variables, 32/3144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3360 variables, 32/3176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3360 variables, 2/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5030 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10343ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 316 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 55 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 54 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:10:50] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-06-06 16:10:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:10:50] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:11:01] [INFO ] Implicit Places using invariants and state equation in 11562 ms returned []
Implicit Place search using SMT with State Equation took 11952 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:11:01] [INFO ] Redundant transitions in 167 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:11:01] [INFO ] Invariant cache hit.
[2025-06-06 16:11:01] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:11:25] [INFO ] Deduced a trap composed of 129 places in 2409 ms of which 2076 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:11:25] [INFO ] Deduced a trap composed of 129 places in 440 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:11:34] [INFO ] Deduced a trap composed of 130 places in 8171 ms of which 7879 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:11:34] [INFO ] Deduced a trap composed of 129 places in 468 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:11:35] [INFO ] Deduced a trap composed of 130 places in 1138 ms of which 864 ms to minimize.
SMT process timed out in 33878ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33884ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46072 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3556 edges and 256 vertex of which 254 / 256 are part of one of the 16 SCC in 0 ms
Free SCC test removed 238 places
Drop transitions (Empty/Sink Transition effects.) removed 3556 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 3612 transitions.
Graph (complete) has 4 edges and 18 vertex of which 4 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 3 ms. Remains 4 /256 variables (removed 252) and now considering 4/3616 (removed 3612) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2025-06-06 16:11:35] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 16:11:35] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 16:11:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-06 16:11:35] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 16:11:35] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 16:11:35] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 49 ms.
Knowledge obtained : [p3]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 494 ms.
Product exploration explored 100000 steps with 0 reset in 500 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 61 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:11:37] [INFO ] Redundant transitions in 159 ms returned []
Running 3601 sub problems to find dead transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 16:11:38] [INFO ] Computed 16 invariants in 10 ms
[2025-06-06 16:11:38] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:12:01] [INFO ] Deduced a trap composed of 129 places in 2392 ms of which 2085 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:12:02] [INFO ] Deduced a trap composed of 129 places in 428 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:12:10] [INFO ] Deduced a trap composed of 130 places in 8363 ms of which 8039 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:12:10] [INFO ] Deduced a trap composed of 129 places in 505 ms of which 177 ms to minimize.
SMT process timed out in 32966ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32971ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33205 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin11865822870534956073
[2025-06-06 16:12:11] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11865822870534956073
Running compilation step : cd /tmp/ltsmin11865822870534956073;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11865822870534956073;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11865822870534956073;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 25 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:12:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:12:14] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-06 16:12:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:12:15] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:12:25] [INFO ] Implicit Places using invariants and state equation in 10860 ms returned []
Implicit Place search using SMT with State Equation took 11244 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:12:25] [INFO ] Invariant cache hit.
[2025-06-06 16:12:25] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:12:49] [INFO ] Deduced a trap composed of 129 places in 2332 ms of which 2020 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:12:49] [INFO ] Deduced a trap composed of 129 places in 415 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:12:57] [INFO ] Deduced a trap composed of 130 places in 8220 ms of which 7901 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:12:58] [INFO ] Deduced a trap composed of 129 places in 485 ms of which 173 ms to minimize.
SMT process timed out in 33152ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33157ms
Finished structural reductions in LTL mode , in 1 iterations and 44432 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin2190106757290009426
[2025-06-06 16:12:58] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2190106757290009426
Running compilation step : cd /tmp/ltsmin2190106757290009426;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2190106757290009426;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2190106757290009426;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 16:13:01] [INFO ] Flatten gal took : 69 ms
[2025-06-06 16:13:01] [INFO ] Flatten gal took : 71 ms
[2025-06-06 16:13:01] [INFO ] Time to serialize gal into /tmp/LTL6231817184069343982.gal : 12 ms
[2025-06-06 16:13:01] [INFO ] Time to serialize properties into /tmp/LTL17298674032846386590.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/LTL6231817184069343982.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10043260879848802883.hoa' '-atoms' '/tmp/LTL17298674032846386590.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17298674032846386590.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10043260879848802883.hoa
Detected timeout of ITS tools.
[2025-06-06 16:13:17] [INFO ] Flatten gal took : 64 ms
[2025-06-06 16:13:17] [INFO ] Flatten gal took : 67 ms
[2025-06-06 16:13:17] [INFO ] Time to serialize gal into /tmp/LTL13022567391679041951.gal : 10 ms
[2025-06-06 16:13:17] [INFO ] Time to serialize properties into /tmp/LTL1568986481710968938.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/LTL13022567391679041951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1568986481710968938.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(((("((State_0_15==1)&&(State_15_15==1))")U(("((State_14_5==1)&&(State_15_9==1))")U("((State_3_11==1)&&(State_2_14==1))")))||(X(...245
Formula 0 simplified : XF(!"((State_0_15==1)&&(State_15_15==1))" & (!"((State_0_15==1)&&(State_15_15==1))" R (!"((State_14_5==1)&&(State_15_9==1))" R !"((S...233
Detected timeout of ITS tools.
[2025-06-06 16:13:32] [INFO ] Flatten gal took : 61 ms
[2025-06-06 16:13:32] [INFO ] Applying decomposition
[2025-06-06 16:13:32] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12636267136420018313.txt' '-o' '/tmp/graph12636267136420018313.bin' '-w' '/tmp/graph12636267136420018313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12636267136420018313.bin' '-l' '-1' '-v' '-w' '/tmp/graph12636267136420018313.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:13:32] [INFO ] Decomposing Gal with order
[2025-06-06 16:13:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:13:32] [INFO ] Removed a total of 8050 redundant transitions.
[2025-06-06 16:13:32] [INFO ] Flatten gal took : 107 ms
[2025-06-06 16:13:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 23 ms.
[2025-06-06 16:13:32] [INFO ] Time to serialize gal into /tmp/LTL10139509418199652398.gal : 12 ms
[2025-06-06 16:13:32] [INFO ] Time to serialize properties into /tmp/LTL3513465417094662416.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/LTL10139509418199652398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3513465417094662416.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(((("((i4.i12.u84.State_0_15==1)&&(i2.i12.u105.State_15_15==1))")U(("((i2.i4.u43.State_14_5==1)&&(i2.i5.u55.State_15_9==1))")U("...351
Formula 0 simplified : XF(!"((i4.i12.u84.State_0_15==1)&&(i2.i12.u105.State_15_15==1))" & (!"((i4.i12.u84.State_0_15==1)&&(i2.i12.u105.State_15_15==1))" R ...339
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-10 finished in 368351 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 p1) U X(X(G((F(p2) U p3)))))))'
Found a Lengthening insensitive property : TokenRing-PT-015-LTLFireability-15
Stuttering acceptance computed with spot in 1001 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (NOT p2), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 256 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 34 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:13:49] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-06 16:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:13:50] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:14:01] [INFO ] Implicit Places using invariants and state equation in 12517 ms returned []
Implicit Place search using SMT with State Equation took 12880 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:14:01] [INFO ] Invariant cache hit.
[2025-06-06 16:14:02] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:14:26] [INFO ] Deduced a trap composed of 129 places in 2319 ms of which 1991 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:14:27] [INFO ] Deduced a trap composed of 129 places in 407 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:14:35] [INFO ] Deduced a trap composed of 130 places in 8094 ms of which 7774 ms to minimize.
SMT process timed out in 33128ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33135ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 46054 ms. Remains : 256/256 places, 3616/3616 transitions.
Running random walk in product with property : TokenRing-PT-015-LTLFireability-15
Product exploration explored 100000 steps with 486 reset in 503 ms.
Product exploration explored 100000 steps with 484 reset in 560 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 116 ms. Reduced automaton from 20 states, 52 edges and 4 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 355 ms. (112 steps per ms) remains 1/3 properties
BEST_FIRST walk for 33549 steps (7 resets) in 278 ms. (120 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p3) (NOT p2)))), (F p3)]
Knowledge based reduction with 15 factoid took 197 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 273 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
[2025-06-06 16:14:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:14:39] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-06 16:14:39] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2025-06-06 16:14:39] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:14:40] [INFO ] [Real]Added 3390 Read/Feed constraints in 600 ms returned sat
[2025-06-06 16:14:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:14:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-06 16:14:42] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2025-06-06 16:14:43] [INFO ] [Nat]Added 3390 Read/Feed constraints in 709 ms returned sat
[2025-06-06 16:14:43] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 261 ms.
[2025-06-06 16:14:44] [INFO ] Added : 2 causal constraints over 1 iterations in 642 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 24 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:14:44] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-06 16:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:14:45] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:14:57] [INFO ] Implicit Places using invariants and state equation in 13206 ms returned []
Implicit Place search using SMT with State Equation took 13578 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:14:57] [INFO ] Invariant cache hit.
[2025-06-06 16:14:57] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:15:24] [INFO ] Deduced a trap composed of 129 places in 2351 ms of which 2013 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:15:24] [INFO ] Deduced a trap composed of 129 places in 429 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:15:32] [INFO ] Deduced a trap composed of 130 places in 8162 ms of which 7854 ms to minimize.
SMT process timed out in 34905ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34911ms
Finished structural reductions in LTL mode , in 1 iterations and 48521 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
RANDOM walk for 30205 steps (6 resets) in 218 ms. (137 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 267 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
[2025-06-06 16:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:15:35] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 16:15:36] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2025-06-06 16:15:36] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:15:36] [INFO ] [Real]Added 3390 Read/Feed constraints in 549 ms returned sat
[2025-06-06 16:15:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:15:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-06 16:15:38] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2025-06-06 16:15:39] [INFO ] [Nat]Added 3390 Read/Feed constraints in 709 ms returned sat
[2025-06-06 16:15:39] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 239 ms.
[2025-06-06 16:15:40] [INFO ] Added : 2 causal constraints over 1 iterations in 610 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 275 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 485 reset in 454 ms.
Product exploration explored 100000 steps with 485 reset in 535 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 284 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3)]
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 68 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:15:42] [INFO ] Redundant transitions in 160 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:15:42] [INFO ] Invariant cache hit.
[2025-06-06 16:15:42] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:16:06] [INFO ] Deduced a trap composed of 129 places in 2302 ms of which 2010 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:16:06] [INFO ] Deduced a trap composed of 129 places in 416 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:16:14] [INFO ] Deduced a trap composed of 130 places in 8042 ms of which 7768 ms to minimize.
SMT process timed out in 32854ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32862ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33105 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin6573822720459599324
[2025-06-06 16:16:14] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6573822720459599324
Running compilation step : cd /tmp/ltsmin6573822720459599324;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6573822720459599324;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6573822720459599324;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 23 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 16:16:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:16:18] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-06 16:16:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:16:19] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 16:16:30] [INFO ] Implicit Places using invariants and state equation in 12482 ms returned []
Implicit Place search using SMT with State Equation took 12865 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 16:16:30] [INFO ] Invariant cache hit.
[2025-06-06 16:16:30] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:16:54] [INFO ] Deduced a trap composed of 129 places in 2352 ms of which 2068 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:16:55] [INFO ] Deduced a trap composed of 129 places in 383 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:17:03] [INFO ] Deduced a trap composed of 130 places in 8127 ms of which 7798 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:17:03] [INFO ] Deduced a trap composed of 129 places in 492 ms of which 178 ms to minimize.
SMT process timed out in 33057ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33063ms
Finished structural reductions in LTL mode , in 1 iterations and 45960 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin7164872033263053422
[2025-06-06 16:17:03] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7164872033263053422
Running compilation step : cd /tmp/ltsmin7164872033263053422;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7164872033263053422;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7164872033263053422;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 16:17:07] [INFO ] Flatten gal took : 62 ms
[2025-06-06 16:17:07] [INFO ] Flatten gal took : 68 ms
[2025-06-06 16:17:07] [INFO ] Time to serialize gal into /tmp/LTL1755120045812734502.gal : 11 ms
[2025-06-06 16:17:07] [INFO ] Time to serialize properties into /tmp/LTL4378185056550989912.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/LTL1755120045812734502.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7347225382297833669.hoa' '-atoms' '/tmp/LTL4378185056550989912.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4378185056550989912.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7347225382297833669.hoa
Detected timeout of ITS tools.
[2025-06-06 16:17:22] [INFO ] Flatten gal took : 65 ms
[2025-06-06 16:17:22] [INFO ] Flatten gal took : 71 ms
[2025-06-06 16:17:22] [INFO ] Time to serialize gal into /tmp/LTL15807387654937257242.gal : 12 ms
[2025-06-06 16:17:22] [INFO ] Time to serialize properties into /tmp/LTL13796736970344818748.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/LTL15807387654937257242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13796736970344818748.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((("((State_0_14==1)&&(State_15_14==1))")U("((State_10_2==1)&&(State_9_15==1))"))U(X(X(G((F("((State_15_10==1)&&(State_0_10==1))")...203
Formula 0 simplified : X((!"((State_0_14==1)&&(State_15_14==1))" R !"((State_10_2==1)&&(State_9_15==1))") R XXF(G!"((State_15_10==1)&&(State_0_10==1))" R !...194
Detected timeout of ITS tools.
[2025-06-06 16:17:37] [INFO ] Flatten gal took : 116 ms
[2025-06-06 16:17:37] [INFO ] Applying decomposition
[2025-06-06 16:17:37] [INFO ] Flatten gal took : 64 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/graph14699327808395422410.txt' '-o' '/tmp/graph14699327808395422410.bin' '-w' '/tmp/graph14699327808395422410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14699327808395422410.bin' '-l' '-1' '-v' '-w' '/tmp/graph14699327808395422410.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:17:38] [INFO ] Decomposing Gal with order
[2025-06-06 16:17:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:17:38] [INFO ] Removed a total of 8106 redundant transitions.
[2025-06-06 16:17:38] [INFO ] Flatten gal took : 117 ms
[2025-06-06 16:17:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 26 ms.
[2025-06-06 16:17:38] [INFO ] Time to serialize gal into /tmp/LTL5314956188072315982.gal : 14 ms
[2025-06-06 16:17:38] [INFO ] Time to serialize properties into /tmp/LTL1623918682104247608.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/LTL5314956188072315982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1623918682104247608.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((("((i14.i0.u5.State_0_14==1)&&(i2.i2.u17.State_15_14==1))")U("((i2.i3.u67.State_10_2==1)&&(i7.i1.u56.State_9_15==1))"))U(X(X(G((...281
Formula 0 simplified : X((!"((i14.i0.u5.State_0_14==1)&&(i2.i2.u17.State_15_14==1))" R !"((i2.i3.u67.State_10_2==1)&&(i7.i1.u56.State_9_15==1))") R XXF(G!"...272
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLFireability-15 finished in 245528 ms.
[2025-06-06 16:17:53] [INFO ] Flatten gal took : 160 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4731166922239063039
[2025-06-06 16:17:53] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 16:17:53] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4731166922239063039
Running compilation step : cd /tmp/ltsmin4731166922239063039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '120' '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-06 16:17:53] [INFO ] Applying decomposition
[2025-06-06 16:17:53] [INFO ] Flatten gal took : 162 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/graph13527110174546918393.txt' '-o' '/tmp/graph13527110174546918393.bin' '-w' '/tmp/graph13527110174546918393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13527110174546918393.bin' '-l' '-1' '-v' '-w' '/tmp/graph13527110174546918393.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:17:54] [INFO ] Decomposing Gal with order
[2025-06-06 16:17:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:17:54] [INFO ] Removed a total of 8050 redundant transitions.
[2025-06-06 16:17:54] [INFO ] Flatten gal took : 237 ms
[2025-06-06 16:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 187 labels/synchronizations in 22 ms.
[2025-06-06 16:17:56] [INFO ] Time to serialize gal into /tmp/LTLFireability9384453827389535290.gal : 10 ms
[2025-06-06 16:17:56] [INFO ] Time to serialize properties into /tmp/LTLFireability3303684373793623102.ltl : 52 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/LTLFireability9384453827389535290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3303684373793623102.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...276
Read 6 LTL properties
Checking formula 0 : !((X(X(X(X(F("((((((((((((((i3.i9.u57.State_2_3==0)||(i3.i0.u1.State_3_12==0))&&((i3.i1.u84.State_3_14==0)||(i3.i10.u25.State_4_4==0))...208224
Formula 0 simplified : XXXXG!"((((((((((((((i3.i9.u57.State_2_3==0)||(i3.i0.u1.State_3_12==0))&&((i3.i1.u84.State_3_14==0)||(i3.i10.u25.State_4_4==0)))&&((...208212
Compilation finished in 12314 ms.
Running link step : cd /tmp/ltsmin4731166922239063039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 112 ms.
Running LTSmin : cd /tmp/ltsmin4731166922239063039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4731166922239063039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4731166922239063039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4731166922239063039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4731166922239063039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4731166922239063039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4731166922239063039;'/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' '((LTLAPp1==true) U X(X(((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4731166922239063039;'/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' '((LTLAPp1==true) U X(X(((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4731166922239063039;'/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([](((LTLAPp3==true)||((LTLAPp3==true) U ((LTLAPp4==true) U (LTLAPp5==true)))||X(X([]((LTLAPp6==true)))))))' '--buchi-type=spotba'
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="TokenRing-PT-015"
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 TokenRing-PT-015, 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 r240-tall-174915589600348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-015.tgz
mv TokenRing-PT-015 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 '
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 ;