MCC'2025- Execution of r156-tall-174881253600203

About the Execution of ITS-Tools for PhilosophersDyn-COL-10

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	TTTFTTF?FFFF????	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 32K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748878715000

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-02 15:38:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 15:38:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 15:38:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 15:38:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 15:38:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2025-06-02 15:38:36] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 15:38:36] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 5 ms.
[2025-06-02 15:38:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40005 steps (2812 resets) in 396 ms. (100 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40002 steps (2042 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
// Phase 1: matrix 7 rows 8 cols
[2025-06-02 15:38:37] [INFO ] Computed 3 invariants in 2 ms
[2025-06-02 15:38:37] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/15 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/15 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 6 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 15:38:37] [INFO ] Invariant cache hit.
[2025-06-02 15:38:37] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 196ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 8/8 places, 7/7 transitions.
RANDOM walk for 40000 steps (2841 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1986 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Probably explored full state space saw : 504 states, properties seen :0
Probabilistic random walk after 1609 steps, saw 504 distinct states, run finished after 14 ms. (steps per millisecond=114 ) properties seen :0
Explored full state space saw : 504 states, properties seen :0
Exhaustive walk after 1609 steps, saw 504 distinct states, run finished after 4 ms. (steps per millisecond=402 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2025-06-02 15:38:37] [INFO ] Flatten gal took : 14 ms
[2025-06-02 15:38:37] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2025-06-02 15:38:38] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 113 ms.
[2025-06-02 15:38:38] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 23 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2025-06-02 15:38:38] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2025-06-02 15:38:38] [INFO ] Computed 39 invariants in 66 ms
[2025-06-02 15:38:38] [INFO ] State equation strengthened by 1030 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2044 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 190 solved, 2030 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1989 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2075 variables, and 39 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 2040/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 380 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
SMT process timed out in 45628ms, After SMT, problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 45672ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2025-06-02 15:39:23] [INFO ] Computed 39 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:39:23] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 15:39:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:39:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 15:39:24] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46539 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 170 out of 170 places after structural reductions.
[2025-06-02 15:39:24] [INFO ] Flatten gal took : 212 ms
[2025-06-02 15:39:25] [INFO ] Flatten gal took : 132 ms
[2025-06-02 15:39:25] [INFO ] Input system was already deterministic with 1885 transitions.
RANDOM walk for 40000 steps (4766 resets) in 1780 ms. (22 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40002 steps (348 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (360 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (365 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (337 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (393 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (338 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (338 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
[2025-06-02 15:39:26] [INFO ] Invariant cache hit.
[2025-06-02 15:39:26] [INFO ] State equation strengthened by 1010 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/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/170 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2479 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 9/1 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:29] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:29] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:29] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:30] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:30] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:30] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:31] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:31] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:31] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:32] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:32] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:32] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:32] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:32] [INFO ] Deduced a trap composed of 70 places in 248 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 9/169 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:33] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/170 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 7575ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 142 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:39:34] [INFO ] Invariant cache hit.
[2025-06-02 15:39:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43775ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43780ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43927 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4765 resets) in 546 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (348 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (367 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (338 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (394 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (338 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (340 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 184590 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 9
Probabilistic random walk after 184590 steps, saw 47413 distinct states, run finished after 3004 ms. (steps per millisecond=61 ) properties seen :0
[2025-06-02 15:40:21] [INFO ] Invariant cache hit.
[2025-06-02 15:40:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/170 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2491 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 9/1 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/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:24] [INFO ] Deduced a trap composed of 11 places in 318 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:24] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:24] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:25] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:25] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:25] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:25] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:26] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:26] [INFO ] Deduced a trap composed of 11 places in 288 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:26] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:27] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:27] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:27] [INFO ] Deduced a trap composed of 62 places in 240 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:27] [INFO ] Deduced a trap composed of 70 places in 260 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 9/169 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:40:28] [INFO ] Deduced a trap composed of 54 places in 285 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/170 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1885/2055 variables, 170/224 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2055 variables, 1010/1234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2055 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2055 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/2055 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1235 constraints, problems are : Problem set: 0 solved, 9 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 9/1 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22589ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 142 ms.
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 76 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 109 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 15:40:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:40:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-02 15:40:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:40:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 15:40:44] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:40:45] [INFO ] Redundant transitions in 159 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:40:45] [INFO ] Invariant cache hit.
[2025-06-02 15:40:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33779ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33784ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34758 ms. Remains : 170/170 places, 1885/1885 transitions.
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(p0) U G(p1))||X(F(p2))))'
Support contains 40 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 30 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:41:19] [INFO ] Invariant cache hit.
[2025-06-02 15:41:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43739ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43745ms
[2025-06-02 15:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:42:03] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-02 15:42:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:42:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 15:42:34] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 15:43:12] [INFO ] Performed 22/170 implicitness test of which 0 returned IMPLICIT in 69 seconds.
[2025-06-02 15:43:39] [INFO ] Implicit Places using invariants and state equation in 95968 ms returned []
Implicit Place search using SMT with State Equation took 96212 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:43:39] [INFO ] Invariant cache hit.
[2025-06-02 15:43:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33990ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33995ms
Finished structural reductions in LTL mode , in 1 iterations and 173996 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 1311 ms.
Product exploration explored 100000 steps with 50000 reset in 1191 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 p1 (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 24 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-01 finished in 177027 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(p0)||G(p1)))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 163 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:44:16] [INFO ] Invariant cache hit.
[2025-06-02 15:44:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44131ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44134ms
[2025-06-02 15:45:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:45:00] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-06-02 15:45:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:45:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 15:45:34] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 15:46:04] [INFO ] Performed 30/170 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2025-06-02 15:46:37] [INFO ] Performed 61/170 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2025-06-02 15:46:43] [INFO ] Implicit Places using invariants and state equation in 102575 ms returned []
Implicit Place search using SMT with State Equation took 102885 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:46:43] [INFO ] Redundant transitions in 79 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:46:43] [INFO ] Invariant cache hit.
[2025-06-02 15:46:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33735ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33739ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 181019 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 36 steps with 3 reset in 2 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-03 finished in 181168 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(F((G(X(p0)) U p1)))&&F(!p0))))'
Support contains 40 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:47:17] [INFO ] Invariant cache hit.
[2025-06-02 15:47:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 2.0)
(s121 2.0)
(s122 2.0)
(s123 2.0)
(s124 2.0)
(s125 2.0)
(s126 2.0)
(s127 2.0)
(s128 2.0)
(s129 2.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44194ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44198ms
[2025-06-02 15:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:48:01] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-06-02 15:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:48:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 15:48:32] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 15:49:11] [INFO ] Performed 22/170 implicitness test of which 0 returned IMPLICIT in 69 seconds.
[2025-06-02 15:49:33] [INFO ] Implicit Places using invariants and state equation in 92196 ms returned []
Implicit Place search using SMT with State Equation took 92495 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:49:34] [INFO ] Invariant cache hit.
[2025-06-02 15:49:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33927ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33933ms
Finished structural reductions in LTL mode , in 1 iterations and 170657 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 1180 ms.
Product exploration explored 100000 steps with 50000 reset in 1142 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 (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-04 finished in 173157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 110 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:50:10] [INFO ] Invariant cache hit.
[2025-06-02 15:50:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43876ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43881ms
[2025-06-02 15:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:50:54] [INFO ] Implicit Places using invariants in 293 ms returned []
[2025-06-02 15:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:50:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 15:51:27] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 15:52:02] [INFO ] Performed 21/170 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2025-06-02 15:52:28] [INFO ] Implicit Places using invariants and state equation in 93849 ms returned []
Implicit Place search using SMT with State Equation took 94147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:52:28] [INFO ] Redundant transitions in 38 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:52:28] [INFO ] Invariant cache hit.
[2025-06-02 15:52:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34082ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34085ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172284 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-07
Product exploration explored 100000 steps with 11968 reset in 776 ms.
Product exploration explored 100000 steps with 12019 reset in 751 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (4780 resets) in 291 ms. (136 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (360 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
[2025-06-02 15:53:04] [INFO ] Invariant cache hit.
[2025-06-02 15:53:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 123/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1717 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3164ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 211 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2025-06-02 15:53:08] [INFO ] Computed 39 invariants in 32 ms
[2025-06-02 15:53:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2035 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44299ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44521 ms. Remains : 160/170 places, 1875/1885 transitions.
RANDOM walk for 40000 steps (4748 resets) in 354 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (375 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 317270 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 317270 steps, saw 76290 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2025-06-02 15:53:55] [INFO ] Invariant cache hit.
[2025-06-02 15:53:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 113/150 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2025 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2025 variables, 1010/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2025 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6681 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/150 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2025 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2025 variables, 1010/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2025 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/2035 variables, 10/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2035 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2035 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4291 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11007ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 78 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 78 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 15:54:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:07] [INFO ] Implicit Places using invariants in 319 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 324 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 173 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2025-06-02 15:54:07] [INFO ] Computed 29 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:07] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-02 15:54:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 15:54:51] [INFO ] Performed 8/140 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2025-06-02 15:55:23] [INFO ] Performed 10/140 implicitness test of which 0 returned IMPLICIT in 75 seconds.
[2025-06-02 15:55:58] [INFO ] Performed 13/140 implicitness test of which 0 returned IMPLICIT in 109 seconds.
[2025-06-02 15:56:30] [INFO ] Performed 15/140 implicitness test of which 0 returned IMPLICIT in 141 seconds.
[2025-06-02 15:56:30] [INFO ] Timeout of Implicit test with SMT after 141 seconds.
[2025-06-02 15:56:30] [INFO ] Implicit Places using invariants and state equation in 142974 ms returned []
Implicit Place search using SMT with State Equation took 143271 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 143846 ms. Remains : 140/160 places, 1865/1875 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
// Phase 1: matrix 1885 rows 170 cols
[2025-06-02 15:56:30] [INFO ] Computed 39 invariants in 31 ms
[2025-06-02 15:56:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44155ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44158ms
[2025-06-02 15:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:57:15] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-06-02 15:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:57:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 15:57:48] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 15:58:19] [INFO ] Performed 30/170 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2025-06-02 15:58:44] [INFO ] Implicit Places using invariants and state equation in 88847 ms returned []
Implicit Place search using SMT with State Equation took 89144 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:58:44] [INFO ] Redundant transitions in 34 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 15:58:44] [INFO ] Invariant cache hit.
[2025-06-02 15:58:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34002ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34007ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 167451 ms. Remains : 170/170 places, 1885/1885 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (4774 resets) in 356 ms. (112 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (360 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2025-06-02 15:59:18] [INFO ] Invariant cache hit.
[2025-06-02 15:59:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 123/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3109ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 172 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2025-06-02 15:59:22] [INFO ] Computed 39 invariants in 30 ms
[2025-06-02 15:59:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2035 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44252ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44432 ms. Remains : 160/170 places, 1875/1885 transitions.
RANDOM walk for 40000 steps (4772 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (374 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 301713 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 301713 steps, saw 72808 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2025-06-02 16:00:09] [INFO ] Invariant cache hit.
[2025-06-02 16:00:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 113/150 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2025 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2025 variables, 1010/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2025 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8804 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/150 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2025 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2025 variables, 1010/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2025 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/2035 variables, 10/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2035 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2035 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4221 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13045ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 74 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 73 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:00:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:22] [INFO ] Implicit Places using invariants in 322 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 325 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 152 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2025-06-02 16:00:23] [INFO ] Computed 29 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:23] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-02 16:00:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:01:07] [INFO ] Performed 8/140 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2025-06-02 16:01:40] [INFO ] Performed 10/140 implicitness test of which 0 returned IMPLICIT in 75 seconds.
[2025-06-02 16:02:17] [INFO ] Performed 14/140 implicitness test of which 0 returned IMPLICIT in 112 seconds.
[2025-06-02 16:02:49] [INFO ] Performed 16/140 implicitness test of which 0 returned IMPLICIT in 144 seconds.
[2025-06-02 16:02:49] [INFO ] Timeout of Implicit test with SMT after 144 seconds.
[2025-06-02 16:02:49] [INFO ] Implicit Places using invariants and state equation in 146255 ms returned []
Implicit Place search using SMT with State Equation took 146566 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 147116 ms. Remains : 140/160 places, 1865/1875 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12008 reset in 715 ms.
Product exploration explored 100000 steps with 11971 reset in 687 ms.
Built C files in :
/tmp/ltsmin13637738216747876486
[2025-06-02 16:02:51] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2025-06-02 16:02:51] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13637738216747876486
Running compilation step : cd /tmp/ltsmin13637738216747876486;'/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/ltsmin13637738216747876486;'/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/ltsmin13637738216747876486;'/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 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 88 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
// Phase 1: matrix 1885 rows 170 cols
[2025-06-02 16:02:54] [INFO ] Computed 39 invariants in 27 ms
[2025-06-02 16:02:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44091ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44094ms
[2025-06-02 16:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:03:39] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-02 16:03:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:03:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:04:09] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 16:04:47] [INFO ] Performed 21/170 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2025-06-02 16:05:18] [INFO ] Performed 52/170 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2025-06-02 16:05:37] [INFO ] Implicit Places using invariants and state equation in 118091 ms returned []
Implicit Place search using SMT with State Equation took 118404 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:05:37] [INFO ] Redundant transitions in 39 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:05:37] [INFO ] Invariant cache hit.
[2025-06-02 16:05:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33832ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33835ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 196473 ms. Remains : 170/170 places, 1885/1885 transitions.
Built C files in :
/tmp/ltsmin7064509209826004584
[2025-06-02 16:06:11] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2025-06-02 16:06:11] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7064509209826004584
Running compilation step : cd /tmp/ltsmin7064509209826004584;'/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/ltsmin7064509209826004584;'/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/ltsmin7064509209826004584;'/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-02 16:06:14] [INFO ] Flatten gal took : 96 ms
[2025-06-02 16:06:14] [INFO ] Flatten gal took : 92 ms
[2025-06-02 16:06:14] [INFO ] Time to serialize gal into /tmp/LTL15351921883219672432.gal : 28 ms
[2025-06-02 16:06:14] [INFO ] Time to serialize properties into /tmp/LTL7608063806511304867.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15351921883219672432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7204676931414521370.hoa' '-atoms' '/tmp/LTL7608063806511304867.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/LTL7608063806511304867.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7204676931414521370.hoa
Detected timeout of ITS tools.
[2025-06-02 16:06:29] [INFO ] Flatten gal took : 93 ms
[2025-06-02 16:06:29] [INFO ] Flatten gal took : 92 ms
[2025-06-02 16:06:29] [INFO ] Time to serialize gal into /tmp/LTL12226815589411467409.gal : 21 ms
[2025-06-02 16:06:29] [INFO ] Time to serialize properties into /tmp/LTL12513018229146306395.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12226815589411467409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12513018229146306395.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((HasLeft_0+HasLeft_1)+(HasLeft_2+HasLeft_3))+((HasLeft_4+HasLeft_5)+(HasLeft_6+HasLeft_7)))+(HasLeft_8+HasLeft_9))<=((((W...428
Formula 0 simplified : F(G!"(((((HasLeft_0+HasLeft_1)+(HasLeft_2+HasLeft_3))+((HasLeft_4+HasLeft_5)+(HasLeft_6+HasLeft_7)))+(HasLeft_8+HasLeft_9))<=((((Wai...418
Detected timeout of ITS tools.
[2025-06-02 16:06:44] [INFO ] Flatten gal took : 76 ms
[2025-06-02 16:06:44] [INFO ] Applying decomposition
[2025-06-02 16:06:45] [INFO ] Flatten gal took : 80 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/graph3103337121769495487.txt' '-o' '/tmp/graph3103337121769495487.bin' '-w' '/tmp/graph3103337121769495487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3103337121769495487.bin' '-l' '-1' '-v' '-w' '/tmp/graph3103337121769495487.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:06:45] [INFO ] Decomposing Gal with order
[2025-06-02 16:06:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:06:45] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-02 16:06:45] [INFO ] Flatten gal took : 234 ms
[2025-06-02 16:06:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 11 ms.
[2025-06-02 16:06:45] [INFO ] Time to serialize gal into /tmp/LTL2443133729391852300.gal : 14 ms
[2025-06-02 16:06:45] [INFO ] Time to serialize properties into /tmp/LTL3457677440984449641.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/LTL2443133729391852300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3457677440984449641.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("(((((gu1.HasLeft_0+gu1.HasLeft_1)+(gu1.HasLeft_2+gu1.HasLeft_3))+((gu1.HasLeft_4+gu1.HasLeft_5)+(gu1.HasLeft_6+gu1.HasLeft_7)...548
Formula 0 simplified : F(G!"(((((gu1.HasLeft_0+gu1.HasLeft_1)+(gu1.HasLeft_2+gu1.HasLeft_3))+((gu1.HasLeft_4+gu1.HasLeft_5)+(gu1.HasLeft_6+gu1.HasLeft_7)))...538
Detected timeout of ITS tools.
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-07 finished in 1010286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(G(p0))&&F(p1)))||(p2&&X(X((F(G(p0))&&F(p1)))))))))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:07:00] [INFO ] Invariant cache hit.
[2025-06-02 16:07:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 2339 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 21200 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45372ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 45377ms
[2025-06-02 16:07:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:07:46] [INFO ] Implicit Places using invariants in 312 ms returned []
[2025-06-02 16:07:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:07:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:08:20] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2025-06-02 16:08:59] [INFO ] Performed 25/170 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2025-06-02 16:09:36] [INFO ] Performed 29/170 implicitness test of which 0 returned IMPLICIT in 109 seconds.
[2025-06-02 16:10:12] [INFO ] Performed 33/170 implicitness test of which 0 returned IMPLICIT in 145 seconds.
[2025-06-02 16:10:12] [INFO ] Timeout of Implicit test with SMT after 145 seconds.
[2025-06-02 16:10:12] [INFO ] Implicit Places using invariants and state equation in 146513 ms returned []
Implicit Place search using SMT with State Equation took 146841 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:10:12] [INFO ] Invariant cache hit.
[2025-06-02 16:10:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33974ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33981ms
Finished structural reductions in LTL mode , in 1 iterations and 226225 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-08
Product exploration explored 100000 steps with 11932 reset in 664 ms.
Stack based approach found an accepted trace after 36131 steps with 4306 reset with depth 7 and stack size 7 in 257 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-08 finished in 227427 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((X(G(!p0)) U (F((p1||X(p2))) U X(X(p3))))))'
Support contains 120 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:10:48] [INFO ] Invariant cache hit.
[2025-06-02 16:10:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44188ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44192ms
[2025-06-02 16:11:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:32] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-02 16:11:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:12:03] [INFO ] Performed 128/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 16:12:39] [INFO ] Performed 131/170 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2025-06-02 16:13:20] [INFO ] Performed 135/170 implicitness test of which 0 returned IMPLICIT in 106 seconds.
[2025-06-02 16:13:52] [INFO ] Performed 137/170 implicitness test of which 0 returned IMPLICIT in 139 seconds.
[2025-06-02 16:13:52] [INFO ] Timeout of Implicit test with SMT after 139 seconds.
[2025-06-02 16:13:52] [INFO ] Implicit Places using invariants and state equation in 140136 ms returned []
Implicit Place search using SMT with State Equation took 140289 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:13:52] [INFO ] Invariant cache hit.
[2025-06-02 16:13:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34038ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34043ms
Finished structural reductions in LTL mode , in 1 iterations and 218541 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 526 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) p0), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-10
Stuttering criterion allowed to conclude after 139 steps with 34 reset in 4 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-10 finished in 219119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(p1 U p2)))'
Support contains 40 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:14:27] [INFO ] Invariant cache hit.
[2025-06-02 16:14:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44040ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44044ms
[2025-06-02 16:15:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:11] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-02 16:15:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:15:42] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 16:16:19] [INFO ] Performed 20/170 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2025-06-02 16:16:49] [INFO ] Performed 39/170 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2025-06-02 16:17:00] [INFO ] Implicit Places using invariants and state equation in 108687 ms returned []
Implicit Place search using SMT with State Equation took 108987 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:17:00] [INFO ] Invariant cache hit.
[2025-06-02 16:17:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33979ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33983ms
Finished structural reductions in LTL mode , in 1 iterations and 187033 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-11
Stuttering criterion allowed to conclude after 21 steps with 4 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-11 finished in 187238 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(p0))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 130 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:17:34] [INFO ] Invariant cache hit.
[2025-06-02 16:17:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44089ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44093ms
[2025-06-02 16:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:19] [INFO ] Implicit Places using invariants in 316 ms returned []
[2025-06-02 16:18:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:18:50] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 16:19:31] [INFO ] Performed 22/170 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2025-06-02 16:20:02] [INFO ] Performed 149/170 implicitness test of which 0 returned IMPLICIT in 102 seconds.
[2025-06-02 16:20:02] [INFO ] Implicit Places using invariants and state equation in 103732 ms returned []
Implicit Place search using SMT with State Equation took 104051 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:20:02] [INFO ] Redundant transitions in 36 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:20:02] [INFO ] Invariant cache hit.
[2025-06-02 16:20:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34064ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 182399 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-12
Product exploration explored 100000 steps with 11921 reset in 725 ms.
Product exploration explored 100000 steps with 11941 reset in 723 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 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 33 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (4764 resets) in 366 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (339 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 302040 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 302040 steps, saw 76370 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2025-06-02 16:20:41] [INFO ] Invariant cache hit.
[2025-06-02 16:20:41] [INFO ] State equation strengthened by 1010 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1391 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3060ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 78 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:20:44] [INFO ] Invariant cache hit.
[2025-06-02 16:20:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44185ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44271 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4800 resets) in 338 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (339 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 306560 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 306560 steps, saw 77352 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2025-06-02 16:21:32] [INFO ] Invariant cache hit.
[2025-06-02 16:21:32] [INFO ] State equation strengthened by 1010 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/2055 variables, 10/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7519 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9527ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 69 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:21:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:21:42] [INFO ] Implicit Places using invariants in 321 ms returned []
[2025-06-02 16:21:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:21:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:22:15] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 16:22:56] [INFO ] Performed 24/170 implicitness test of which 0 returned IMPLICIT in 74 seconds.
[2025-06-02 16:23:35] [INFO ] Performed 30/170 implicitness test of which 0 returned IMPLICIT in 113 seconds.
[2025-06-02 16:24:11] [INFO ] Performed 34/170 implicitness test of which 0 returned IMPLICIT in 149 seconds.
[2025-06-02 16:24:11] [INFO ] Timeout of Implicit test with SMT after 149 seconds.
[2025-06-02 16:24:11] [INFO ] Implicit Places using invariants and state equation in 149701 ms returned []
Implicit Place search using SMT with State Equation took 150024 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:24:11] [INFO ] Redundant transitions in 38 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:24:11] [INFO ] Invariant cache hit.
[2025-06-02 16:24:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34009ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184161 ms. Remains : 170/170 places, 1885/1885 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 101 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:24:46] [INFO ] Invariant cache hit.
[2025-06-02 16:24:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44199ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44203ms
[2025-06-02 16:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:30] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-06-02 16:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:26:03] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 16:26:39] [INFO ] Performed 21/170 implicitness test of which 0 returned IMPLICIT in 68 seconds.
[2025-06-02 16:27:05] [INFO ] Implicit Places using invariants and state equation in 95240 ms returned []
Implicit Place search using SMT with State Equation took 95553 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:27:06] [INFO ] Redundant transitions in 42 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:27:06] [INFO ] Invariant cache hit.
[2025-06-02 16:27:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34010ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34013ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 173937 ms. Remains : 170/170 places, 1885/1885 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 37 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (4775 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (341 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 304492 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 304492 steps, saw 76946 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2025-06-02 16:27:43] [INFO ] Invariant cache hit.
[2025-06-02 16:27:43] [INFO ] State equation strengthened by 1010 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3052ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 77 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:27:46] [INFO ] Invariant cache hit.
[2025-06-02 16:27:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44232ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44316 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4762 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (338 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 306446 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 306446 steps, saw 77334 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2025-06-02 16:28:33] [INFO ] Invariant cache hit.
[2025-06-02 16:28:33] [INFO ] State equation strengthened by 1010 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/2055 variables, 10/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9062 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11061ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 68 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 67 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:28:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:28:45] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-02 16:28:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:28:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:29:18] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 16:29:53] [INFO ] Performed 20/170 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2025-06-02 16:30:24] [INFO ] Performed 37/170 implicitness test of which 0 returned IMPLICIT in 98 seconds.
[2025-06-02 16:30:59] [INFO ] Performed 40/170 implicitness test of which 0 returned IMPLICIT in 133 seconds.
[2025-06-02 16:30:59] [INFO ] Timeout of Implicit test with SMT after 133 seconds.
[2025-06-02 16:30:59] [INFO ] Implicit Places using invariants and state equation in 134018 ms returned []
Implicit Place search using SMT with State Equation took 134318 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:30:59] [INFO ] Redundant transitions in 42 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:30:59] [INFO ] Invariant cache hit.
[2025-06-02 16:30:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34078ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168532 ms. Remains : 170/170 places, 1885/1885 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 11936 reset in 696 ms.
Product exploration explored 100000 steps with 11957 reset in 682 ms.
Built C files in :
/tmp/ltsmin9691730613417542682
[2025-06-02 16:31:35] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2025-06-02 16:31:35] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9691730613417542682
Running compilation step : cd /tmp/ltsmin9691730613417542682;'/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/ltsmin9691730613417542682;'/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/ltsmin9691730613417542682;'/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 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 86 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:31:38] [INFO ] Invariant cache hit.
[2025-06-02 16:31:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44269ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44273ms
[2025-06-02 16:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:32:22] [INFO ] Implicit Places using invariants in 365 ms returned []
[2025-06-02 16:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:32:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:32:56] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 16:33:31] [INFO ] Performed 21/170 implicitness test of which 0 returned IMPLICIT in 68 seconds.
[2025-06-02 16:34:08] [INFO ] Performed 38/170 implicitness test of which 0 returned IMPLICIT in 104 seconds.
[2025-06-02 16:34:38] [INFO ] Performed 58/170 implicitness test of which 0 returned IMPLICIT in 134 seconds.
[2025-06-02 16:34:38] [INFO ] Timeout of Implicit test with SMT after 134 seconds.
[2025-06-02 16:34:38] [INFO ] Implicit Places using invariants and state equation in 135545 ms returned []
Implicit Place search using SMT with State Equation took 135915 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:34:38] [INFO ] Redundant transitions in 35 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:34:38] [INFO ] Invariant cache hit.
[2025-06-02 16:34:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33897ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33901ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 214224 ms. Remains : 170/170 places, 1885/1885 transitions.
Built C files in :
/tmp/ltsmin7496830441766931133
[2025-06-02 16:35:12] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2025-06-02 16:35:12] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7496830441766931133
Running compilation step : cd /tmp/ltsmin7496830441766931133;'/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/ltsmin7496830441766931133;'/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/ltsmin7496830441766931133;'/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-02 16:35:15] [INFO ] Flatten gal took : 153 ms
[2025-06-02 16:35:15] [INFO ] Flatten gal took : 131 ms
[2025-06-02 16:35:15] [INFO ] Time to serialize gal into /tmp/LTL13255853700828630870.gal : 11 ms
[2025-06-02 16:35:15] [INFO ] Time to serialize properties into /tmp/LTL5568338486153484013.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/LTL13255853700828630870.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15401708609798922243.hoa' '-atoms' '/tmp/LTL5568338486153484013.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/LTL5568338486153484013.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15401708609798922243.hoa
Detected timeout of ITS tools.
[2025-06-02 16:35:31] [INFO ] Flatten gal took : 78 ms
[2025-06-02 16:35:31] [INFO ] Flatten gal took : 75 ms
[2025-06-02 16:35:31] [INFO ] Time to serialize gal into /tmp/LTL16539373227659686146.gal : 12 ms
[2025-06-02 16:35:31] [INFO ] Time to serialize properties into /tmp/LTL8651443124481680264.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/LTL16539373227659686146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8651443124481680264.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("(((((WaitLeft_0+WaitLeft_1)+(WaitLeft_2+WaitLeft_3))+((WaitLeft_4+WaitLeft_5)+(WaitLeft_6+WaitLeft_7)))+(WaitLeft_8+WaitLeft_9))...279
Formula 0 simplified : F!"(((((WaitLeft_0+WaitLeft_1)+(WaitLeft_2+WaitLeft_3))+((WaitLeft_4+WaitLeft_5)+(WaitLeft_6+WaitLeft_7)))+(WaitLeft_8+WaitLeft_9))<...275
Detected timeout of ITS tools.
[2025-06-02 16:35:46] [INFO ] Flatten gal took : 76 ms
[2025-06-02 16:35:46] [INFO ] Applying decomposition
[2025-06-02 16:35:46] [INFO ] Flatten gal took : 77 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/graph13889062250669723977.txt' '-o' '/tmp/graph13889062250669723977.bin' '-w' '/tmp/graph13889062250669723977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13889062250669723977.bin' '-l' '-1' '-v' '-w' '/tmp/graph13889062250669723977.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:35:46] [INFO ] Decomposing Gal with order
[2025-06-02 16:35:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:35:47] [INFO ] Removed a total of 1600 redundant transitions.
[2025-06-02 16:35:47] [INFO ] Flatten gal took : 916 ms
[2025-06-02 16:35:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1620 labels/synchronizations in 67 ms.
[2025-06-02 16:35:47] [INFO ] Time to serialize gal into /tmp/LTL11074993698076292429.gal : 11 ms
[2025-06-02 16:35:47] [INFO ] Time to serialize properties into /tmp/LTL10195648612843481497.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/LTL11074993698076292429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10195648612843481497.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G("(((((gu1.WaitLeft_0+gu1.WaitLeft_1)+(gu1.WaitLeft_2+gu1.WaitLeft_3))+((gu1.WaitLeft_4+gu1.WaitLeft_5)+(gu1.WaitLeft_6+gu1.WaitLe...359
Formula 0 simplified : F!"(((((gu1.WaitLeft_0+gu1.WaitLeft_1)+(gu1.WaitLeft_2+gu1.WaitLeft_3))+((gu1.WaitLeft_4+gu1.WaitLeft_5)+(gu1.WaitLeft_6+gu1.WaitLef...355
Detected timeout of ITS tools.
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-12 finished in 1108242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X(X((X(p2) U (X(G(p2))||(p0&&X(p2)))))))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:36:02] [INFO ] Invariant cache hit.
[2025-06-02 16:36:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 209 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44256ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44263ms
[2025-06-02 16:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:36:47] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 16:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:36:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:37:18] [INFO ] Performed 128/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 16:37:51] [INFO ] Performed 130/170 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2025-06-02 16:38:23] [INFO ] Performed 132/170 implicitness test of which 0 returned IMPLICIT in 95 seconds.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;